{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:11:38Z","timestamp":1786979498819,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633846","type":"print"},{"value":"9783540695288","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0052252","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T14:37:31Z","timestamp":1155825451000},"page":"410-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":649,"title":["Efficient group signature schemes for large groups"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Stadler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"issue":"177","key":"29_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1090\/S0025-5718-1987-0866095-8","volume":"43","author":"L. M. Adleman","year":"1987","unstructured":"L. M. Adleman, D. R. Estes, and K. S. McCurley. Solving bivaxiate quadratic congruences in random polynomial time. Mathematics of Computation, 43(177):17\u201328, Jan. 1987.","journal-title":"Mathematics of Computation"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In First ACM Conference on Computer and Communication Security, pages 62\u201373. Association for Computing Machinery, 1993.","DOI":"10.1145\/168588.168596"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"J. Boyar and R. Peralta. Short discreet proofs. In Advances in Cryptology \u2014 EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 131\u2013142. Springer Verlag, 1996.","DOI":"10.1007\/3-540-68339-9_12"},{"key":"29_CR4","unstructured":"S. Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI, Apr. 1993."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"S. Brands. Rapid demonstration of linear relations connected by boolean operators. In In Advances in Cryptology \u2014 EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 318\u2013333. Springer Verlag, 1997.","DOI":"10.1007\/3-540-69053-0_22"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, and C. Cr\u00e9peau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2):156\u2013189, Oct. 1988.","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"J. Camenisch. Efficient and generalized group signatures. In In Advances in Cryptology \u2014 EUROCRYPT '97, volume 1233 of Lecture Notes in Computer Science, pages 465\u2013479. Springer Verlag, 1997.","DOI":"10.1007\/3-540-69053-0_32"},{"key":"29_CR8","volume-title":"Technical Report TR 260","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch and M. Stadler. Proof systems for general statements about discrete logarithms. Technical Report TR 260, Institute for Theoretical Computer Science, ETH Z\u00fcrich, Mar. 1997."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"D. Chaum. Blind signature systems. In Advances in Cryptology \u2014 CRYPTO '83, page 153. Plenum Press, 1984.","DOI":"10.1007\/978-1-4684-4730-9_14"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"D. Chaum and H. van Antwerpen. Undeniable signatures. In Advances in Cryptology \u2014 CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 212\u2013216. Springer Verlag, 1990.","DOI":"10.1007\/0-387-34805-0_20"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology \u2014 EUROCRYPT '91, volume 547 of Lecture Notes in Computer Science, pages 257\u2013265. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-46416-6_22"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"L. Chen and T. P. Pedersen. New group signature schemes. In Advances in Cryptology \u2014 EUROCRYPT '94, volume 950 of Lecture Notes in Computer Science, pages 171\u2013181. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0053433"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"I. B. Damg\u00e5rd. Practical and provable secure release of a secret and exchange of signature. In Advances in Cryptology \u2014 EUROCRYPT '93, volume 765 of Lecture Notes in Computer Science, pages 200\u2013217. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-48285-7_17"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In Advances in Cryptology \u2014 CRYPTO '84, volume 196 of Lecture Notes in Computer Science, pages 10\u201318. Springer Verlag, 1985.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1:77\u201394, 1988.","journal-title":"Journal of Cryptology"},{"key":"29_CR16","unstructured":"E. Fujisaki and T. Okamoto. Witness hiding protocols to confirm modular polynomial relations. In The 1997 Symposium on Cryptograpy and Information Security, Fukuoka, Japan, Jan. 1997. The Institute of Electronics, Information and Communcation Engineers. SCSI97-33D."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"S. J. Kim, S. J. Park, and D. H. Won. Convertible group signatures. In Advances in Cryptology \u2014 ASIACRYPT '96, volume 1163 of Lecture Notes in Computer Science, pages 311\u2013321. Springer Verlag, 1996.","DOI":"10.1007\/BFb0034857"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"K. McCurley. Odds and ends from cryptology and computational number theory. In Cryptology and computational number theory, volume 42 of Proceedings of Symposia in Applied Mathematics, pages 145\u2013166. American Mathematical Society, 1990.","DOI":"10.1090\/psapm\/042\/1095555"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"T. Okamoto. Threshold key-recovery systems for RSA. In Security Protocols Workshop, Paris, 1997.","DOI":"10.1007\/BFb0028169"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"H. Ong, C. P. Schnorr, and A. Shamir. Efficient signature schemes based on polymonial equations. In Advances in Cryptology \u2014 CRYPTO '84, volume 196 of Lecture Notes in Computer Science, pages 37\u201346. Springer Verlag, 1984.","DOI":"10.1007\/3-540-39568-7_4"},{"key":"29_CR21","unstructured":"S. J. Park, I. S. Lee, and D. H. Won. A practical group signature. In Proceedings of the 1995 Japan-Korea Workshop on Information Security and Cryptography, pages 127\u2013133, Jan. 1995."},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"H. Petersen. How to convert any digital signature scheme into a group signature scheme. In Security Protocols Workshop, Paris, 1997.","DOI":"10.1007\/BFb0028168"},{"issue":"5","key":"29_CR23","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TIT.1987.1057350","volume":"33","author":"J. M. Pollard","year":"1987","unstructured":"J. M. Pollard and C. P. Schnorr. An efficient solution of the congruence x\n                2 + ky\n                2 = m (modn). IEEE Transactions on Information Theory, 33(5):702\u2013709, September 1987.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"29_CR24","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120\u2013126, Feb. 1978.","journal-title":"Communications of the ACM"},{"issue":"3","key":"29_CR25","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239\u2013252, 1991.","journal-title":"Journal of Cryptology"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"M. Stadler. Publicly verifiable secret sharing. In Advances in Cryptology \u2014 EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 191\u2013199. Springer Verlag, 1996.","DOI":"10.1007\/3-540-68339-9_17"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:23:51Z","timestamp":1580336631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052252"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0052252","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}