{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T10:03:48Z","timestamp":1784541828891,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440505","type":"print"},{"value":"9783540457084","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45708-9_5","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T04:48:16Z","timestamp":1192769296000},"page":"61-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":503,"title":["Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anna","family":"Lysyanskaya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,9,13]]},"reference":[{"key":"5_CR1","unstructured":"G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology \u2014 CRYPTO 2000, vol. 1880 of LNCS, pp. 255\u2013270. Springer Verlag, 2000."},{"key":"5_CR2","unstructured":"G. Ateniese and G. Tsudik. Quasi-efficient revocation of group signatures. \n                    http:\/\/www.eprint.iacr.org\/2001\/101\n                    \n                  , 2001."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"N. Bari\u0107 and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In EUROCRYPT\u2019 97, vol. 1233 of LNCS, pp. 480\u2013494.","DOI":"10.1007\/3-540-69053-0_33"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. de Mare. One-way accumulators: A decentralized alternative to digital signatures. In EUROCRYPT\u2019 93, vol. 765 of LNCS, pp. 274\u2013285.","DOI":"10.1007\/3-540-48285-7_24"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"S. Brands. Rethinking Public Key Infrastructure and Digital Certificates \u2014 Building in Privacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands, 1999.","DOI":"10.7551\/mitpress\/5931.001.0001"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"E. Bresson and J. Stern. Group signatures with efficient revocation. In Proceedings of PKC2001, vol. 1992 of LNCS, pp. 190\u2013206. Springer, 2001.","DOI":"10.1007\/3-540-44586-2_15"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"J. Camenisch. Efficient and generalized group signatures. In Advances in Cryptology \u2014 EUROCRYPT\u2019 97, vol. 1233 of LNCS, pp. 465\u2013479.","DOI":"10.1007\/3-540-69053-0_32"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. \n                    http:\/\/www.eprint.iacr.org\/2001\n                    \n                  , 2001.","DOI":"10.1007\/3-540-45708-9_5"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Advances in Cryptology \u2014 EUROCRYPT 2001, vol. 2045 of LNCS, pp. 93\u2013118.","DOI":"10.1007\/3-540-44987-6_7"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"J. Camenisch and A. Lysyanskaya. An identity escrow scheme with appointed verifiers. In CRYPTO 2001, vol. 2139 of LNCS, pp. 388\u2013407.","DOI":"10.1007\/3-540-44647-8_23"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In Advances in Cryptology \u2014 ASIACRYPT\u2019 98, vol. 1514 of LNCS, pp. 160\u2013174.","DOI":"10.1007\/3-540-49649-1_14"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In CRYPTO\u2019 99, vol. 1666 of LNCS, pp. 413\u2013430.","DOI":"10.1007\/3-540-48405-1_27"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology \u2014 CRYPTO\u2019 97, vol. 1296 of LNCS, pp. 410\u2013424, 1997.","DOI":"10.1007\/BFb0052252"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"L. Chen and T. P. Pedersen. New group signature schemes. In Advances in Cryptology \u2014 EUROCRYPT\u2019 94, vol. 950 of LNCS, pp. 171\u2013181, 1995.","DOI":"10.1007\/BFb0053433"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology \u2014 CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 13\u201325, Berlin, 1998. Springer Verlag.","DOI":"10.1007\/BFb0055717"},{"key":"5_CR17","unstructured":"I. Damg\u00f8ard and E. Fujisaki. An integer commitment scheme based on groups with hidden order. \n                    http:\/\/www.eprint.iacr.org\/2001\/064\n                    \n                  , 2001."},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO\u2019 97, vol. 1294 of LNCS, pp. 16\u201330.","DOI":"10.1007\/BFb0052225"},{"key":"5_CR19","unstructured":"R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In EUROCRYPT\u2019 99, vol. 1592 of LNCS, pp. 123\u2013139."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design. In Advances in Cryptology \u2014 CRYPTO\u2019 86, vol. 263 of LNCS, pp. 171\u2013185, 1987.","DOI":"10.1007\/3-540-47721-7_11"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"J. Kilian and E. Petrank. Identity escrow. In Advances in Cryptology \u2014 CRYPTO\u2019 98, vol. 1642 of LNCS, pp. 169\u2013185, Berlin, 1998. Springer Verlag.","DOI":"10.1007\/BFb0055727"},{"key":"5_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-45247-8_12","volume-title":"ICISC 2000","author":"H.-J. Kim","year":"2001","unstructured":"H.-J. Kim, J. I. Lim, and D. H. Lee. Efficient and secure member deletion in group signature schemes. In ICISC 2000, number 2015 in LNCS, pp. 150\u2013161, 2001."},{"key":"5_CR23","unstructured":"A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In Selected Areas in Cryptography, vol. 1758 of LNCS. Springer Verlag, 1999."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM CCS, pp. 245\u2013254. ACM press, nov 2000.","DOI":"10.1145\/352600.352639"},{"key":"5_CR25","unstructured":"T. Sander, A. Ta-Shma, and M. Yung. Blind, auditable membership proofs. In Financial Cryptography\u2019 00, vol. 1962 of LNCS, pp. 53\u201371, 2000."},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir. On the generation of cryptographically strong pseudorandom sequences. In ACM Transaction on Computer Systems, vol.1, pp. 38\u201344, 1983.","journal-title":"ACM Transaction on Computer Systems"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"D. X. Song. Practical forward secure group signature schemes. In Proc. 8th ACM CCS, pp. 225\u2013234. ACM press, nov 2001.","DOI":"10.1145\/501983.502015"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45708-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:26:54Z","timestamp":1558261614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45708-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440505","9783540457084"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45708-9_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"13 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}