{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:40:34Z","timestamp":1774600834709,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540545088","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-38424-3_24","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T13:05:56Z","timestamp":1196687156000},"page":"326-338","source":"Crossref","is-referenced-by-count":8,"title":["Hiding Instances in Zero-Knowledge Proof Systems"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]},{"given":"Joan","family":"Feigenbaum","sequence":"additional","affiliation":[]},{"given":"Victor","family":"Shoup","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, J. Feigenbaum, and J. Kilian. On Hiding Information from an Oracle, J. Comput. System Sci. 39 (1989), 21\u201350.","journal-title":"J. Comput. System Sci."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"L. Babai, L. Fortnow, and C. Lund. Nondeterministic Exponential Time has Two-Prover Interactive Protocols, Proc. of the 31st FOCS (1990), IEEE.","DOI":"10.1109\/FSCS.1990.89520"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D. Barrington","year":"1989","unstructured":"D. Barrington. Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC 1, J. Comput. System Sci. 38 (1989), 150\u2013164.","journal-title":"J. Comput. System Sci."},{"key":"24_CR4","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":"24_CR5","unstructured":"D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with Low Communication Overhead, these proceedings."},{"key":"24_CR6","unstructured":"D. Beaver, J. Feigenbaum, and V. Shoup. Hiding Instances in Zero-Knowledge Proof Systems, AT&T Bell Laboratories Technical Memorandum, April 12, 1990."},{"key":"24_CR7","unstructured":"M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multiprover Interactive Proof Systems: How to Remove Intractability Assumptions, Proc. of the 20th STOC (1988), ACM, 113\u2013131."},{"key":"24_CR8","series-title":"Lect Notes Comput Sci","first-page":"37","volume-title":"Proc. of the 8th CRYPTO","author":"M. Ben-Or","year":"1988","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, Proc. of the 8th CRYPTO (1988), Springer Verlag LNCS 403, 37\u201356."},{"key":"24_CR9","unstructured":"M. Blum, M. Luby, and R. Rubinfeld. Program Result Checking Against Adaptive Programs and in Cryptographic Settings, Proc. of the DIMACS Workshop on Distributed Computing and Cryptography (1989), AMS."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"L. Fortnow, J. Rompel, and M. Sipser. On the Power of Multiprover Interactive Protocols, Proc. of the 3rd Structure in Complexity Theory Conference (1988), IEEE, 156\u2013161.","DOI":"10.1109\/SCT.1988.5275"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1137\/0218049","volume":"18","author":"Z. Galil","year":"1989","unstructured":"Z. Galil, S. Haber, and M. Yung. Minimum-Knowledge Interactive Proofs for Decision Problems, SIAM J. Comput. 18 (1989), 711\u2013739.","journal-title":"SIAM J. Comput."},{"key":"24_CR12","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":"24_CR13","doi-asserted-by":"crossref","unstructured":"J. Kilian. Founding Cryptography on Oblivious Transfer, Proc. of 20th STOC (1988), ACM, 20\u201331.","DOI":"10.1145\/62212.62215"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"C. Lund, L. Fortnow, H. Karloff, and N. Nisan. Algebraic Methods for Interactive Proof Systems, Proc. of the 31st FOCS (1990), IEEE.","DOI":"10.1109\/FSCS.1990.89518"},{"key":"24_CR15","unstructured":"R. Rivest. Workshop on Communication and Computing, MIT, October, 1986."},{"key":"24_CR16","unstructured":"A. Shamir. IP = PSPACE, Proc. of the 31st FOCS (1990), IEEE."}],"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_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:20:10Z","timestamp":1619572810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-38424-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540545088"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-38424-3_24","relation":{},"subject":[]}}