{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:17:45Z","timestamp":1725488265309},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540576006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48285-7_23","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:16:46Z","timestamp":1185934606000},"page":"267-273","source":"Crossref","is-referenced-by-count":9,"title":["Interactive Hashing Simplifies Zero-Knowledge Protocol Design"],"prefix":"10.1007","author":[{"given":"Rafail","family":"Ostrovsky","sequence":"first","affiliation":[]},{"given":"Ramarathnam","family":"Venkatesan","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, and S. Micali \u201cHow to Generate Cryptographically Strong Sequences Of Pseudo-Random Bits\u201d SIAM J. on Computing, Vol 13, 1984, pp. 850\u2013864.","journal-title":"SIAM J. on Computing"},{"key":"23_CR2","unstructured":"Bellare, M., S. Micali and R. Ostrovsky, \u201cThe (True) Complexity of Statistical Zero Knowledge\u201d STOC 90."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau, Minimum Disclosure Proofs of Knowledge, JCSS, v. 37, pp 156\u2013189.","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"23_CR4","unstructured":"Brassard, G., C. Cr\u00e9peau, and M. Yung, \u201cEverything in NP can be Argued in Perfect Zero Knowledge in a Bounded Number of Rounds,\u201d ICALP 89. (also in Theoretical Computer Science, special issue of ICALP 89)."},{"key":"23_CR5","unstructured":"I. B. Damgaard, Collision Free Hash Functions and Public Key Signature Schemes, Eurocrypt, 1987."},{"key":"23_CR6","unstructured":"Goldreich, O. and A. Kahn, personal communication."},{"key":"23_CR7","unstructured":"O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness, FOCS 90."},{"key":"23_CR8","unstructured":"Goldreich, O., Y. Mansour, and M. Sipser, \u201cInteractive Proof Systems: Provers that never Fail and Random Selection,\u201d FOCS 87."},{"key":"23_CR9","unstructured":"Goldreich, O., S. Micali, and A. Wigderson, \u201cProofs that Yield Nothing but their Validity\u201d, FOCS 86."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., S. Micali, and C. Rackoff, \u201cThe Knowledge Complexity of Interactive Proofs,\u201d SIAM J. Comput., 18(1), 186\u2013208 (February 1989).","journal-title":"SIAM J. Comput."},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., S. Micali, and R. Rivest, \u201cA Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks,\u201d SIAM J. Comput, 17(2), 281\u2013308 (April 1988).","journal-title":"SIAM J. Comput"},{"key":"23_CR12","unstructured":"J. Hastad, \u201cPseudo-Random Generators under Uniform Assumptions\u201d STOC 90"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"I. Impagliazzo, L. Levin and M. Luby, Pseudo-random generation from one-way functions, Proc. 21st Symposium on Theory of Computing, 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"23_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology-Crypto\u2019 92","author":"M. Naor","year":"1992","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. \u201cPerfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions\u201d, Advances in Cryptology-Crypto\u2019 92, Lecture Notes in Computer Science, Springer, to appear."},{"key":"23_CR15","unstructured":"Naor, M. and M. Yung, \u201cUniversal One-Way Hash Functions and their Cryptographic Applications,\u201d STOC 89."},{"key":"23_CR16","unstructured":"Oren Y., \u201cOn The Cunning Power of Cheating Verifiers: Some Observations About Zero Knowledge Proofs\u201d, FOCS 87."},{"key":"23_CR17","unstructured":"R. Ostrovsky, R. Venkatesan, and M. Yung. \u201cFair Games Against an All-Powerful Adversary\u201d, SEQUENCES\u2019 91, Positano, June, 1991 (Proc. Springer Verlag), (also presented at Princeton Oct. 1990 Workshop on Complexity and Cryptography)."},{"key":"23_CR18","series-title":"Lect Notes Comput Sci","first-page":"439","volume-title":"Secure Commitment Against A Powerful Adversary, STACS 92","author":"R. Ostrovsky","year":"1992","unstructured":"R. Ostrovsky, R. Venkatesan, M. Yung, Secure Commitment Against A Powerful Adversary, STACS 92, Springer Verlag LNCS Vol. 577, p. 439\u2013448, 1992."},{"key":"23_CR19","unstructured":"R. Ostrovsky, A. Wigderson One-Way Functions are Essential for Non-Trivial Zero-Knowledge, The second Israel Symposium on Theory of Computing and Systems (ISTCS93) 1993."},{"key":"23_CR20","unstructured":"J. Rompel \u201cOne-way Functions are Necessary and Sufficient for Secure Signatures\u201d STOC 90."},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Theory and Applications of Trapdoor functions, Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201993"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48285-7_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:27Z","timestamp":1619571027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48285-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540576006"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48285-7_23","relation":{},"subject":[]}}