{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:23:11Z","timestamp":1725495791807},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633846"},{"type":"electronic","value":"9783540695288"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","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":[[1997]]},"DOI":"10.1007\/bfb0052226","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T14:37:31Z","timestamp":1155825451000},"page":"31-45","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Keeping the SZK-verifier honest unconditionally"],"prefix":"10.1007","author":[{"given":"Giovanni","family":"Di Crescenzo","sequence":"first","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-0000(91)90006-Q","volume":"42","author":"W. Aiello","year":"1991","unstructured":"W. Aiello and J. H\u00e5stad. Statistical Zero Knowledge Can Be Recognized in Two Rounds, Journal of Computer and System Sciences, vol. 42, 1991, pp. 327\u2013345.","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR2","unstructured":"M. Bellare, S. Micali, and R. Ostrovsky, The (True) Complexity of Statistical Zero-Knowledge Proofs, in STOC 90."},{"key":"3_CR3","unstructured":"M. Bellare, and E. Petrank, Making Zero-Knowledge Provers Efficient, STOC 92."},{"key":"3_CR4","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. H\u00e5stad, J. Kilian, S. Micali, and P. Rogaway, Everything Provable is Provable in Zero Knowledge, in CRYPTO 88."},{"key":"3_CR5","unstructured":"I. Damg\u00e5rd, Interactive Hashing can Simplify Zero-Knowledge Design without Complexity assumptions, in CRYPTO 92."},{"key":"3_CR6","unstructured":"I. Damg\u00e5rd, O. Goldreich, T. Okamoto, and A. Wigderson, Honest-Verifier vs. Dishonest-Verifier in Public-Coin Zero-Knowledge Proofs, in CRYPTO 95."},{"key":"3_CR7","unstructured":"A. De Santis, G. Di Crescenzo, P. Persiano, and M. Yung, On Monotone Formula Closure of SZK, in FOCS 94."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat, and A. Shamir, Zero-Knowledge Proofs of Identity, Journal of Cryptology, vol. 1, 1988, pp. 77\u201394.","journal-title":"Journal of Cryptology"},{"key":"3_CR9","unstructured":"L. Fortnow, The Complexity of Perfect Zero Knowledge, in STOC 87."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"O. Goldreich and H. Krawczyk, On the Composition of Zero-Knowledge Proof Systems, SIAM Journal on Computing, 1996.","DOI":"10.1137\/S0097539791220688"},{"issue":"n.1","key":"3_CR11","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, Proofs that Yield Nothing but their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, vol. 38, n. 1, 1991, pp. 691\u2013729.","journal-title":"Journal of the ACM"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich and Y. Oren, Definitions and Properties of Zero-Knowledge Proof Systems, Journal of Cryptology, v. 7, n. 1, 1994.","DOI":"10.1007\/BF00195207"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, SIAM Journal on Computing, vol. 18, n. 1, February 1989.","DOI":"10.1137\/0218012"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and M. Sipser, Private Coins versus Public Coins in Interactive Proof-Systems, in STOC 1986.","DOI":"10.1145\/12130.12137"},{"key":"3_CR15","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a Pseudo-Random Generator from One-Way Function, to appear in SIAM Journal on Computing, previous versions: FOCS 89 and STOC 90."},{"key":"3_CR16","unstructured":"R. Impagliazzo and M. Luby, One-Way Functions are Necessary for Complexity-Based Cryptography, in FOCS 90."},{"key":"3_CR17","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum Knowledge Computations, in CRYPTO 87."},{"key":"3_CR18","unstructured":"M. Naor, Bit-Commitment Using Pseudo-Randomness, in CRYPTO 89."},{"key":"3_CR19","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung, Perfectly-Secure Zero-Knowledge Arguments Can be Based on General Complexity Assumptions, in CRYPTO 92."},{"key":"3_CR20","unstructured":"T. Okamoto, On Relations Between Statistical Zero-Knowledge Proofs, STOC 96."},{"key":"3_CR21","unstructured":"R. Ostrovsky, One-Way Functions, Hard on Average Problems and Statistical Zero-Knowledge Proofs, in Structures 91."},{"key":"3_CR22","unstructured":"R. Ostrovsky, R. Venkatesan, and M. Yung, Interactive Hashing Simplifies Zero-Knowledge Protocol Design, in EUROCRYPT '93."},{"key":"3_CR23","unstructured":"R. Ostrovsky, and A. Wigderson, One-way Functions are Essential for Non-Trivial Zero-Knowledge, in ISTCS 93."},{"key":"3_CR24","unstructured":"A. Yao, Theory and Applications of Trapdoor Functions, in FOCS 81."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:11:19Z","timestamp":1580335879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0052226","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}