{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:49:31Z","timestamp":1778215771426,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540583332","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48658-5_23","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T20:50:39Z","timestamp":1186692639000},"page":"234-246","source":"Crossref","is-referenced-by-count":30,"title":["An Efficient Existentially Unforgeable Signature Scheme and its Applications"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare and S. Micali, How to Sign Given Any Trapdoor Function, Proc. 20th ACM Annual Symposium on the Theory of Computing, 1988, pp.32\u201342.","DOI":"10.1145\/62212.62216"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"J. Bos and D. Chaum, Provably Unforgeable Signatures, Proc. Advances in Cryptology \u2014 Crypto\u201992 Proceedings, Springer Verlag, 1993, pp. 1\u201314.","DOI":"10.1007\/3-540-48071-4_1"},{"issue":"6","key":"23_CR3","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman, New Directions in Cryptography, IEEE Trans. on Information Theory 22(6), 1976, pp. 644-654.","journal-title":"IEEE Trans. on Information Theory"},{"issue":"4","key":"23_CR4","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. Gamal El","year":"1985","unstructured":"T. El Gamal, A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms, IEEE Trans. Inform. Theory, IT-31(4), 1985, pp. 469\u2013472","journal-title":"IEEE Trans. Inform. Theory"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, and S. Micali, On-line\/Off-line Digital Signatures, Proc. Advances in Cryptology \u2014 Crypto\u2019 89, Springer Verlag, pp. 263\u2013275, 1990.","DOI":"10.1007\/0-387-34805-0_24"},{"key":"23_CR6","unstructured":"A. Fiat, Batch RSA, Proc. Advances in Cryptology \u2014 Crypto\u2019 89, Springer Verlag, 1990."},{"key":"23_CR7","unstructured":"A. Fiat and A. Shamir, How to Prove Yourself, Proc. of Advances in Cryptology \u2014 Crypto\u2019 86, Springer Verlag, 1987, pp. 641\u2013654."},{"key":"23_CR8","unstructured":"A. Fiat and A. Shamir, Method, Apparatus, and Article for Identification and Signature, United States Patent 4,748,668 (5\/31\/88)"},{"key":"23_CR9","unstructured":"O. Goldreich, Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme, Proc. Advances in Cryptology \u2014 Crypto\u2019 86, Springer Verlag, 1987."},{"issue":"2","key":"23_CR10","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 J. Computing 17(2), pp. 281\u2013301, 1988.","journal-title":"SIAM J. Computing"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Naor, Efficient Cryptographic Schemes Provably as Secure as Subset Sum, Proc. of the 30th Symp. on Foundations of Computer Science, 1989, pp. 236\u2013241. Full version: Technical Report CS93-12, Weizmann Institute.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"R. Merkle, A Digital Signature Based on a Conventional Encryption Function, Proc. Advances in Cryptology \u2014 Crypto\u2019 87, Springer Verlag, 1988, pp. 369\u2013378.","DOI":"10.1007\/3-540-48184-2_32"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. C. Merkle","year":"1978","unstructured":"R. C. Merkle and M. Hellman, Hiding information and Signature in Trapdoor Knapsack, IEEE Transaction on Information Theory, Vol 24, 1978, pp. 525\u2013530.","journal-title":"IEEE Transaction on Information Theory"},{"key":"23_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/0-387-34799-2_18","volume-title":"Proc. Advances in Cryptology \u2014 Crypto\u2019 88","author":"S. Micali","year":"1990","unstructured":"S. Micali and A. Shamir, An Improvement of the Fiat-Shamir Identification and Signature Scheme, Proc. Advances in Cryptology \u2014 Crypto\u2019 88, LNCS 403, Springer-Verlag, pp. 244\u2013247, 1990"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"M. Naor and M. Yung, Universal One Way Hash Functions and Their Cryptographic Applications, Proc. 21st ACM Annual Symposium on the Theory of Computing, 1989, pp. 33\u201343.","DOI":"10.1145\/73007.73011"},{"key":"23_CR16","unstructured":"M. O. Rabin Digital Signatures and Public Key Functions as Intractable as Factoring, Technical Memo TM-212, Lab. for Computer Science, MIT, 1979."},{"key":"23_CR17","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. Adelman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. of ACM, 21 (1978), pp. 120\u2013126.","journal-title":"Comm. of ACM"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"J. Rompel, One-way Function are Necessary and Sufficient for Signatures, Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 387\u2013394.","DOI":"10.1145\/100216.100269"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr, Efficient Signature Generation by Smart Cards, J. Cryptology 4, pp. 161\u2013174, 1991.","journal-title":"J. Cryptology"},{"key":"23_CR20","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 Pseudo-Random Number Sequences, ACM Trans. Comput. Sys., 1 (1983), pp. 38\u201344.","journal-title":"ACM Trans. Comput. Sys."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48658-5_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:46Z","timestamp":1619571046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48658-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540583332"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48658-5_23","relation":{},"subject":[]}}