{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:57Z","timestamp":1765113057260,"version":"3.44.0"},"publisher-location":"Cham","reference-count":48,"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_14","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:40Z","timestamp":1755383260000},"page":"429-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Witness Encryption and\u00a0Laconic Zero-Knowledge Arguments"],"prefix":"10.1007","author":[{"given":"Yanyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noam","family":"Mazor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Benhamouda, F., Pointcheval, D.: Disjunctions for hash proof systems: new constructions and applications. In: Advances in Cryptology-EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, 26\u201330 April 2015, Proceedings, Part II 34, pp. 69\u2013100. Springer (2015)","DOI":"10.1007\/978-3-662-46803-6_3"},{"issue":"3","key":"14_CR2","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. 42(3), 327\u2013345 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Choudhuri, A.R.: Characterizing deterministic-prover zero knowledge. In: Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16\u201319, 2020, Proceedings, Part I 18, pp. 535\u2013566. Springer (2020)","DOI":"10.1007\/978-3-030-64375-1_19"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Berman, I., Degwekar, A., Rothblum, R.D., Vasudevan, P.N.: From laconic zero-knowledge to public-key cryptography. In: Annual International Cryptology Conference, pp. 674\u2013697. Springer (2018)","DOI":"10.1007\/978-3-319-96878-0_23"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6:1\u20136:48 (2012)","DOI":"10.1145\/2160158.2160159"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., Garg, S., Jain, A., Kalai, Y.T., Sahai, A.: Secure computation against adaptive auxiliary information. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2013. Proceedings, Part I, volume 8042 of LNCS, pp. 316\u2013334. Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_18"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: FOCS 1997, pp. 374\u2013383 (1997)","DOI":"10.1109\/SFCS.1997.646126"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Barta, O., Ishai, Y., Ostrovsky, R., Wu, D.J.: On succinct arguments and witness encryption from groups. In: Annual International Cryptology Conference, pp. 776\u2013806. Springer (2020)","DOI":"10.1007\/978-3-030-56784-2_26"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Boneh, D., Ishai, Y., Sahai, A., Wu, D.J.: Quasi-optimal snargs via linear multi-prover interactive proofs. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 222\u2013255. Springer (2018)","DOI":"10.1007\/978-3-319-78372-7_8"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0022-0000(88)90028-1","volume":"36","author":"L Babai","year":"1988","unstructured":"Babai, L., Moran, S.: Arthur-merlin games: a randomized proof system, and a hierarchy of complexity classes. J. Comput. Syst. Sci. 36(2), 254\u2013276 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: CRYPTO, pp. 174\u2013187 (1994)","DOI":"10.1007\/3-540-48658-5_19"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, 10\u201312 February 2005, Proceedings, pp. 17\u201333 (2005)","DOI":"10.1007\/978-3-540-30576-7_2"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 45\u201364. Springer (2002)","DOI":"10.1007\/3-540-46035-7_4"},{"key":"14_CR15","unstructured":"Damg\u00e5rd, I.: On $$\\sigma $$-protocols. Lecture Notes, University of Aarhus, Department for Computer Science, vol. 84 (2002)"},{"key":"14_CR16","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string. In: FOCS 1990, pp. 308\u2013317 (1990)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Faonio, A., Nielsen, J.B., Venturi, D.: Predictable arguments of knowledge. In: Public-Key Cryptography\u2013PKC 2017: 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Amsterdam, The Netherlands, 28\u201331 March 2017, Proceedings, Part I 20, pp. 121\u2013150. Springer (2017)","DOI":"10.1007\/978-3-662-54365-8_6"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC 1990, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Freitag, C., Waters, B., Wu, D.J.: How to use (plain) witness encryption: registered abe, flexible broadcast, and more. In: Annual International Cryptology Conference, pp. 498\u2013531. Springer (2023)","DOI":"10.1007\/978-3-031-38551-3_16"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: Symposium on Foundations of Computer Science (FOCS), pp. 40\u201349 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 467\u2013476 (2013)","DOI":"10.1145\/2488608.2488667"},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(98)00116-1","volume":"67","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., H\u00e5stad, J.: On the complexity of interactive proofs with bounded communication. Inf. Process. Lett. 67(4), 205\u2013214 (1998)","journal-title":"Inf. Process. Lett."},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Garg, S., Mahmoody, M., Mohammed, A.: Lower bounds on obfuscation from all-or-nothing encryption primitives. In: Annual International Cryptology Conference, pp. 661\u2013695. Springer (2017)","DOI":"10.1007\/978-3-319-63688-7_22"},{"issue":"2","key":"14_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"14_CR27","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. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7, 1\u201332 (1994)","journal-title":"J. Cryptol."},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-002-0169-0","volume":"11","author":"O Goldreich","year":"2002","unstructured":"Goldreich, O., Vadhan, S., Wigderson, A.: On interactive proofs with a laconic prover. Comput. Complex. 11(1), 1\u201353 (2002)","journal-title":"Comput. Complex."},{"issue":"6","key":"14_CR30","doi-asserted-by":"publisher","first-page":"2487","DOI":"10.1137\/100810630","volume":"42","author":"I Haitner","year":"2013","unstructured":"Haitner, I.: A parallel repetition theorem for any interactive argument. SIAM J. Comput. 42(6), 2487\u20132501 (2013)","journal-title":"SIAM J. Comput."},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Nanashima, M.: Learning in pessiland via inductive inference. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 447\u2013457. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00033"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Pass, R., Wikstr\u00f6m, D., Pietrzak, K.: An efficient parallel repetition theorem. In: Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, 9\u201311 February 2010, Proceedings, pp. 1\u201318 (2010)","DOI":"10.1007\/978-3-642-11799-2_1"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Symposium on Theory of Computing (STOC), pp. 60\u201373 (2021)","DOI":"10.1145\/3406325.3451093"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F}_p$$, DLIN, and PRGs in NC$$^0$$. In: International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), pp. 670\u2013699 (2022)","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Kabanets, V., Cai, J.-Y.: Circuit minimization problem. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 21\u201323 May 2000, Portland, OR, USA, pp. 73\u201379 (2000)","DOI":"10.1145\/335305.335314"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Kiyoshima, S.: Resettable statistical zero-knowledge for np. In: Annual International Cryptology Conference, pp. 288\u2013320. Springer (2024)","DOI":"10.1007\/978-3-031-68400-5_9"},{"key":"14_CR37","first-page":"347","volume":"2014","author":"I Komargodski","year":"2014","unstructured":"Komargodski, I., Moran, T., Naor, M., Pass, R., Rosen, A., Yogev, E.: One-way functions and (im)perfect obfuscation. IACR Cryptology ePrint Archive 2014, 347 (2014)","journal-title":"IACR Cryptology ePrint Archive"},{"issue":"3","key":"14_CR38","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","volume":"48","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: On the notion of infinite pseudorandom sequences. Theor. Comput. Sci. 48(3), 9\u201333 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20134","key":"14_CR39","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207166808803030","volume":"2","author":"AN Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2(1\u20134), 157\u2013168 (1968)","journal-title":"Int. J. Comput. Math."},{"key":"14_CR40","unstructured":"Liu, Y., Mazor, N., Pass, R.: A note on zero-knowledge for np and one-way functions. Cryptology ePrint Archive (2024)"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Mazor, N., Pass, R.: Counting unpredictable bits: a simple prg from one-way functions. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-48615-9_7"},{"key":"14_CR42","doi-asserted-by":"crossref","unstructured":"Pass, R., Venkitasubramaniam, M.: An efficient parallel repetition theorem for arthur-merlin games. In: STOC 2007, pp. 420\u2013429 (2007)","DOI":"10.1145\/1250790.1250853"},{"key":"14_CR43","doi-asserted-by":"crossref","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Annual International Cryptology Conference, pp. 535\u2013559. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: On transformation of interactive proofs that preserve the prover\u2019s complexity. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 21\u201323 May 2000, Portland, OR, USA, pp. 200\u2013207 (2000)","DOI":"10.1145\/335305.335330"},{"issue":"3","key":"14_CR45","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"LG Valiant","year":"1986","unstructured":"Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theoret. Comput. Sci. 47(3), 85\u201393 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Vaikuntanathan, V., Wee, H., Wichs, D.: Witness encryption and null-io from evasive lwe. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 195\u2013221. Springer (2022)","DOI":"10.1007\/978-3-031-22963-3_7"},{"key":"14_CR47","doi-asserted-by":"crossref","unstructured":"Wee, H.: Finding pessiland. In: Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, 4\u20137 March 2006, Proceedings, pp. 429\u2013442 (2006)","DOI":"10.1007\/11681878_22"},{"key":"14_CR48","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T01:22:54Z","timestamp":1757467374000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_14","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"}}]}}