{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:32:32Z","timestamp":1784874752882,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540004202","type":"print"},{"value":"9783540364139","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","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":[[2003]]},"DOI":"10.1007\/3-540-36413-7_20","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:44:57Z","timestamp":1184600697000},"page":"268-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":393,"title":["A Signature Scheme with Efficient Protocols"],"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":[[2003,3,14]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In M. Bellare, editor, Advances in Cryptology-CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 255\u2013270. Springer Verlag, 2000.","DOI":"10.1007\/3-540-44598-6_16"},{"key":"20_CR2","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-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, editor, Advances in Cryptology-EUROCRYPT\u2019 97, volume 1233 of Lecture Notes in Computer Science, pages 480\u2013494. Springer Verlag, 1997."},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology-CRYPTO\u2019 92","author":"M. Bellare","year":"1992","unstructured":"M. Bellare and O. Goldreich. On defining proofs of knowledge. In E. F. Brickell, editor, Advances in Cryptology-CRYPTO\u2019 92, volume 740 of Lecture Notes in Computer Science, pages 390\u2013420. Springer-Verlag, 1992."},{"key":"20_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology-EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"F. Boudot. Efficient proofs that a committed number lies in an interval. In B. Preneel, editor, Advances in Cryptology-EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 431\u2013444. Springer Verlag, 2000."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"S. Brands. Rethinking Public Key Infrastructure and Digital Certificates-Building in Privacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands, 1999.","DOI":"10.7551\/mitpress\/5931.001.0001"},{"issue":"2","key":"20_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":"20_CR7","doi-asserted-by":"crossref","unstructured":"J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multishow credential system with optional anonymity revocation. In B. Pfitzmann, editor, Advances in Cryptology-EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 93\u2013118. Springer Verlag, 2001.","DOI":"10.1007\/3-540-44987-6_7"},{"key":"20_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 99","author":"J. Camenisch","year":"1999","unstructured":"J. Camenisch and M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In J. Stern, editor, Advances in Cryptology-EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 107\u2013122. Springer Verlag, 1999."},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-48405-1_27","volume-title":"Advances in Cryptology-CRYPTO\u2019 99","author":"J. Camenisch","year":"1999","unstructured":"J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In M. Wiener, editor, Advances in Cryptology-CRYPTO\u2019 99, volume 1666 of Lecture Notes in Computer Science, pages 413\u2013430. Springer Verlag, 1999."},{"key":"20_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology-CRYPTO\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In B. Kaliski, editor, Advances in Cryptology-CRYPTO\u2019 97, volume 1296 of Lecture Notes in Computer Science, pages 410\u2013424. Springer Verlag, 1997."},{"key":"20_CR11","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, Hartung Gorre Verlag, Konstanz."},{"key":"20_CR12","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), pages 209\u2013218, 1998.","DOI":"10.1145\/276698.276741"},{"issue":"10","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030\u20131044, Oct. 1985.","journal-title":"Communications of the ACM"},{"key":"20_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-47721-7_10","volume-title":"Advances in Cryptology-CRYPTO\u2019 86","author":"D. Chaum","year":"1987","unstructured":"D. Chaum and J.-H. Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In M. Odlyzko, editor, Advances in Cryptology-CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 118\u2013167. Springer-Verlag, 1987."},{"key":"20_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BFb0032362","volume-title":"Cryptography: Policy and Algorithms","author":"L. Chen","year":"1995","unstructured":"L. Chen. Access with pseudonyms. In E. D. and J. Goli\u0107, editor, Cryptography: Policy and Algorithms, volume 1029 of Lecture Notes in Computer Science, pages 232\u2013243. Springer Verlag, 1995."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46\u201352. ACM press, nov 1999.","DOI":"10.1145\/319709.319716"},{"key":"20_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology-EUROCRYPT 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"I. Damg\u00e5rd. Efficient concurrent zero-knowledge in the auxiliary string model. In B. Preneel, editor, Advances in Cryptology-EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 431\u2013444. Springer Verlag, 2000."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd and E. Fujisaki. An integer commitment scheme based on groups with hidden order. http:\/\/eprint.iacr.org\/2001, 2001.","DOI":"10.1007\/3-540-36178-2_8"},{"key":"20_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/0-387-34799-2_26","volume-title":"Advances in Cryptology-CRYPTO\u2019 88","author":"I. B. Damg\u00e5rd","year":"1990","unstructured":"I. B. Damg\u00e5rd. Payment systems and credential mechanism with provable security against abuse by individuals. In S. Goldwasser, editor, Advances in Cryptology-CRYPTO\u2019 88, volume 403 of Lecture Notes in Computer Science, pages 328\u2013335. Springer Verlag, 1990."},{"issue":"6","key":"20_CR20","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. on Information Theory, IT-22(6):644\u2013654, Nov. 1976.","journal-title":"IEEE Trans. on Information Theory"},{"key":"20_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology-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, editor, Advances in Cryptology-CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 186\u2013194. Springer Verlag, 1987."},{"key":"20_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology-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. Kaliski, editor, Advances in Cryptology-CRYPTO\u2019 97, volume 1294 of Lecture Notes in Computer Science, pages 16\u201330. Springer Verlag, 1997."},{"key":"20_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 98","author":"E. Fujisaki","year":"1998","unstructured":"E. Fujisaki and T. Okamoto. A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In K. Nyberg, editor, Advances in Cryptology-EUROCRYPT\u2019 98, volume 1403 of Lecture Notes in Computer Science, pages 32\u201346. Springer Verlag, 1998."},{"key":"20_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-48910-X_9","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In J. Stern, editor, Advances in Cryptology-EUROCRYPT\u2019 99, volume 1592 of Lecture Notes in Computer Science, pages 123\u2013139. Springer Verlag, 1999."},{"issue":"1","key":"20_CR25","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. SIAM Journal of Computing, 18(1):186\u2013208, Feb. 1989.","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281\u2013308, Apr. 1988.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR27","series-title":"Lect Notes Comput Sci","volume-title":"Selected Areas in Cryptography","author":"A. Lysyanskaya","year":"1999","unstructured":"A. Lysyanskaya, R. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In H. Heys and C. Adams, editors, Selected Areas in Cryptography, volume 1758 of Lecture Notes in Computer Science. Springer Verlag, 1999."},{"key":"20_CR28","unstructured":"S. Micali. 6.875: Introduction to cryptography. MIT course taught in Fall 1997."},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. L. Miller","year":"1976","unstructured":"G. L. Miller. Riemann\u2019s hypothesis and tests for primality. Journal of Computer and System Sciences, 13:300\u2013317, 1976.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 33\u201343, Seattle, Washington, 15\u201317 May 1989. ACM.","DOI":"10.1145\/73007.73011"},{"key":"20_CR31","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M. O. Rabin","year":"1980","unstructured":"M. O. Rabin. Probabilistic algorithm for testing primality. Journal of Number Theory, 12:128\u2013138, 1980.","journal-title":"Journal of Number Theory"},{"issue":"2","key":"20_CR32","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. L. Rivest","year":"1978","unstructured":"R. L. 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"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"J. Rompel. One-way functions are necessary and sufficient for secure signatures. In Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 387\u2013394, Baltimore, Maryland, 1990. ACM.","DOI":"10.1145\/100216.100269"},{"issue":"3","key":"20_CR34","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":"20_CR35","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, volume 1, pages 38\u201344, 1983.","journal-title":"ACM Transaction on Computer Systems"}],"container-title":["Lecture Notes in Computer Science","Security in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36413-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T17:13:45Z","timestamp":1609953225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36413-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004202","9783540364139"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-36413-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"14 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}