{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T20:48:56Z","timestamp":1757450936459,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662490983"},{"type":"electronic","value":"9783662490990"}],"license":[{"start":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T00:00:00Z","timestamp":1450915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49099-0_1","type":"book-chapter","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T18:42:48Z","timestamp":1450896168000},"page":"3-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"given":"Mor","family":"Weiss","sequence":"additional","affiliation":[]},{"given":"Guang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 1992, pp. 14\u201323, Pittsburgh, Pennsylvania, USA, 24\u201327 October 1992","DOI":"10.1109\/SFCS.1992.267823"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. In: Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 1992, pp. 2\u201313, Pittsburgh, Pennsylvania, USA, 24\u201327 October 1992","DOI":"10.1109\/SFCS.1992.267824"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 90\u2013108. Springer, Heidelberg (2013)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-44381-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 276\u2013294. Springer, Heidelberg (2014)"},{"key":"1_CR5","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a Von Neumann architecture. In: Proceedings of the 23rd USENIX Security Symposium, pp. 781\u2013796, San Diego, CA, USA, 20\u201322 August 2014"},{"issue":"6","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Comput."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44987-6_17","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Damg\u00e5rd, I., Dziembowski, S., Ishai, Y., Malkin, T.: On adaptive vs. non-adaptive security of multiparty protocols. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 262\u2013279. Springer, Heidelberg (2001)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Dinur, I.: The PCP theorem by gap amplification. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 241\u2013250, Seattle, WA, USA, 21\u201323 May 2006","DOI":"10.1145\/1132516.1132553"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 711\u2013720, Seattle, WA, USA, 21\u201323 May 2006","DOI":"10.1145\/1132516.1132615"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-28914-9_13","volume-title":"Theory of Cryptography","author":"S Dziembowski","year":"2012","unstructured":"Dziembowski, S., Faust, S.: Leakage-resilient circuits without computational assumptions. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 230\u2013247. Springer, Heidelberg (2012)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-13190-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Faust","year":"2010","unstructured":"Faust, S., Rabin, T., Reyzin, L., Tromer, E., Vaikuntanathan, V.: Protecting circuits from leakage: the computationally-bounded and noisy cases. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 135\u2013156. Springer, Heidelberg (2010)"},{"key":"1_CR12","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: 31st Annual Symposium on Foundations of Computer Science, vol. I, pp. 308\u2013317. St. Louis, Missouri, USA, 22\u201324 October 1990"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography, vol. 1, Basic Techniques. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 291\u2013304, Providence, Rhode Island, USA, 6\u20138 May 1985","DOI":"10.1145\/22145.22178"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Rothblum, G.N.: How to compute in the presence of leakage. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, pp. 31\u201340, New Brunswick, NJ, USA, 20\u201323 October 2012","DOI":"10.1109\/FOCS.2012.34"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Almost optimal lower bounds for small depth circuits. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC 1986, pp. 6\u201320, Berkeley, California, USA, 28\u201330 May 1986","DOI":"10.1145\/12130.12132"},{"key":"1_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. 7194, pp. 151\u2013168. Springer, Heidelberg (2012)"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-54242-8_6","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2014","unstructured":"Ishai, Y., Weiss, M.: Probabilistically checkable proofs of proximity with zero-knowledge. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 121\u2013145. Springer, Heidelberg (2014)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992, pp. 723\u2013732, Victoria, British Columbia, Canada, 4\u20136 May 1992","DOI":"10.1145\/129712.129782"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Tardos, G.: Probabilistically checkable proofs with zero knowledge. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 496\u2013505. El Paso, Texas, USA, 4\u20136 May 1997","DOI":"10.1145\/258533.258643"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-22935-0_54","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"S Lovett","year":"2011","unstructured":"Lovett, S., Srinivasan, S.: Correlation bounds for poly-size $$\\text{ AC }^0$$ AC 0 circuits with n $$^{\\text{1 } - \\text{ o(1) }}$$ 1 - o(1) symmetric gates. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol. 6845, pp. 640\u2013651. Springer, Heidelberg (2011)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Miles, E., Viola, E.: Shielding circuits with groups. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 251\u2013260, Palo Alto, CA, USA, 1\u20134 June 2013","DOI":"10.1145\/2488608.2488640"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M.,Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pp. 427\u2013437, Baltimore, Maryland, USA, 13\u201317 May 1990","DOI":"10.1145\/100216.100273"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-32009-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"GN Rothblum","year":"2012","unstructured":"Rothblum, G.N.: How to compute under $$\\text{ AC }^0$$ AC 0 leakage without secure hardware. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 552\u2013569. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49099-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T22:43:18Z","timestamp":1748731398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49099-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,24]]},"ISBN":["9783662490983","9783662490990"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49099-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015,12,24]]},"assertion":[{"value":"24 December 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}