{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:58:15Z","timestamp":1772276295639,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642542411","type":"print"},{"value":"9783642542428","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_6","type":"book-chapter","created":{"date-parts":[[2014,2,3]],"date-time":"2014-02-03T02:42:54Z","timestamp":1391395374000},"page":"121-145","source":"Crossref","is-referenced-by-count":24,"title":["Probabilistically Checkable Proofs of Proximity with Zero-Knowledge"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mor","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Electronic Colloquium on Computational Complexity (ECCC)\u00a05(8) (1998)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, M.: Probabilistic checking of proofs: A new characterization of NP. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"issue":"5","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"B. Barak","year":"2008","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. SIAM J. Comput.\u00a038(5), 1661\u20131694 (2008)","journal-title":"SIAM J. Comput."},{"key":"6_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":"6_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Rabin, T.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC), Seattle, Washigton, USA, May 14-17, pp. 73\u201385. ACM (1989)","DOI":"10.1145\/73007.73014"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1137\/S0097539705446810","volume":"36","author":"E. Ben-Sasson","year":"2006","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM J. Comput.\u00a036(4), 889\u2013974 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1137\/050646445","volume":"38","author":"E. Ben-Sasson","year":"2008","unstructured":"Ben-Sasson, E., Sudan, M.: Short PCPs with polylog query complexity. SIAM J. Comput.\u00a038(2), 551\u2013607 (2008)","journal-title":"SIAM J. Comput."},{"key":"6_CR9","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":"6_CR10","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Dinur, I.: The PCP theorem by gap amplification. In: STOC, pp. 241\u2013250 (2006)","DOI":"10.1145\/1132516.1132553"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Dinur, I., Reingold, O.: Assignment testers: Towards a combinatorial proof of the PCP-theorem. In: FOCS, pp. 155\u2013164 (2004)","DOI":"10.1109\/FOCS.2004.16"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Feige, U., Kilian, J., Naor, M., Safra, M.: Low communication 2-prover zero-knowledge proofs for NP. In: Brickell, E.F. (ed.) Advances in Cryptology - CRYPTO 1992. LNCS, vol.\u00a0740, pp. 215\u2013227. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-48071-4_15"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS, pp. 427\u2013437. IEEE Computer Society (1987)","DOI":"10.1109\/SFCS.1987.4"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","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 J. Comput.\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-28914-9_9","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2012","unstructured":"Ishai, Y., Mahmoody, M., Sahai, A.: On efficient zero-knowledge PCPs. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 151\u2013168. Springer, Heidelberg (2012)"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Sahai, A., Viderman, M., Weiss, M.: Zero knowledge LTCs and their applications. In: APPROX-RANDOM, pp. 607\u2013622 (2013)","DOI":"10.1007\/978-3-642-40328-6_42"},{"key":"6_CR19","unstructured":"Kilian, J.: Uses of randomness in algorithms and protocols. MIT Press (1990)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J., Naor, M.: On the complexity of statistical reasoning. In: Proceedings of the Third Israel Symposium on the Theory of Computing and Systems, pp. 209\u2013217. IEEE (1995)","DOI":"10.1109\/ISTCS.1995.377030"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Tardos, G.: Probabilistically checkable proofs with zero knowledge. In: STOC, pp. 496\u2013505 (1997)","DOI":"10.1145\/258533.258643"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1137\/080729967","volume":"39","author":"O. Meir","year":"2009","unstructured":"Meir, O.: Combinatorial construction of locally testable codes. SIAM J. Comput.\u00a039(2), 491\u2013544 (2009)","journal-title":"SIAM J. Comput."},{"issue":"3-4","key":"6_CR23","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10472-009-9169-y","volume":"56","author":"T. Mie","year":"2009","unstructured":"Mie, T.: Short PCPPs verifiable in polylogarithmic time with O(1) queries. Ann. Math. Artif. Intell.\u00a056(3-4), 313\u2013338 (2009)","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T19:09:05Z","timestamp":1746126545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}