{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:37:33Z","timestamp":1725496653694},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545088"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_28","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"378-392","source":"Crossref","is-referenced-by-count":0,"title":["Interactive Proofs with Provable Security against Honest Verifiers"],"prefix":"10.1007","author":[{"given":"J.","family":"Kilian","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"B. Aeillo and J. H\u00e5stad. Perfect zero-knowledge languages can be recognized in two rounds. Proc. FOCS87.","DOI":"10.1109\/SFCS.1987.47"},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-52282-4_30","volume-title":"Proc. of the 7th STACS","author":"D. Beaver","year":"1990","unstructured":"D. Beaver and J. Feigenbaum. Hiding Instances in Multioracle Queries, Proc. of the 7th STACS (1990), Springer Verlag LNCS 415, 37\u201348."},{"key":"28_CR3","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, AT&T Bell Laboratories Technical Memorandum, November 15, 1989."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and P. Rogaway. Everything Provable is Provable in Zero-Knowledge, Proc. of CRYPTO88.","DOI":"10.1007\/0-387-34799-2_4"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"R. Boppana, J. H\u00e5stad, and S. Zachos. Does CoNP Have Short Interactive Proofs? IPL, 25, May 1987, P\u2032. 127\u2013132.","DOI":"10.1016\/0020-0190(87)90232-8"},{"key":"28_CR6","unstructured":"C. Dwork and L. Stockmeyer, Interactive Proof Systems with Finite-State Verifiers, Proc. CRYPTO88."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"L. Fortnow. The Complexity of Perfect Zero-Knowledge. Proc. STOC87.","DOI":"10.1145\/28395.28418"},{"key":"28_CR8","unstructured":"O. Goldreich and L. Levin, Hardcore predicates from all one-way functions. Proc. STOC89"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali. Probabilistic Encryption, J. Comput. System Sci. 28 (1984), 270\u2013299.","journal-title":"J. Comput. System Sci."},{"key":"28_CR10","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. Comput. 18 (1989), 186\u2013208.","journal-title":"SIAM J. Comput."},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"O. Goldreich, Y. Mansour, and M. Sipser. Interactive Proof Systems: Provers that never fail and random selection. Proc. FOCS87.","DOI":"10.1109\/SFCS.1987.35"},{"key":"28_CR12","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 FOCS86.","DOI":"10.1109\/SFCS.1986.47"},{"key":"28_CR13","unstructured":"Johan H\u00e5stad. Manuscript."},{"key":"28_CR14","unstructured":"R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random Generation from One-Way Fynctions, Proc. STOC89"},{"key":"28_CR15","unstructured":"R. Impagliazzo and M. Yung. Direct Minimum-Knowledge Computation, Proc. of CRYPTO87."},{"key":"28_CR16","unstructured":"R. Lipton. New Directions in Testing, manuscript, October, 1989."},{"key":"28_CR17","unstructured":"M. Naor Pseudorandomness and Bit Commitment, Proc. of Crypto89."},{"key":"28_CR18","unstructured":"R. Ostrovsky, Venkatesan and M. Yung. Manuscript (Submitted to STOC91)"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"A. Shamir. IP = PSPACE, manuscript, December 26, 1989.","DOI":"10.1002\/9780470145173.ch16"},{"key":"28_CR20","unstructured":"A. Shamir. CRYPTO Rump Session."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Protocols for Secure Computations, Proc. of FOCS82.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology-CRYPT0\u2019 90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-38424-3_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:09:47Z","timestamp":1708387787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_28","relation":{},"subject":[]}}