{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:46:22Z","timestamp":1757627182680,"version":"3.44.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019066"},{"type":"electronic","value":"9783032019073"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-032-01907-3_15","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:44Z","timestamp":1755383264000},"page":"462-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["NIZK Amplification via\u00a0Leakage-Resilient Secure Computation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4792-369X","authenticated-orcid":false,"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5913-1636","authenticated-orcid":false,"given":"Eliran","family":"Kachlon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"15_CR1","unstructured":"Applebaum, B., Kachlon, E.: How to share an NP statement or combiners for zero-knowledge proofs. Cryptology ePrint Archive, Paper 2025\/334 (2025), https:\/\/eprint.iacr.org\/2025\/334, to appear in Crypto\u201925"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E.: NIZK amplification via leakage-resilient secure computation. Cryptology ePrint Archive, Paper 2025\/995 (2025), https:\/\/eprint.iacr.org\/2025\/995","DOI":"10.1007\/978-3-032-01907-3_15"},{"key":"15_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2\u20134 May 1988, Chicago, Illinois, USA, pp. 1\u201310. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09375-2","volume":"34","author":"F Benhamouda","year":"2021","unstructured":"Benhamouda, F., Degwekar, A., Ishai, Y., Rabin, T.: On the local leakage resilience of linear secret sharing schemes. J. Cryptol. 34, 1\u201365 (2021)","journal-title":"J. Cryptol."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Dachman-Soled, D., Lin, H.: Leakage-tolerant computation with input-independent preprocessing. In: Advances in Cryptology\u2013CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, 17\u201321 August 2014, Proceedings, Part II 34, pp. 146\u2013163. Springer (2014)","DOI":"10.1007\/978-3-662-44381-1_9"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Geier, N.: Amplification of non-interactive zero knowledge, revisited. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part IX, LNCS, vol. 14928, pp. 361\u2013390. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_11","DOI":"10.1007\/978-3-031-68400-5_11"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R.D., Vasudevan, P.N.: Batch proofs are statistically hiding. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pp. 435\u2013443 (2024)","DOI":"10.1145\/3618260.3649775"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Goldwasser, S., Jain, A., Kalai, Y.T.: Multiparty computation secure against continual memory leakage. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, pp. 1235\u20131254 (2012)","DOI":"10.1145\/2213977.2214087"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s00446-013-0206-z","volume":"27","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Kalai, Y.T.: Leakage-resilient coin tossing. Distrib. Comput. 27, 147\u2013164 (2014)","journal-title":"Distrib. Comput."},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2\u20134 May 1988, Chicago, Illinois, USA, pp. 11\u201319. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Cohen, G., Damg\u00e5rd, I.B., Ishai, Y., K\u00f6lker, J., Miltersen, P.B., Raz, R., Rothblum, R.D.: Efficient multiparty protocols via log-depth threshold formulae - (extended abstract). In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II, LNCS, vol.\u00a08043, pp. 185\u2013202. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_11","DOI":"10.1007\/978-3-642-40084-1_11"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Kilian, J., Salvail, L.: On the (im) possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Advances in Cryptology\u2014EUROCRYPT\u201999: International Conference on the Theory and Application of Cryptographic Techniques Prague, Czech Republic, 2\u20136 May 1999 Proceedings 18, pp. 56\u201373. Springer (1999)","DOI":"10.1007\/3-540-48910-X_5"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Advances in Cryptology-EUROCRYPT 2004: International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2\u20136 May 2004, Proceedings 23, pp. 342\u2013360. Springer (2004)","DOI":"10.1007\/978-3-540-24676-3_21"},{"key":"15_CR14","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp. 308\u2013317. IEEE (1990)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Conference on the Theory and Application of Cryptology, pp. 526\u2013544. Springer (1989)","DOI":"10.1007\/0-387-34805-0_46"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/S00145-004-0150-Y","volume":"18","author":"M Fitzi","year":"2005","unstructured":"Fitzi, M., Garay, J.A., Maurer, U.M., Ostrovsky, R.: Minimal complete primitives for secure multi-party computation. J. Cryptol. 18(1), 37\u201361 (2005). https:\/\/doi.org\/10.1007\/S00145-004-0150-Y","journal-title":"J. Cryptol."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - vol. 1, Basic Techniques. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511546891"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On yao\u2019s xor-lemma. Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation: In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, pp. 273\u2013301 (2011)","DOI":"10.1007\/978-3-642-22670-0_23"},{"key":"15_CR20","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Petrank, E.: Quantifying knowledge complexity. Comput. Complex. 8(1), 50\u201398 (1999). https:\/\/doi.org\/10.1007\/S000370050019","DOI":"10.1007\/S000370050019"},{"issue":"5","key":"15_CR21","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1137\/130931461","volume":"44","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Rothblum, G.N.: How to compute in the presence of leakage. SIAM J. Comput. 44(5), 1480\u20131549 (2015)","journal-title":"SIAM J. Comput."},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ishai, Y., Maji, H.K., Sahai, A., Sherstov, A.A.: Bounded-communication leakage resilience via parity-resilient circuits. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1\u201310. IEEE (2016)","DOI":"10.1109\/FOCS.2016.10"},{"key":"15_CR23","doi-asserted-by":"publisher","unstructured":"Goyal, V., Jain, A., Sahai, A.: Simultaneous amplification: The case of non-interactive zero-knowledge. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2019, Proceedings, Part II, LNCS, vol. 11693, pp. 608\u2013637. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_21, crypto talk avaialable in https:\/\/www.youtube.com\/watch?v=DLK079q6aWM&ab_channel=IACR","DOI":"10.1007\/978-3-030-26951-7_21"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Halevi, S., Rabin, T.: Degradation and amplification of computational hardness. In: Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, 19\u201321 March 2008. Proceedings 5, pp. 626\u2013643. Springer (2008)","DOI":"10.1007\/978-3-540-78524-8_34"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Hirt, M., Maurer, U.M.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000). https:\/\/doi.org\/10.1007\/S001459910003","DOI":"10.1007\/S001459910003"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Key agreement from weak bit agreement. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 664\u2013673 (2005)","DOI":"10.1145\/1060590.1060689"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 538\u2013545. IEEE Computer Society (1995). https:\/\/doi.org\/10.1109\/SFCS.1995.492584","DOI":"10.1109\/SFCS.1995.492584"},{"issue":"1","key":"15_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-008-9029-7","volume":"22","author":"R Impagliazzo","year":"2009","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. J. Cryptol. 22(1), 75\u201392 (2009)","journal-title":"J. Cryptol."},{"key":"15_CR29","unstructured":"Jain, A.: Aayush jain\u2019s website (2024), https:\/\/sites.google.com\/view\/aayushjain\/home"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Lanzenberger, D., Maurer, U.: Coupling of random systems. In: Theory of Cryptography Conference, pp. 207\u2013240. Springer (2020)","DOI":"10.1007\/978-3-030-64381-2_8"},{"key":"15_CR31","doi-asserted-by":"crossref","unstructured":"Lin, H., Tessaro, S.: Amplification of chosen-ciphertext security. In: Advances in Cryptology\u2013EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, 26\u201330 May 2013, Proceedings 32, pp. 503\u2013519. Springer (2013)","DOI":"10.1007\/978-3-642-38348-9_30"},{"key":"15_CR32","doi-asserted-by":"publisher","unstructured":"Maurer, U.M., Tessaro, S.: A hardcore lemma for computational indistinguishability: Security amplification for arbitrarily weak prgs with optimal stretch. In: Micciancio, D. (ed.) Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, 9\u201311 February 2010. Proceedings, LNCS, vol.\u00a05978, pp. 237\u2013254. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_15","DOI":"10.1007\/978-3-642-11799-2_15"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Spira, P.: On time-hardware complexity tradeoffs for boolean functions. In: Proceedings of the 4th Hawaii Symposium on System Sciences, 1971, pp. 525\u2013527 (1971)","DOI":"10.3109\/15563657108990975"},{"key":"15_CR34","doi-asserted-by":"publisher","unstructured":"Srinivasan, A., Vasudevan, P.N.: Leakage resilient secret sharing and applications. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part II, LNCS, vol. 11693, pp. 480\u2013509. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_17","DOI":"10.1007\/978-3-030-26951-7_17"},{"key":"15_CR35","doi-asserted-by":"publisher","unstructured":"Tessaro, S.: Computational Indistinguishability Amplification. Ph.D. thesis, ETH Zurich, Z\u00fcrich, Switzerland (2010). https:\/\/doi.org\/10.3929\/ETHZ-A-006183893, https:\/\/hdl.handle.net\/20.500.11850\/72847","DOI":"10.3929\/ETHZ-A-006183893"},{"key":"15_CR36","doi-asserted-by":"publisher","unstructured":"Wegener, I.: Relating monotone formula size and monotone depth of boolean functions. Inf. Process. Lett. 16(1), 41\u201342 (1983). https:\/\/doi.org\/10.1016\/0020-0190(83)90011-X","DOI":"10.1016\/0020-0190(83)90011-X"},{"key":"15_CR37","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Advances in Cryptology- EUROCRYPT 2007: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, 20\u201324 May 2007. Proceedings 26, pp. 555\u2013572. Springer (2007)"},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T01:20:58Z","timestamp":1757467258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}