{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:24:33Z","timestamp":1748384673947,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642146220"},{"type":"electronic","value":"9783642146237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_10","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"173-190","source":"Crossref","is-referenced-by-count":32,"title":["Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography"],"prefix":"10.1007","author":[{"given":"Vipul","family":"Goyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Mahmoody","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC (1988)","DOI":"10.1145\/62212.62215"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: FOCS, pp. 42\u201352 (1988)","DOI":"10.1109\/SFCS.1988.21920"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U.M. Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptology\u00a05(1), 53\u201366 (1992)","journal-title":"J. Cryptology"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., Wigderson, A.: Multi-prover interactive proofs: How to remove intractability assumptions. In: STOC, pp. 113\u2013131 (1988)","DOI":"10.1145\/62212.62223"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-78967-3_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"T. Moran","year":"2008","unstructured":"Moran, T., Segev, G.: David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 527\u2013544. Springer, Heidelberg (2008)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-642-11799-2_19","volume-title":"TCC 2010","author":"V. Goyal","year":"2010","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 308\u2013326. Springer, Heidelberg (2010)"},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989); Preliminary version in STOC 1985 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10_CR12","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038(1), 691\u2013729 (1991); Preliminary version in FOCS 1986 (1986)","journal-title":"Journal of the ACM"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.2190\/4U1D-VQRM-J70D-JEQF","volume":"5","author":"L. Fortnow","year":"1989","unstructured":"Fortnow, L.: The complexity of perfect zero-knowledge. Advances in Computing Research: Randomness and Computation\u00a05, 327\u2013343 (1989)","journal-title":"Advances in Computing Research: Randomness and Computation"},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0022-0000(91)90006-Q","volume":"42","author":"W. Aiello","year":"1991","unstructured":"Aiello, W., H\u00e5stad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. Syst. Sci.\u00a042(3), 327\u2013345 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR15","unstructured":"Ostrovsky, R., Wigderson, A.: One-way fuctions are essential for non-trivial zero-knowledge. In: ISTCS, pp. 3\u201317 (1993)"},{"issue":"2","key":"10_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/BF01200756","volume":"15","author":"D. Lapidot","year":"1995","unstructured":"Lapidot, D., Shamir, A.: A one-round, two-prover, zero-knowledge protocol for np. Combinatorica\u00a015(2), 204\u2013214 (1995)","journal-title":"Combinatorica"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. In: FOCS, pp. 16\u201325 (1990)","DOI":"10.1109\/FSCS.1990.89520"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-48071-4_15","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Feige, U., Kilian, J., Naor, M., Safra, S.: Low communication 2-prover zero-knowledge proofs for np. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 215\u2013227. Springer, Heidelberg (1993)"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of np. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Fortnow, L., Rompel, J., Sipser, M.: On the power of multi-prover interactive protocols. In: Theoretical Computer Science, pp. 156\u2013161 (1988)","DOI":"10.1109\/SCT.1988.5275"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC, pp. 235\u2013244 (2000)","DOI":"10.1145\/335305.335334"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Tardos, G.: Probabilistically checkable proofs with zero knowledge. In: STOC: ACM Symposium on Theory of Computing, STOC (1997)","DOI":"10.1145\/258533.258643"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-540-70583-3_44","volume-title":"Automata, Languages and Programming","author":"Y.T. Kalai","year":"2008","unstructured":"Kalai, Y.T., Raz, R.: Interactive PCP. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 536\u2013547. Springer, Heidelberg (2008)"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: STOC, pp. 113\u2013122 (2008)","DOI":"10.1145\/1374376.1374396"},{"issue":"2","key":"10_CR26","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M. Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. Journal of Cryptology\u00a011(2), 87\u2013108 (1998); Preliminary version in CRYPTO 1992 (1992)","journal-title":"Journal of Cryptology"},{"key":"#cr-split#-10_CR27.1","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Venkatesan, R., Yung, M.: Fair games against an all-powerful adversary. In: AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 155\u2013169 (1993);","DOI":"10.1090\/dimacs\/013\/09"},{"key":"#cr-split#-10_CR27.2","unstructured":"Preliminary version in SEQUENCES 1991 (1991)"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-24638-1_25","volume-title":"Theory of Cryptography","author":"Y.Z. Ding","year":"2004","unstructured":"Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R.: Constant-round oblivious transfer in the bounded storage model. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 446\u2013472. Springer, Heidelberg (2004)"},{"key":"#cr-split#-10_CR29.1","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O.: A new interactive hashing theorem. In: IEEE Conference on Computational Complexity, pp. 319\u2013332 (2007);","DOI":"10.1109\/CCC.2007.3"},{"key":"#cr-split#-10_CR29.2","unstructured":"See also preliminary draft of full version at the first author\u2019s home page"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-540-72540-4_7","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Katz","year":"2007","unstructured":"Katz, J.: Universally composable multi-party computation using tamper-proof hardware. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 115\u2013128. Springer, Heidelberg (2007)"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"3","key":"10_CR32","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-540-85174-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S. Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.: One-time programs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 39\u201356. Springer, Heidelberg (2008)"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Constructions of truly practical secure protocols using standardsmartcards. In: ACM Conference on Computer and Communications Security, pp. 491\u2013500 (2008)","DOI":"10.1145\/1455770.1455832"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-78967-3_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Chandran","year":"2008","unstructured":"Chandran, N., Goyal, V., Sahai, A.: New constructions for UC secure computation using tamper-proof hardware. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 545\u2013562. Springer, Heidelberg (2008)"},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-642-11799-2_20","volume-title":"TCC 2010","author":"V. Kolesnikov","year":"2010","unstructured":"Kolesnikov, V.: Truly efficient string oblivious transfer using resettable tamper-proof tokens. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 327\u2013342. Springer, Heidelberg (2010)"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"10_CR38","doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P., Wee, H.: Inaccessible entropy. In: STOC, pp. 611\u2013620 (2009)","DOI":"10.1145\/1536414.1536497"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Lindell, Y., Rabin, T.: Information-theoretically secure protocols and security under composition. In: STOC: ACM Symposium on Theory of Computing, STOC (2006)","DOI":"10.1145\/1132516.1132532"},{"key":"10_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, J., Micali, S., Rogaway, P.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 37\u201356. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T01:24:51Z","timestamp":1740360291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}