{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:51:00Z","timestamp":1781077860009,"version":"3.54.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031385506","type":"print"},{"value":"9783031385513","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38551-3_23","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T19:03:06Z","timestamp":1691521386000},"page":"731-764","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Note on\u00a0Non-interactive Zero-Knowledge from\u00a0CDH"],"prefix":"10.1007","author":[{"given":"Geoffroy","family":"Couteau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhengzhong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Willy","family":"Quach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"23_CR1","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":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"M Bellare","year":"2003","unstructured":"Bellare, M., Micciancio, D., Warinschi, B.: Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 614\u2013629. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_38"},{"key":"23_CR3","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":"23_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, May 18\u201321, 2014, pp. 459\u2013474. IEEE Computer Society (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11681878_4","volume-title":"Theory of Cryptography","author":"A Bender","year":"2006","unstructured":"Bender, A., Katz, J., Morselli, R.: Ring signatures: stronger definitions, and constructions without random Oracles. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 60\u201379. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_4"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: 20th ACM STOC, pp. 103\u2013112. ACM Press, May 1988","DOI":"10.1145\/62212.62222"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-68697-5_22","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"D Boneh","year":"1996","unstructured":"Boneh, D., Lipton, R.J.: Algorithms for black-box fields and their application to cryptography. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 283\u2013297. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_22"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Meyer, P.: Sublinear secure computation from new assumptions. In: TCC\u00a02022, Part\u00a0II, pp. 121\u2013150. LNCS, Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_5","DOI":"10.1007\/978-3-031-22365-5_5"},{"key":"23_CR9","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":"23_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D., Wichs, D.: Fiat-Shamir: from practice to theory. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1082\u20131090. ACM Press (June 2019)","DOI":"10.1145\/3313276.3316380"},{"key":"23_CR11","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":"23_CR12","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":"23_CR13","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":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-78967-3_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"D Cash","year":"2008","unstructured":"Cash, D., Kiltz, E., Shoup, V.: The Twin Diffie-Hellman problem and applications. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 127\u2013145. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_8"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-030-17656-3_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"G Couteau","year":"2019","unstructured":"Couteau, G., Hofheinz, D.: Designated-verifier pseudorandom generators, and their applications. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 562\u2013592. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_20"},{"key":"23_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":"23_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":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-46035-7_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Shoup, V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 45\u201364. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_4"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-48184-2_5","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"A De Santis","year":"1988","unstructured":"De Santis, A., Micali, S., Persiano, G.: Non-interactive zero-knowledge proof systems. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 52\u201372. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_5"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-56614-6_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Y Deng","year":"2017","unstructured":"Deng, Y.: Magic adversaries versus individual reduction: science wins either way. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 351\u2013377. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_12"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: 23rd ACM STOC, pp. 542\u2013552. ACM Press, May 1991","DOI":"10.1145\/103418.103474"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/978-3-030-45724-2_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N D\u00f6ttling","year":"2020","unstructured":"D\u00f6ttling, N., Garg, S., Hajiabadi, M., Masny, D., Wichs, D.: Two-round oblivious transfer from CDH or LPN. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 768\u2013797. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_26"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-26954-8_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"N D\u00f6ttling","year":"2019","unstructured":"D\u00f6ttling, N., Garg, S., Ishai, Y., Malavolta, G., Mour, T., Ostrovsky, R.: Trapdoor hash functions and their applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 3\u201332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_1"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In: 41st FOCS, pp. 283\u2013293. IEEE Computer Society Press, November 2000","DOI":"10.1109\/SFCS.2000.892117"},{"key":"23_CR25","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: 31st FOCS, pp. 308\u2013317. IEEE Computer Society Press, October 1990"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-96881-0_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Garg","year":"2018","unstructured":"Garg, S., Hajiabadi, M.: Trapdoor functions from the computational Diffie-Hellman assumption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 362\u2013391. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_13"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: 21st ACM STOC, pp. 25\u201332. ACM Press, May 1989","DOI":"10.1145\/73007.73010"},{"issue":"3","key":"23_CR29","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00145-012-9131-8","volume":"26","author":"O Goldreich","year":"2013","unstructured":"Goldreich, O., Rothblum, R.D.: Enhancements of trapdoor permutations. J. Cryptol. 26(3), 484\u2013512 (2013)","journal-title":"J. Cryptol."},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th ACM STOC, pp. 291\u2013304. ACM Press, May 1985","DOI":"10.1145\/22145.22178"},{"key":"23_CR31","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":"23_CR32","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":"23_CR33","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":"23_CR34","doi-asserted-by":"crossref","unstructured":"Haitner, I., Nissim, K., Omri, E., Shaltiel, R., Silbak, J.: Computational two-party correlation: a dichotomy for key-agreement protocols. In: Thorup, M. (ed.) 59th FOCS, pp. 136\u2013147. IEEE Computer Society Press, October 2018","DOI":"10.1109\/FOCS.2018.00022"},{"key":"23_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77870-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"A Jain","year":"2021","unstructured":"Jain, A., Jin, Z.: Non-interactive Zero Knowledge from Sub-exponential DDH. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_1"},{"key":"23_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-030-17656-3_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Katsumata","year":"2019","unstructured":"Katsumata, S., Nishimaki, R., Yamada, S., Yamakawa, T.: Designated verifier\/prover and preprocessing NIZKs from Diffie-Hellman assumptions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 622\u2013651. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_22"},{"key":"23_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-96881-0_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"I Komargodski","year":"2018","unstructured":"Komargodski, I., Yogev, E.: On distributional collision resistant\u00a0hashing. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 303\u2013327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_11"},{"key":"23_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-030-26954-8_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Lombardi","year":"2019","unstructured":"Lombardi, A., Quach, W., Rothblum, R.D., Wichs, D., Wu, D.J.: New constructions of reusable designated-verifier NIZKs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 670\u2013700. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_22"},{"key":"23_CR39","unstructured":"Lombardi, A., Vaikuntanathan, V., Wichs, D.: 2-message publicly verifiable WI from (subexponential) LWE. Cryptology ePrint Archive, Report 2019\/808 (2019). https:\/\/eprint.iacr.org\/2019\/808"},{"key":"23_CR40","doi-asserted-by":"crossref","unstructured":"Maji, H.K., Prabhakaran, M., Sahai, A.: On the computational complexity of coin flipping. In: 51st FOCS, pp. 613\u2013622. IEEE Computer Society Press, October 2010","DOI":"10.1109\/FOCS.2010.64"},{"key":"23_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201994","author":"UM Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271\u2013281. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_26"},{"key":"23_CR42","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: 22nd ACM STOC, pp. 427\u2013437. ACM Press, May 1990","DOI":"10.1145\/100216.100273"},{"key":"23_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-48797-6_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"T Okamoto","year":"2015","unstructured":"Okamoto, T., Pietrzak, K., Waters, B., Wichs, D.: New realizations of somewhere statistically binding hashing and positional accumulators. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 121\u2013145. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_6"},{"key":"23_CR44","doi-asserted-by":"publisher","unstructured":"Pass, R., shelat, Vaikuntanathan, V.: Construction of a non-malleable encryption scheme from any semantically secure one. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 271\u2013289. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_16","DOI":"10.1007\/11818175_16"},{"key":"23_CR45","doi-asserted-by":"crossref","unstructured":"Pass, R., Venkitasubramaniam, M.: Is it easier to prove theorems that are guaranteed to be true? In: 61st FOCS, pp. 1255\u20131267. IEEE Computer Society Press, November 2020","DOI":"10.1109\/FOCS46700.2020.00119"},{"key":"23_CR46","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":"23_CR47","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 187\u2013196. ACM Press (May 2008)","DOI":"10.1145\/1374376.1374406"},{"key":"23_CR48","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":"23_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_1"},{"key":"23_CR50","doi-asserted-by":"publisher","unstructured":"Rothblum, R.D., Vasudevan, P.N.: Collision-resistance from multi-collision-resistance. In: CRYPTO\u00a02022, Part\u00a0III, pp. 503\u2013529. LNCS, Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_17","DOI":"10.1007\/978-3-031-15982-4_17"},{"key":"23_CR51","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press (May\/June 2014)","DOI":"10.1145\/2591796.2591825"},{"key":"23_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-030-17659-4_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 408\u2013438. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_14"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38551-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T22:03:43Z","timestamp":1753567423000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38551-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031385506","9783031385513"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38551-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 August 2023","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"479","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"124","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}