{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:49:56Z","timestamp":1778215796488,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_33","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"387-398","source":"Crossref","is-referenced-by-count":592,"title":["Security Proofs for Signature Schemes"],"prefix":"10.1007","author":[{"given":"David","family":"Pointcheval","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Rando Oracles are Practical: a paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"issue":"6","key":"33_CR2","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. In IEEE Transactions on Information Theory, volume IT-22, no. 6, pages 644\u2013654, november 1976.","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR3","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir. How to Prove Yourself: practical solutions of identification and signature problems. In A. M. Odlyzko, editor, Advances in Cryptology \u2014 Proceedings of CRYPTO\u2019 86, volume 263 of Lecture Notes in Computer Science, pages 186\u2013194. Springer-Verlag, 1987."},{"issue":"4","key":"33_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. In IEEE Transactions on Information Theory, volume IT-31, no. 4, pages 469\u2013472, july 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff. Knowledge Complexity of Interactive Proof Systems. In Proceedings of the 17th ACM Symposium on the Theory of Computing STOC, pages 291\u2013304. ACM, 1985.","DOI":"10.1145\/22145.22178"},{"issue":"2","key":"33_CR6","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 Adaptative Chosen-Message Attacks. SIAM journal of computing, 17(2):281\u2013308, april 1988.","journal-title":"SIAM journal of computing"},{"key":"33_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Advances in Cryptology \u2014 Proceedings of EUROCRYPT\u2019 88","author":"L.C. Guillou","year":"1988","unstructured":"L.C. Guillou and J.-J. Quisquater. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. In C. G. G\u00fcnter, editor, Advances in Cryptology \u2014 Proceedings of EUROCRYPT\u2019 88, volume 330 of Lecture Notes in Computer Science, pages 123\u2013128. Springer-Verlag, 1988."},{"key":"33_CR8","unstructured":"NIST. Secure IIash Standard (SHS). Federal Information Processing Standards PUBlication 180-1, April 1995."},{"key":"33_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/3-540-49264-X_26","volume-title":"Advances in Cryptology \u2014 Proceedings of EUROCRYPT\u2019 95","author":"D. Pointcheval","year":"1995","unstructured":"D. Pointcheval. A New Identification Scheme Based on The Perceptrons Problem. In L.C. Guillou and J. J. Quisquater, editors, Advances in Cryptology \u2014 Proceedings of EUROCRYPT\u2019 95, volume 921 of Lecture Notes in Computer Science, pages 319\u2013328. Springer-Verlag, 1995."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"R. Rivest. The MD5 Message-Digest Algorithm. RFC 1321, April 1992.","DOI":"10.17487\/rfc1321"},{"issue":"2","key":"33_CR11","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, february 1978.","journal-title":"Communications of the ACM"},{"key":"33_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO\u2019 89","author":"C.P. Schnorr","year":"1990","unstructured":"C.P. Schnorr. Efficient Identification and Signatures for Smart Cards. In G. Brassard, editor, Advances in Cryptology \u2014 Proceedings of CRYPTO\u2019 89, volume 435 of Lecture Notes in Computer Science, pages 235\u2013251. Springer-Verlag, 1990."},{"key":"33_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/0-387-34805-0_54","volume-title":"Advances in Cryptology \u2014 Proceedings of CRYPTO\u2019 89","author":"A. Shamir","year":"1990","unstructured":"A. Shamir. An Efficient Identification Scheme Based on Permuted Kernels. In G. Brassard, editor, Advances in Cryptology \u2014 Proceedings of CRYPTO\u2019 89, volume 435 of Lecture Notes in Computer Science, pages 606\u2013609. Springer-Verlag, 1990."},{"key":"33_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology \u2014 proceedings of CRYPTO\u2019 93","author":"J. Stern","year":"1994","unstructured":"J. Stern. A New Identification Scheme Based on Syndrome Decoding. In D. R. Stinson, editor, Advances in Cryptology \u2014 proceedings of CRYPTO\u2019 93, volume 773 of Lecture Notes in Computer Science, pages 13\u201321. Springer-Verlag, 1994."},{"key":"33_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/3-540-48658-5_18","volume-title":"Advances in Cryptology \u2014 proceedings of CRYPTO\u2019 94","author":"J. Stern","year":"1994","unstructured":"J. Stern. Designing Identification Schemes with Keys of Short Size. In Y. G. Desmedt, editor, Advances in Cryptology \u2014 proceedings of CRYPTO\u2019 94, volume 839 of Lecture Notes in Computer Science, pages 164\u2013173. Springer-Verlag, 1994."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:32:56Z","timestamp":1556739176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_33","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}