{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T20:34:39Z","timestamp":1769718879466,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602217","type":"print"},{"value":"9783540447504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-44750-4_26","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:39:53Z","timestamp":1187253593000},"page":"325-338","source":"Crossref","is-referenced-by-count":18,"title":["Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[]},{"given":"Tatsuaki","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai. Trading Group Theory for Randomness, Proc. of 17th STOC, pages 421\u2013420, 1985.","DOI":"10.1145\/22145.22192"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, S. Micali and R. Ostrovsky: The (true) Complexity of Statistical Zero-Knowledge, Proc. of STOC 90.","DOI":"10.1145\/100216.100285"},{"key":"26_CR3","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. H\u00e5stad, J. Killian, S. Micali and P. Rogaway: Everything Provable is Provable in Zero-Knowledge, Proc. of Crypto 88."},{"key":"26_CR4","unstructured":"G. Brassard, D. Chaum and C. Cr\u00e9peau: Minimum Disclosure Proofs of Knowledge, JCSS."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau and M. Yung: Everything in NP can be Argued in Perfect Zero-Knowledge in a Constant Number of Rounds, 16th ICALP, pp. 123\u2013136, 1989.","DOI":"10.1007\/BFb0035756"},{"key":"26_CR6","unstructured":"I. Damg\u00e5rd: Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions, Proc. of Crypto 93."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, O. Goldreich, and A. Wigderson: Hashing Functions can Simplify Zero-Knowledge Protocol Design (too), BRICS Technical Rerport RS-94-39, Nov. 1994.","DOI":"10.7146\/brics.v1i39.21604"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"U. Feige and A. Shamir: Zero-Knowledge Proofs of Knowledge in Two Rounds, Advances in Cryptology \u2014 Crypto89 (proceedings), pp. 526\u2013544, 1990.","DOI":"10.1007\/0-387-34805-0_46"},{"key":"26_CR9","unstructured":"O. Goldreich: Foundation of Cryptography \u2014 Fragments of a Book, February 1995. Available from the Electronic Colloquium on Computational Complexity (ECCC), http:\/\/www.eccc.uni-trier.de\/eccc\/ ."},{"key":"26_CR10","unstructured":"O. Goldreich, S. Goldwasser and N. Linial: Fault-Tolerant Computation without Assumptions: the Two-Party Case, 32nd FOCS, pp. 447\u2013457, 1991."},{"key":"26_CR11","unstructured":"O. Goldreich and A. Kahan: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP, to appear in Journal of Cryptology"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"O. Goldreich and H. Krawcyzk: On the Composition of Zero-Knowledge Proof Systems, 17th ICALP, pp. 268\u2013282, 1990.","DOI":"10.1007\/BFb0032038"},{"key":"26_CR13","unstructured":"O. Goldreich, Y. Mansour and M. Sipser: Proofs that Never Fail and Random Selection, Proc. of FOCS 87."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson: Proofs that yield Nothing but their Validity and a Methodology of Cryptographic Protocol Design, Proc. of FOCS 86.","DOI":"10.1109\/SFCS.1986.47"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"O. Goldreich and Y. Oren: Definitions and Properties of Zero-Knowledge Proof Systems. Jour. of Crypto., Vol. 7, pp. 1\u201332, 1994.","journal-title":"Jour. of Crypto."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali and C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM J. Computing, Vol. 18, pp. 186\u2013208, 1989.","journal-title":"SIAM J. Computing"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"S. Goldwasser and M. Sipser. Private Coins versus Public Coins in Interactive Proof Systems, Proc. of 18th STOC, pages 59\u201368, 1986.","DOI":"10.1145\/12130.12137"},{"key":"26_CR18","unstructured":"J. Hastad, R. Impagliazzo, L.A. Levin and M. Luby: Construction of Pseudorandom Generator from any One-Way Function, manuscript, 1993. See preliminary versions by Impagliazzo et al. in 21st STOC and Hastad in 22nd STOC."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Yung, Direct Minimum-Knowledge Computations, Advances in Cryptology \u2014 Crypto87 (proceedings), 1987, pp. 40\u201351.","DOI":"10.1007\/3-540-48184-2_4"},{"key":"26_CR20","unstructured":"M. Naor: Bit Commitments from Pseudorandomness, Proc. of Crypto 89."},{"key":"26_CR21","unstructured":"M. Naor, R. Ostrovsky, R. Venkatesan and M. Yung: Zero-Knowledge Arguments for NP can be Based on General Complexity Assumptions, Proc. of Crypto 92."},{"key":"26_CR22","unstructured":"R. Ostrovsky, R. Venkatesan and M. Yung: Fair Games Against an All-Powerful Adversary, presented at DIMACS Complexity and Cryptography Workshop, October 1990, Princeton."},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, R. Venkatesan and M. Yung: Interactive Hashing Simplifies Zero-Knowledge Protocol Design, Proc. of EuroCrypt 93.","DOI":"10.1007\/3-540-48285-7_23"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and A. Wigderson: One-Way Functions are Essential for Non-Trivial Zero-Knowledge, Proc. 2nd Israel Symp. on Theory of Computing and Systems, 1993.","DOI":"10.1109\/ISTCS.1993.253489"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPT0\u2019 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44750-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T22:38:07Z","timestamp":1587854287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44750-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602217","9783540447504"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44750-4_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1995]]}}}