{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,16]],"date-time":"2026-11-16T11:15:34Z","timestamp":1794827734331,"version":"4.9.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122896","type":"print"},{"value":"9783032122902","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12290-2_3","type":"book-chapter","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:06:51Z","timestamp":1764886011000},"page":"71-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Hidden-Bits Approach to\u00a0Statistical ZAPs from\u00a0LWE"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1488-8109","authenticated-orcid":false,"given":"Eli","family":"Bradley","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6178-461X","authenticated-orcid":false,"given":"George","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7388-3858","authenticated-orcid":false,"given":"Shafik","family":"Nassar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9718-8623","authenticated-orcid":false,"given":"Brent","family":"Waters","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5191-692X","authenticated-orcid":false,"given":"David J.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03356-8_3","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"J Alwen","year":"2009","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Leakage-resilient public-key cryptography in the bounded-retrieval model. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 36\u201354. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_3"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Branco, P., Choudhuri, A. R., D\u00f6ttling, N., Jain, A., Malavolta, G., Srinivasan, A.: Black-box non-interactive zero knowledge from vector trapdoor hash. In: EUROCRYPT (2025)","DOI":"10.1007\/978-3-031-91134-7_3"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-030-45727-3_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Badrinarayanan","year":"2020","unstructured":"Badrinarayanan, S., Fernando, R., Jain, A., Khurana, D., Sahai, A.: Statistical ZAP arguments. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 642\u2013667. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_22"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC (1988)","DOI":"10.1145\/62212.62222"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-56877-1_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., Koppula, V., Mour, T.: NIZK from LPN and trapdoor hash via correlation intractability for approximable relations. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 738\u2013767. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_26"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R.D., Vasudevan, P.N.: Batch proofs are statistically hiding. In: STOC (2024)","DOI":"10.1145\/3618260.3649775"},{"key":"3_CR7","unstructured":"Bradley, E., Lu, G., Nassar, S., Waters, B., Wu, D.J.: A hidden-bits approach to statistical ZAPs from LWE. IACR Cryptol. ePrint Arch. (2024). https:\/\/eprint.iacr.org\/2024\/1663.pdf"},{"key":"3_CR8","unstructured":"Barak, B., Lindell, Y., Vadhan, S.P.: Lower bounds for non-black-box zero knowledge. In: FOCS (2003)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O.: Zaps and non-interactive witness indistinguishability from indistinguishability obfuscation. In: TCC (2015)","DOI":"10.1007\/978-3-662-46497-7_16"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bradley, E., Waters, B., Wu, D.J.: Batch arguments to NIZKs from one-way functions. In: TCC (2024)","DOI":"10.1007\/978-3-031-78017-2_15"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-48071-4_31","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"M Bellare","year":"1993","unstructured":"Bellare, M., Yung, M.: Certifying cryptographic tools: the case of trapdoor permutations. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 442\u2013460. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_31"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: STOC (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-78381-9_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"R Canetti","year":"2018","unstructured":"Canetti, R., Chen, Y., Reyzin, L., Rothblum, R.D.: Fiat-Shamir and correlation intractability from strong KDM-secure encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 91\u2013122. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_4"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255\u2013271. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_16"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Couteau, G., Jain, A., Jin, Z., Quach, W.: A note on non-interactive zero-knowledge from CDH. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38551-3_23"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-030-90459-3_16","volume-title":"Theory of Cryptography","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Katsumata, S., Sadeghi, E., Ursu, B.: Statistical ZAPs from group-based assumptions. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 466\u2013498. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_16"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-45727-3_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"G Couteau","year":"2020","unstructured":"Couteau, G., Katsumata, S., Ursu, B.: Non-interactive zero-knowledge in pairing-free groups from weaker assumptions. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 442\u2013471. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_15"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-030-03807-6_18","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2018","unstructured":"Canetti, R., Lichtenberg, A.: Certifying trapdoor permutations, revisited. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 476\u2013506. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_18"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Champion, J., Wu, D.J.: Non-interactive zero-knowledge from non-interactive batch arguments. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38545-2_2"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Dao, Q., Jain, A., Jin, Z.: Non-interactive zero-knowledge from LPN and MQ. In: CRYPTO (2024)","DOI":"10.1007\/978-3-031-68400-5_10"},{"key":"3_CR21","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In: FOCS (2000)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1) (2008)","DOI":"10.1137\/060651380"},{"key":"3_CR23","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: FOCS (1990)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC (1990)","DOI":"10.1145\/100216.100272"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-030-45727-3_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"V Goyal","year":"2020","unstructured":"Goyal, V., Jain, A., Jin, Z., Malavolta, G.: Statistical zaps and new oblivious transfer protocols. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 668\u2013699. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_23"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC (1985)","DOI":"10.1145\/22145.22178"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1) (1994)","DOI":"10.1007\/BF00195207"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 97\u2013111. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_6"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/11761679_21","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"J Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 339\u2013358. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_21"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Rothblum, R.D.: Enhancements of trapdoor permutations. J. Cryptol. 26(3) (2013)","DOI":"10.1007\/s00145-012-9131-8"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4) (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"3_CR32","doi-asserted-by":"crossref","unstructured":"Jain, A., Jin, Z.: Non-interactive Zero Knowledge from Sub-exponential DDH. In: EUROCRYPT (2021)","DOI":"10.1007\/978-3-030-77870-5_1"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-78372-7_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"YT Kalai","year":"2018","unstructured":"Kalai, Y.T., Khurana, D., Sahai, A.: Statistical witness indistinguishability (and more) in two messages. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 34\u201365. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_2"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Kitagawa, F., Matsuda, T., Yamakawa, T.: NIZK from SNARGs. J. Cryptol. 36(2) (2023)","DOI":"10.1007\/s00145-023-09449-3"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-030-45727-3_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"B Libert","year":"2020","unstructured":"Libert, B., Passel\u00e8gue, A., Wee, H., Wu, D.J.: New constructions of statistical NIZKs: dual-mode DV-NIZKs and more. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 410\u2013441. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_14"},{"key":"3_CR36","unstructured":"Lombardi, A., Vaikuntanathan, V., Wichs, D.: 2-message publicly verifiable WI from (subexponential) LWE. IACR Cryptol. ePrint Arch. (2019)"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/978-3-030-45727-3_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Lombardi","year":"2020","unstructured":"Lombardi, A., Vaikuntanathan, V., Wichs, D.: Statistical ZAPR arguments from bilinear maps. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 620\u2013641. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_21"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1) (1996)","DOI":"10.1006\/jcss.1996.0004"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-26948-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"C Peikert","year":"2019","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 89\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_4"},{"key":"3_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-17656-3_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"W Quach","year":"2019","unstructured":"Quach, W., Rothblum, R.D., Wichs, D.: Reusable designated-verifier NIZKs for all NP from CDH. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 593\u2013621. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_21"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: An unconditional study of computational zero knowledge. SIAM J. Comput. 36(4) (2006)","DOI":"10.1137\/S0097539705447207"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Waters, B.: A new approach for non-interactive zero-knowledge from learning with errors. In: STOC (2024)","DOI":"10.1145\/3618260.3649683"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Waters, B., Wee, H., Wu, D.J.: New techniques for preimage sampling: improved NIZKs and more from LWE. In: EUROCRYPT (2025)","DOI":"10.1007\/978-3-031-91134-7_1"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12290-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:06:56Z","timestamp":1764886016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12290-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"ISBN":["9783032122896","9783032122902"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12290-2_3","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-032-12290-2","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"5 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}