{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:40:14Z","timestamp":1773736814491,"version":"3.50.1"},"publisher-location":"New York, NY","reference-count":23,"publisher":"Springer New York","isbn-type":[{"value":"9780387973173","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_46","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"526-544","source":"Crossref","is-referenced-by-count":136,"title":["Zero Knowledge Proofs of Knowledge in Two Rounds"],"prefix":"10.1007","author":[{"given":"U.","family":"Feige","sequence":"first","affiliation":[]},{"given":"A.","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"M. Abadi, E. Allender, A. Broder, J. Feigenbaum, L. Hemachandra, On Generating Solved Instances of Computational Problems Proc. of CRYPTO88."},{"key":"46_CR2","unstructured":"D. Angluin, D. Lichtenstein, Provable Security of Cryptosystems: a Survey TR-288, Yale University, 1983."},{"key":"46_CR3","unstructured":"M. Blum, How to Prove a Theorem So No One Else Can Claim It Proc. of the International Congress of Mathematicians, Berkeley, California, USA, 1986, pp. 1444\u20131451."},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, S. Micali, Non-Interactive Zero-Knowledge and its Applications Proc. of 20th STOC 1988, pp. 103\u2013112.","DOI":"10.1145\/62212.62222"},{"key":"46_CR5","first-page":"156","volume":"37","author":"G. Brassard","year":"1988","unstructured":"G. Brassard, D. Chaum, C. Cr\u00e9peau, Minimum Disclosure Proofs of Knowledge JCSS, Vol. 37, 1988, pp. 156\u2013189.","journal-title":"JCSS"},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, M. Yung, Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds Proc. of 16th ICALP, Stresa, Italy, 1989.","DOI":"10.1007\/BFb0035756"},{"key":"46_CR7","unstructured":"M. Bellare, S. Goldwasser, New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs these proceedings."},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"S. Cook, The Complexity of Theorem Proving Procedures Proc. of 3rd STOC 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"46_CR9","unstructured":"I. Damg\u00e5rd, On the Existence of Bit Commitment Schemes and Zero Knowledge Proofs these proceedings."},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"A. De Santis, S. Micali, G. Persiano, Non-Interactive Zero-Knowledge Proof Systems Proc of CRYPTO-87, pp. 52\u201372.","DOI":"10.1007\/3-540-48184-2_5"},{"key":"46_CR11","unstructured":"U. Feige, A. Shamir, Witness Hiding Protocols and Their Applications In preparation."},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, A. Shamir, Zero Knowledge Proofs of Identity Journal of Cryptology, Vol 1, 1988, pp. 77\u201394. (Preliminary version in Proc. of 19th STOC 1987, pp. 210\u2013217.)","journal-title":"Journal of Cryptology"},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"L. Fortnow, The Complexity of Perfect Zero-Knowledge Proc. of 19th STOC, 1987, pp. 204\u2013209.","DOI":"10.1145\/28395.28418"},{"key":"46_CR14","unstructured":"O. Goldreich, private communication."},{"key":"46_CR15","unstructured":"O. Goldreich, H. Krawczyk, On the Composition of Zero-Knowledge Proof Systems manuscript, May 1989."},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, L. Levin, A Hard-Core Predicate for all Oneway Functions Proc. 21st STOC 1989, pp. 25\u201332.","DOI":"10.1145\/73007.73010"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, Proofs that Yield Nothing But Their Validity and a Methodology of Cryptographic Protocol Design Proc. 27th FOCS, 1986, pp. 174\u2013187.","DOI":"10.1109\/SFCS.1986.47"},{"issue":"1","key":"46_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The Knowledge Complexity of Interactive Proof Systems SIAM J. Comput. Vol. 18, No. 1, pp. 186\u2013208, February 1989.","journal-title":"SIAM J. Comput."},{"key":"46_CR19","unstructured":"E. Horowitz, S. Sahni, Fundamentals of Computer Algorithms Computer Science Press, Computer Software Engineering Series, (pp. 526\u2013529)."},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. Levin, M. Luby, Pseudo-Random Generation From Oneway Functions Proc. 21st STOC, 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"46_CR21","unstructured":"M. Naor, Bit Commitment using Pseudo-Randomness these proceedings."},{"key":"46_CR22","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0204018","volume":"4","author":"V. Pratt","year":"1975","unstructured":"V. Pratt, Every Prime Has a Succinct Certificate SIAM J. Computing 4 (1975), pp. 214\u2013220.","journal-title":"SIAM J. Computing"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"M. Tompa, H. Woll, Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information Proc. 28th FOGS, 1987, pp. 472\u2013482.","DOI":"10.1109\/SFCS.1987.49"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:23Z","timestamp":1619501303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_46","relation":{},"subject":[]}}