{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T02:29:05Z","timestamp":1773541745451,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540651093","type":"print"},{"value":"9783540496496","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-49649-1_14","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:21:12Z","timestamp":1194985272000},"page":"160-174","source":"Crossref","is-referenced-by-count":82,"title":["A Group Signature Scheme with Improved Efficiency (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Michels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 97","author":"N. Bari\u0107","year":"1997","unstructured":"N. Bari\u0107 and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In W. Fumy, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 97, volume 1233 of LNCS, pages 480\u2013494. Springer Verlag, 1997."},{"key":"14_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":"14_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BFb0052253","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 97","author":"D. Boneh","year":"1997","unstructured":"D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In B. Kaliski, ed., Advances in Cryptology \u2014 CRYPTO\u2019 97, volume 1296 of LNCS, pages 425\u2013439. Springer Verlag, 1997."},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF00196727","volume":"4","author":"J. Boyar","year":"1991","unstructured":"J. Boyar, K. Friedl, and C. Lund. Practical zero-knowledge proofs: Giving hints and using deficiencies. Journal of Cryptology, 4(3):185\u2013206, 1991.","journal-title":"Journal of Cryptology"},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-68339-9_12","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 96","author":"J. Boyar","year":"1996","unstructured":"J. Boyar and R. Peralta. Short discreet proofs. In U. Maurer, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 96, volume 1070 of LNCS, pages 131\u2013142. Springer Verlag, 1996."},{"issue":"2","key":"14_CR6","doi-asserted-by":"crossref","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":"14_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/3-540-69053-0_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch. Efficient and generalized group signatures. In W. Fumy, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 97, volume 1233 of LNCS, pages 465\u2013479. Springer Verlag, 1997."},{"key":"14_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-61770-1_26","volume-title":"Computer Security \u2014 ESORICS 96","author":"J. Camenisch","year":"1996","unstructured":"J. Camenisch, U. Maurer, and M. Stadler. Digital payment systems with passive anonymity-revoking trustees. In Computer Security \u2014 ESORICS 96, volume 1146 of LNCS, pages 33\u201343. Springer Verlag, 1996."},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, ed., Advances in Cryptology \u2014 CRYPTO\u2019 97, volume 1296 of LNCS, pages 410\u2013424. Springer Verlag, 1997."},{"key":"14_CR10","series-title":"PhD thesis","isbn-type":"print","volume-title":"Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem","author":"J. L. Camenisch","year":"1998","unstructured":"J. L. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Z\u00fcrich, 1998. Diss. ETH No. 12520, ISBN 3-89649-286-1, Hartung Gorre Verlag, Konstanz.","ISBN":"https:\/\/id.crossref.org\/isbn\/3896492861"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, and S. Halevi. The random oracle methodology, revisited. In Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), 1998.","DOI":"10.1145\/276698.276741"},{"key":"14_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 98","author":"D. Catalano","year":"1998","unstructured":"D. Catalano and R. Gennaro. New efficient and secure protocols for verifiable signature sharing and other applications. In Advances in Cryptology \u2014 CRYPTO\u2019 98, LNCS. Springer Verlag, 1998."},{"key":"14_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054154","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 98","author":"A. Chan","year":"1998","unstructured":"A. Chan, Y. Frankel, and Y. Tsiounis. Easy come-easy go divisible cash. In Advances in Cryptology \u2014 EUROCRYPT\u2019 98, volume 1403 of LNCS."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In Advances in Cryptology \u2014 EUROCRYPT\u2019 87, pages 127\u2013141.","DOI":"10.1007\/3-540-39118-5_13"},{"key":"14_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-47555-9_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"D. Chaum","year":"1993","unstructured":"D. Chaum and T. P. Pedersen. Transferred cash grows in size. In R. A. Rueppel, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 92, volume 658 of LNCS, pages 390\u2013407. Springer-Verlag, 1993"},{"key":"14_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-46416-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 91","author":"D. Chaum","year":"1991","unstructured":"D. Chaum and E. van Heyst. Group signatures. In D. W. Davies, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 91, volume 547 of LNCS, pages 257\u2013265."},{"key":"14_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BFb0053433","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 94","author":"L. Chen","year":"1994","unstructured":"L. Chen and T. P. Pedersen. New group signature schemes. In Advances in Cryptology \u2014 EUROCRYPT\u2019 94, volume 950 of LNCS, pages 171\u2013181."},{"key":"14_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 96","author":"D. Coppersmith","year":"1996","unstructured":"D. Coppersmith. Finding a Small Root of a Bivariatre Interger Equation; Factoring with High Bits Known In U. Maurer, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 96, volume 1070 of LNCS, pages 178\u2013189. Springer Verlag, 1996."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"R. Cramer and I. Damg\u00e5rd. Linear zero-knowledge: A note on efficient zero-knowledge proofs and arguments. In Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), pages 436\u2013445. ACM press, 1997.","DOI":"10.1145\/258533.258635"},{"key":"14_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, ed., Advances in Cryptology \u2014 CRYPTO\u2019 94, volume 839 of LNCS, pages 174\u2013187."},{"key":"14_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 84","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In G. R. Blakley and D. Chaum, eds., Advances in Cryptology \u2014 CRYPTO\u2019 84, volume 196 of LNCS, pages 10\u201318. Springer Verlag, 1985."},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00191320","volume":"5","author":"J.-H. Evertse","year":"1992","unstructured":"J.-H. Evertse and E. van Heyst. Which new RSA signatures can be computed from certain given RSA signatures? Journal of Cryptology, 5:41\u201352, 1992.","journal-title":"Journal of Cryptology"},{"key":"14_CR23","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":"14_CR24","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. In A. M. Odlyzko, ed., Advances in Cryptology \u2014 CRYPTO\u2019 86, volume 263 of LNCS, pages 186\u2013194. Springer Verlag, 1987."},{"key":"14_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 97","author":"E. Fujisaki","year":"1997","unstructured":"E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. S. Kaliski, ed., Advances in Cryptology \u2014 CRYPTO\u2019 97, volume 1294 of LNCS, pages 16\u201330. Springer Verlag, 1997."},{"key":"14_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/3-540-46877-3_44","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 90","author":"M. Girault","year":"1991","unstructured":"M. Girault. An identity-based identification scheme based on discrete logarihtms modulo a composite number. In I. B. Damg\u00e5rd, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 90, volume 473 of LNCS, pages 481\u2013486. Springer-Verlag, 1991."},{"key":"14_CR27","series-title":"Lect Notes Comput Sci","first-page":"490","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 91","author":"M. Girault","year":"1992","unstructured":"M. Girault. Self-certified public keys. In Advances in Cryptology \u2014 EUROCRYPT\u2019 91, volume 547 of LNCS, pages 490\u2013497. Springer-Verlag, 1992."},{"key":"14_CR28","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 98","author":"J. Kilian","year":"1998","unstructured":"J. Kilian and E. Petrank. Identity escrow. In Advances in Cryptology \u2014 CRYPTO\u2019 98, LNCS. Springer Verlag, 1998."},{"key":"14_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BFb0034857","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u2019 96","author":"S. J. Kim","year":"1996","unstructured":"S. J. Kim, S. J. Park, and D. H. Won. Convertible group signatures. In Advances in Cryptology \u2014 ASIACRYPT\u2019 96, volume 1163 of LNCS, pages 311\u2013321."},{"key":"14_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-46766-1_20","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 91","author":"K. Koyama","year":"1991","unstructured":"K. Koyama, U. Maurer, T. Okamoto, and S. Vanstone New Public-key Schemes Based on Elliptic Curves over the Ring Z n. In Advances in Cryptology \u2014 CRYPTO\u2019 91, volume 576 of LNCS, pages 252\u2013266."},{"key":"14_CR31","unstructured":"C. H. Lim and P. J. Lee. On the security of convertible group signatures. Electronics Letters, 1996."},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"A. Lysyanskaya and Z. Ramzan. Group blind digital signatures: A scalable solution to electronic cash. In Proc. Second Int. Conf. on Financial Cryptography, 1998.","DOI":"10.1007\/BFb0055483"},{"key":"14_CR33","unstructured":"M. Michels. Comments on some group signature schemes. TR-96-3-D, Departement of Computer Science, University of Technology, Chemnitz-Zwickau, Nov. 1996."},{"key":"14_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"T. Okamoto","year":"1993","unstructured":"T. Okamoto. Provable secure and practical identification schemes and corresponding signature schemes. In E. F. Brickell, ed., Advances in Cryptology \u2014 CRYPTO\u2019 92, volume 740 of LNCS, pages 31\u201353. Springer-Verlag, 1993."},{"key":"14_CR35","unstructured":"S. J. Park, I. S. Lee, and D. H. Won. A practical group signature. In Proc. of the 1995 Japan-Korea Workshop on Information Security and Cryptography."},{"key":"14_CR36","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"},{"key":"14_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/3-540-68339-9_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 96","author":"D. Pointcheval","year":"1996","unstructured":"D. Pointcheval and J. Stern. Security proofs for signature schemes. In U. Maurer, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 96, volume 1070 of LNCS, pages 387\u2013398. Springer Verlag, 1996."},{"key":"14_CR38","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BFb0054143","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 98","author":"G. Poupard","year":"1998","unstructured":"G. Poupard and J. Stern. Security analysis of a practical \u201con the fly\u201e authentication and signature generation. In K. Nyberg, ed., Advances in Cryptology \u2014 EUROCRYPT\u2019 98, volume 1403 of LNCS, pages 422\u2013436. Springer Verlag, 1998."},{"issue":"2","key":"14_CR39","doi-asserted-by":"crossref","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. Comm. of the ACM, 21(2):120\u2013126, Feb. 1978.","journal-title":"Comm. of the ACM"},{"issue":"3","key":"14_CR40","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":"14_CR41","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 Trans. on Computer Systems, volume 1, pages 38\u201344, 1983.","journal-title":"ACM Trans. on Computer Systems"},{"key":"14_CR42","series-title":"PhD thesis","volume-title":"Cryptographic Protocols for Revocable Privacy","author":"M. Stadler","year":"1996","unstructured":"M. Stadler. Cryptographic Protocols for Revocable Privacy. PhD thesis, ETH Z\u00fcrich, 1996. Diss. ETH No. 11651."},{"key":"14_CR43","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-48184-2_9","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 87","author":"J. Graaf van de","year":"1988","unstructured":"J. van de Graaf and R. Peralta. A simple and secure way to show the validity of your public key. In C. Pomerance, ed., Advances in Cryptology \u2014 CRYPTO\u2019 87, volume 293 of LNCS, pages 128\u2013134. Springer-Verlag, 1988."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT\u201998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49649-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T07:29:30Z","timestamp":1556954970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49649-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540651093","9783540496496"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/3-540-49649-1_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}