{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T01:34:33Z","timestamp":1747532073743,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144382"},{"type":"electronic","value":"9783319144399"}],"license":[{"start":{"date-parts":[[2014,12,21]],"date-time":"2014-12-21T00:00:00Z","timestamp":1419120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,21]],"date-time":"2014-12-21T00:00:00Z","timestamp":1419120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14439-9_3","type":"book-chapter","created":{"date-parts":[[2014,12,20]],"date-time":"2014-12-20T13:59:49Z","timestamp":1419083989000},"page":"79-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Cryptographic Protocols Underlying Privacy-ABCs"],"prefix":"10.1007","author":[{"given":"Patrik","family":"Bichsel","sequence":"first","affiliation":[]},{"given":"Jan","family":"Camenisch","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Dubovitskaya","sequence":"additional","affiliation":[]},{"given":"Robert R.","family":"Enderlein","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Krenn","sequence":"additional","affiliation":[]},{"given":"Anja","family":"Lehmann","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Neven","sequence":"additional","affiliation":[]},{"given":"Franz-Stefan","family":"Preiss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,21]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Niko Bari\u0107 and Birgit Pfitzmann. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. In W. Fumy, editor, EUROCRYPT, volume 1233 of LNCS, pages 480\u2013494. Springer, 1997.","DOI":"10.1007\/3-540-69053-0_33"},{"key":"3_CR2","unstructured":"Stefan A Brands. An Efficient Off-line Electronic Cash System Based On The Representation Problem. Technical report, 1993."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Jan Camenisch, Aggelos Kiayias, and Moti Yung. On the Portability of Generalized Schnorr Proofs. In A. Joux, editor, EUROCRYPT 09, volume 5479 of LNCS, pages 425\u2013442. Springer, 2009.","DOI":"10.1007\/978-3-642-01001-9_25"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Anna Lysyanskaya. A Signature Scheme with Efficient Protocols. In S. Cimato, C. Galdi, and G. Persiano, editors, SCN 02, volume 2576 of LNCS, pages 268\u2013289. Springer, 2002.","DOI":"10.1007\/3-540-36413-7_20"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Anna Lysyanskaya. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In M. Yung, editor, CRYPTO, volume 2442 of LNCS, pages 61\u201376. Springer, 2002.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Markus Stadler. Efficient Group Signature Schemes for Large Groups (Extended Abstract). In B. S. Kaliski Jr., editor, CRYPTO, volume 1294 of LNCS, pages 410\u2013424. Springer, 1997.","DOI":"10.1007\/BFb0052252"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Ronald Cramer and Victor Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In L. R. Knudsen, editor, EUROCRYPT, volume 2332 of LNCS, pages 45\u201364. Springer, 2002.","DOI":"10.1007\/3-540-46035-7_4"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Jan Camenisch and Victor Shoup. Practical Verifiable Encryption and Decryption of Discrete Logarithms. In D. Boneh, editor, CRYPTO, volume 2729 of LNCS, pages 126\u2013144. Springer, 2003.","DOI":"10.1007\/978-3-540-45146-4_8"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Eiichiro Fujisaki. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In Y. Zheng, editor, ASIACRYPT 02, volume 2501 of LNCS, pages 125\u2013142. Springer, 2002.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In B. S. Kaliski Jr., editor, CRYPTO\n              97, volume 1294 of LNCS, pages 16\u201330. Springer, 1997.","DOI":"10.1007\/BFb0052225"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In A. M. Odlyzko, editor, CRYPTO\n              86, volume 263 of LNCS, pages 186\u2013194. Springer, 1987.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Helger Lipmaa. On Diophantine Complexity and Statistical Zero Knowledge Arguments. In C.-S. Laih, editor, ASIACRYPT 03, volume 2894 of LNCS, pages 398\u2013415. Springer, 2003.","DOI":"10.1007\/978-3-540-40061-5_26"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In J. Stern, editor, EUROCRYPT, volume 1592 of LNCS, pages 223\u2013238. Springer, 1999.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Torben Pryds Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In J. Feigenbaum, editor, CRYPTO\n              91, volume 576 of LNCS, pages 129\u2013140. Springer, 1991.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Michael O Rabin and Jeffery O Shallit. Randomized Algorithms in Number Theory. Communications in Pure and Applied Math, 39:239\u2013256, 1986.","DOI":"10.1002\/cpa.3160390713"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Ronald L Rivest, Adi Shamir, and Len Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2):120\u2013126, 1978.","DOI":"10.1145\/359340.359342"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Claus-Peter Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161\u2013174, 1991.","DOI":"10.1007\/BF00196725"},{"key":"3_CR18","unstructured":"Fatbardh Veseli, Jesus Luna, Hamza Ghani, Tsvetoslava Vateva-Gurova, Harald Zwingelberg, Katalin Storf, Felix Bieker, Daniel Deibler, and Marit Hansen. Benchmarking Criteria. Deliverable D2.3, The ABC4Trust EU Project, 2014. Available at https:\/\/abc4trust.eu\/download\/D2.3%20-%20Benchmarking%20Criteria.pdf, Last accessed on 2014-11-08."}],"container-title":["Attribute-based Credentials for Trust"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14439-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T03:45:33Z","timestamp":1676432733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-14439-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,21]]},"ISBN":["9783319144382","9783319144399"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14439-9_3","relation":{},"subject":[],"published":{"date-parts":[[2014,12,21]]},"assertion":[{"value":"21 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}