{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:57:10Z","timestamp":1755601030718},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s00145-023-09449-3","type":"journal-article","created":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T23:03:26Z","timestamp":1680908606000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["NIZK from SNARGs"],"prefix":"10.1007","volume":"36","author":[{"given":"Fuyuki","family":"Kitagawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiro","family":"Matsuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,8]]},"reference":[{"key":"9449_CR1","series-title":"LNCS","first-page":"474","volume-title":"TCC 2009","author":"Adi Akavia","year":"2009","unstructured":"Adi Akavia, Shafi Goldwasser, and Vinod Vaikuntanathan. Simultaneous hardcore bits and cryptography against memory attacks. In Omer Reingold, editor, TCC\u00a02009, volume 5444 of  LNCS, pages 474\u2013495. Springer, Heidelberg, 2009."},{"key":"9449_CR2","series-title":"Part I, volume 10991 of LNCS","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/978-3-319-96884-1_25","volume-title":"CRYPTO 2018","author":"Dan Boneh","year":"2018","unstructured":"Dan Boneh, Joseph Bonneau, Benedikt B\u00fcnz, and Ben Fisch. Verifiable delay functions. In Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0I, volume 10991 of LNCS, pages 757\u2013788. Springer, Heidelberg, 2018."},{"key":"9449_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-32009-5_16","volume-title":"CRYPTO 2012","author":"Nir Bitansky","year":"2012","unstructured":"Nir Bitansky and Alessandro Chiesa. Succinct arguments from multi-prover interactive proofs and their efficiency benefits. In Reihaneh Safavi-Naini and Ran Canetti, editors, CRYPTO\u00a02012, volume 7417 of LNCS, pages 255\u2013272. Springer, Heidelberg, 2012."},{"issue":"4","key":"9449_CR4","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"Nir Bitansky","year":"2017","unstructured":"Nir Bitansky, Ran Canetti, Alessandro Chiesa, Shafi Goldwasser, Huijia Lin, Aviad Rubinstein, and Eran Tromer. The hunting of the SNARK. Journal of Cryptology, 30(4):989\u20131066, 2017.","journal-title":"Journal of Cryptology"},{"key":"9449_CR5","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, and Madars Virza. Zerocash: Decentralized anonymous payments from bitcoin. In 2014 IEEE Symposium on Security and Privacy, pages 459\u2013474. IEEE Computer Society Press, May 2014.","DOI":"10.1109\/SP.2014.36"},{"key":"9449_CR6","series-title":"LNCS","first-page":"315","volume-title":"TCC 2013","author":"Nir Bitansky","year":"2013","unstructured":"Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, and Omer Paneth. Succinct non-interactive arguments via linear interactive proofs. In Amit Sahai, editor, TCC\u00a02013, volume 7785 of LNCS, pages 315\u2013333. Springer, Heidelberg, 2013."},{"key":"9449_CR7","doi-asserted-by":"crossref","unstructured":"Manuel Blum, Paul Feldman, and Silvio Micali. Non-interactive zero-knowledge and its applications (extended abstract). In 20th ACM STOC, pages 103\u2013112. ACM Press, May 1988.","DOI":"10.1145\/62212.62222"},{"key":"9449_CR8","series-title":"Part I, volume 12105 of LNCS","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"EUROCRYPT 2020","author":"Benedikt B\u00fcnz","year":"2020","unstructured":"Benedikt B\u00fcnz, Ben Fisch, and Alan Szepieniec. Transparent SNARKs from DARK compilers. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, pages 677\u2013706. Springer, Heidelberg, 2020."},{"key":"9449_CR9","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Yuval Ishai, Amit Sahai, and David\u00a0J. Wu. Lattice-based SNARGs and their application to more efficient obfuscation. In Jean-S\u00e9bastien Coron and Jesper\u00a0Buus Nielsen, editors,  EUROCRYPT\u00a02017, Part\u00a0III, volume 10212 of LNCS, pages 247\u2013277. Springer, Heidelberg, April\u00a0\/\u00a0May 2017.","DOI":"10.1007\/978-3-319-56617-7_9"},{"key":"9449_CR10","doi-asserted-by":"crossref","unstructured":"Dan Boneh, Yuval Ishai, Amit Sahai, and David\u00a0J. Wu. Quasi-optimal SNARGs via linear multi-prover interactive proofs. In Jesper\u00a0Buus Nielsen and Vincent Rijmen, editors,  EUROCRYPT\u00a02018, Part\u00a0III, volume 10822 of LNCS, pages 222\u2013255. Springer, Heidelberg, April\u00a0\/\u00a0May 2018.","DOI":"10.1007\/978-3-319-78372-7_8"},{"key":"9449_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1007\/3-540-39200-9_38","volume-title":"EUROCRYPT 2003","author":"Mihir Bellare","year":"2003","unstructured":"Mihir Bellare, Daniele Micciancio, and Bogdan Warinschi. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In Eli Biham, editor, EUROCRYPT\u00a02003, volume 2656 of  LNCS, pages 614\u2013629. Springer, Heidelberg, 2003."},{"key":"9449_CR12","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy\u00a0N. Rothblum, Ron\u00a0D. Rothblum, and Daniel Wichs. Fiat-Shamir: from practice to theory. In Moses Charikar and Edith Cohen, editors, 51st ACM STOC, pages 1082\u20131090. ACM Press, June 2019.","DOI":"10.1145\/3313276.3316380"},{"key":"9449_CR13","doi-asserted-by":"crossref","unstructured":"Ran Canetti, Yilei Chen, Leonid Reyzin, and Ron\u00a0D. Rothblum. Fiat-Shamir and correlation intractability from strong KDM-secure encryption. In Jesper\u00a0Buus Nielsen and Vincent Rijmen, editors,  EUROCRYPT\u00a02018, Part\u00a0I, volume 10820 of LNCS, pages 91\u2013122. Springer, Heidelberg, April\u00a0\/\u00a0May 2018.","DOI":"10.1007\/978-3-319-78381-9_4"},{"issue":"3","key":"9449_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s00145-006-0442-5","volume":"20","author":"Ran Canetti","year":"2007","unstructured":"Ran Canetti, Shai Halevi, and Jonathan Katz. A forward-secure public-key encryption scheme. Journal of Cryptology, 20(3):265\u2013294, 2007.","journal-title":"Journal of Cryptology"},{"key":"9449_CR15","series-title":"Part I, volume 12105 of LNCS","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"EUROCRYPT 2020","author":"Alessandro Chiesa","year":"2020","unstructured":"Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas\u00a0P. Ward. Marlin: Preprocessing zkSNARKs with universal and updatable SRS. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, pages 738\u2013768. Springer, Heidelberg, 2020."},{"key":"9449_CR16","series-title":"Part III, volume 12107 of LNCS","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-45727-3_15","volume-title":"EUROCRYPT 2020","author":"Geoffroy Couteau","year":"2020","unstructured":"Geoffroy Couteau, Shuichi Katsumata, and Bogdan Ursu. Non-interactive zero-knowledge in pairing-free groups from weaker assumptions. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0III, volume 12107 of LNCS, pages 442\u2013471. Springer, Heidelberg, 2020."},{"key":"9449_CR17","series-title":"Part I, volume 11239 of LNCS","first-page":"476","volume-title":"TCC 2018","author":"Ran Canetti","year":"2018","unstructured":"Ran Canetti and Amit Lichtenberg. Certifying trapdoor permutations, revisited. In Amos Beimel and Stefan Dziembowski, editors, TCC\u00a02018, Part\u00a0I, volume 11239 of LNCS, pages 476\u2013506. Springer, Heidelberg, 2018."},{"key":"9449_CR18","series-title":"Part II, volume 11892 of LNCS","first-page":"1","volume-title":"TCC 2019","author":"Alessandro Chiesa","year":"2019","unstructured":"Alessandro Chiesa, Peter Manohar, and Nicholas Spooner. Succinct arguments in the quantum random oracle model. In Dennis Hofheinz and Alon Rosen, editors, TCC\u00a02019, Part\u00a0II, volume 11892 of LNCS, pages 1\u201329. Springer, Heidelberg, 2019."},{"key":"9449_CR19","series-title":"Part I, volume 12105 of LNCS","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-030-45721-1_27","volume-title":"EUROCRYPT 2020","author":"Alessandro Chiesa","year":"2020","unstructured":"Alessandro Chiesa, Dev Ojha, and Nicholas Spooner. Fractal: Post-quantum and transparent recursive proofs from holography. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, pages 769\u2013793. Springer, Heidelberg, 2020."},{"key":"9449_CR20","series-title":"LNCS","first-page":"257","volume-title":"EUROCRYPT\u201991","author":"David Chaum","year":"1991","unstructured":"David Chaum and Eug\u00e8ne van Heyst. Group signatures. In Donald\u00a0W. Davies, editor, EUROCRYPT\u201991, volume 547 of  LNCS, pages 257\u2013265. Springer, Heidelberg, 1991."},{"issue":"2","key":"9449_CR21","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"Danny Dolev","year":"2000","unstructured":"Danny Dolev, Cynthia Dwork, and Moni Naor. Nonmalleable cryptography. SIAM J. Comput., 30(2):391\u2013437, 2000.","journal-title":"SIAM J. Comput."},{"key":"9449_CR22","series-title":"Part II, volume 8270 of LNCS","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-42045-0_8","volume-title":"ASIACRYPT 2013","author":"Ivan Damg\u00e5rd","year":"2013","unstructured":"Ivan Damg\u00e5rd, Sebastian Faust, Pratyay Mukherjee, and Daniele Venturi. Bounded tamper resilience: How to go beyond the algebraic barrier. In Kazue Sako and Palash Sarkar, editors, ASIACRYPT\u00a02013, Part\u00a0II, volume 8270 of LNCS, pages 140\u2013160. Springer, Heidelberg, 2013."},{"key":"9449_CR23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-17373-8_35","volume-title":"ASIACRYPT 2010","author":"Yevgeniy Dodis","year":"2010","unstructured":"Yevgeniy Dodis, Kristiyan Haralambiev, Adriana L\u00f3pez-Alt, and Daniel Wichs. Efficient public-key cryptography in the presence of key leakage. In Masayuki Abe, editor, ASIACRYPT\u00a02010, volume 6477 of  LNCS, pages 613\u2013631. Springer, Heidelberg, 2010."},{"issue":"6","key":"9449_CR24","doi-asserted-by":"publisher","first-page":"1513","DOI":"10.1137\/S0097539703426817","volume":"36","author":"Cynthia Dwork","year":"2007","unstructured":"Cynthia Dwork and Moni Naor. Zaps and their applications. SIAM J. Comput., 36(6):1513\u20131543, 2007.","journal-title":"SIAM J. Comput."},{"key":"9449_CR25","series-title":"Part I, volume 12105 of LNCS","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-030-45721-1_25","volume-title":"EUROCRYPT 2020","author":"Naomi Ephraim","year":"2020","unstructured":"Naomi Ephraim, Cody Freitag, Ilan Komargodski, and Rafael Pass. SPARKs: Succinct parallelizable arguments of knowledge. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, pages 707\u2013737. Springer, Heidelberg, 2020."},{"issue":"1","key":"9449_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"Uriel Feige","year":"1999","unstructured":"Uriel Feige, Dror Lapidot, and Adi Shamir. Multiple noninteractive zero knowledge proofs under general assumptions. SIAM J. Comput., 29(1):1\u201328, 1999.","journal-title":"SIAM J. Comput."},{"key":"9449_CR27","series-title":"LNCS","first-page":"186","volume-title":"CRYPTO\u201986","author":"Amos Fiat","year":"1987","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Andrew\u00a0M. Odlyzko, editor, CRYPTO\u201986, volume 263 of  LNCS, pages 186\u2013194. Springer, Heidelberg, 1987."},{"key":"9449_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"EUROCRYPT 2013","author":"Rosario Gennaro","year":"2013","unstructured":"Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. Quadratic span programs and succinct NIZKs without PCPs. In Thomas Johansson and Phong\u00a0Q. Nguyen, editors,  EUROCRYPT\u00a02013, volume 7881 of LNCS, pages 626\u2013645. Springer, Heidelberg, 2013."},{"key":"9449_CR29","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Alfred Aho, editor, 19th ACM STOC, pages 218\u2013229. ACM Press, May 1987.","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"9449_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"Oded Goldreich","year":"1994","unstructured":"Oded Goldreich and Yair Oren. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1\u201332, 1994.","journal-title":"Journal of Cryptology"},{"key":"9449_CR31","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: The state of the art. In Oded Goldreich, editor, Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, volume 6650 of LNCS, pages 406\u2013421. Springer, 2011.","DOI":"10.1007\/978-3-642-22670-0_28"},{"issue":"3","key":"9449_CR32","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2220357.2220358","volume":"59","author":"Jens Groth","year":"2012","unstructured":"Jens Groth, Rafail Ostrovsky, and Amit Sahai. New techniques for noninteractive zero-knowledge. J. ACM, 59(3):11:1\u201311:35, 2012.","journal-title":"J. ACM"},{"issue":"3","key":"9449_CR33","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/s00145-012-9131-8","volume":"26","author":"Oded Goldreich","year":"2013","unstructured":"Oded Goldreich and Ron\u00a0D. Rothblum. Enhancements of trapdoor permutations. Journal of Cryptology, 26(3):484\u2013512, 2013.","journal-title":"Journal of Cryptology"},{"key":"9449_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-17373-8_19","volume-title":"ASIACRYPT 2010","author":"Jens Groth","year":"2010","unstructured":"Jens Groth. Short pairing-based non-interactive zero-knowledge arguments. In Masayuki Abe, editor, ASIACRYPT\u00a02010, volume 6477 of  LNCS, pages 321\u2013340. Springer, Heidelberg, 2010."},{"key":"9449_CR35","series-title":"Part II, volume 9666 of LNCS","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"EUROCRYPT 2016","author":"Jens Groth","year":"2016","unstructured":"Jens Groth. On the size of pairing-based non-interactive arguments. In Marc Fischlin and Jean-S\u00e9bastien Coron, editors,  EUROCRYPT\u00a02016, Part\u00a0II, volume 9666 of LNCS, pages 305\u2013326. Springer, Heidelberg, 2016."},{"key":"9449_CR36","doi-asserted-by":"crossref","unstructured":"Craig Gentry and Daniel Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In Lance Fortnow and Salil\u00a0P. Vadhan, editors, 43rd ACM STOC, pages 99\u2013108. ACM Press, June 2011.","DOI":"10.1145\/1993636.1993651"},{"issue":"4","key":"9449_CR37","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"Johan H\u00e5stad","year":"1999","unstructured":"Johan H\u00e5stad, Russell Impagliazzo, Leonid\u00a0A. Levin, and Michael Luby. A pseudorandom generator from any one-way function. SIAM J. Comput., 28(4):1364\u20131396, 1999.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9449_CR38","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/s00145-015-9200-x","volume":"29","author":"Carmit Hazay","year":"2016","unstructured":"Carmit Hazay, Adriana L\u00f3pez-Alt, Hoeteck Wee, and Daniel Wichs. Leakage-resilient cryptography from minimal assumptions. Journal of Cryptology, 29(3):514\u2013551, 2016.","journal-title":"Journal of Cryptology"},{"key":"9449_CR39","series-title":"Part I, volume 12550 of LNCS","first-page":"567","volume-title":"TCC 2020","author":"Fuyuki Kitagawa","year":"2020","unstructured":"Fuyuki Kitagawa, Takahiro Matsuda, and Takashi Yamakawa. NIZK from SNARG. In Rafael Pass and Krzysztof Pietrzak, editors, TCC\u00a02020, Part\u00a0I, volume 12550 of LNCS, pages 567\u2013595. Springer, Heidelberg, 2020."},{"key":"9449_CR40","series-title":"Part II, volume 11477 of LNCS","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-030-17656-3_22","volume-title":"EUROCRYPT 2019","author":"Shuichi Katsumata","year":"2019","unstructured":"Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, and Takashi Yamakawa. Designated verifier\/prover and preprocessing NIZKs from Diffie-Hellman assumptions. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0II, volume 11477 of LNCS, pages 622\u2013651. Springer, Heidelberg, 2019."},{"key":"9449_CR41","series-title":"Part III, volume 11694 of LNCS","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/978-3-030-26954-8_21","volume-title":"CRYPTO 2019","author":"Shuichi Katsumata","year":"2019","unstructured":"Shuichi Katsumata, Ryo Nishimaki, Shota Yamada, and Takashi Yamakawa. Exploring constructions of compact NIZKs from various assumptions. In Alexandra Boldyreva and Daniele Micciancio, editors,  CRYPTO\u00a02019, Part\u00a0III, volume 11694 of LNCS, pages 639\u2013669. Springer, Heidelberg, 2019."},{"key":"9449_CR42","doi-asserted-by":"crossref","unstructured":"Yael\u00a0Tauman Kalai, Guy\u00a0N. Rothblum, and Ron\u00a0D. Rothblum. From obfuscation to the security of Fiat-Shamir for proofs. In Jonathan Katz and Hovav Shacham, editors, CRYPTO\u00a02017, Part\u00a0II, volume 10402 of LNCS, pages 224\u2013251. Springer, Heidelberg, August 2017.","DOI":"10.1007\/978-3-319-63715-0_8"},{"key":"9449_CR43","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/978-3-642-10366-7_41","volume-title":"ASIACRYPT 2009","author":"Jonathan Katz","year":"2009","unstructured":"Jonathan Katz and Vinod Vaikuntanathan. Signature schemes with bounded leakage resilience. In Mitsuru Matsui, editor, ASIACRYPT\u00a02009, volume 5912 of  LNCS, pages 703\u2013720. Springer, Heidelberg, 2009."},{"key":"9449_CR44","series-title":"Part II, volume 10992 of LNCS","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-319-96881-0_25","volume-title":"CRYPTO 2018","author":"Sam Kim","year":"2018","unstructured":"Sam Kim and David\u00a0J. Wu. Multi-theorem preprocessing NIZKs from lattices. In Hovav Shacham and Alexandra Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0II, volume 10992 of LNCS, pages 733\u2013765. Springer, Heidelberg, 2018."},{"key":"9449_CR45","series-title":"Part III, volume 12107 of LNCS","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-030-45727-3_14","volume-title":"EUROCRYPT 2020","author":"Beno\u00eet Libert","year":"2020","unstructured":"Beno\u00eet Libert, Alain Passel\u00e8gue, Hoeteck Wee, and David\u00a0J. Wu. New constructions of statistical NIZKs: Dual-mode DV-NIZKs and more. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0III, volume 12107 of LNCS, pages 410\u2013441. Springer, Heidelberg, 2020."},{"issue":"4","key":"9449_CR46","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"Silvio Micali","year":"2000","unstructured":"Silvio Micali. Computationally sound proofs. SIAM J. Comput., 30(4):1253\u20131298, 2000.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9449_CR47","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"Moni Naor","year":"1991","unstructured":"Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151\u2013158, 1991.","journal-title":"Journal of Cryptology"},{"key":"9449_CR48","doi-asserted-by":"crossref","unstructured":"Moni Naor and Moti Yung. Public-key cryptosystems provably secure against chosen ciphertext attacks. In 22nd ACM STOC, pages 427\u2013437. ACM Press, May 1990.","DOI":"10.1145\/100216.100273"},{"key":"9449_CR49","doi-asserted-by":"crossref","unstructured":"Rafael Pass and Abhi shelat. Unconditional characterizations of non-interactive zero-knowledge. In Victor Shoup, editor, CRYPTO\u00a02005, volume 3621 of  LNCS, pages 118\u2013134. Springer, Heidelberg, August 2005.","DOI":"10.1007\/11535218_8"},{"key":"9449_CR50","series-title":"Part I, volume 11692 of LNCS","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-26948-7_4","volume-title":"CRYPTO 2019","author":"Chris Peikert","year":"2019","unstructured":"Chris Peikert and Sina Shiehian. Noninteractive zero knowledge for NP from (plain) learning with errors. In Alexandra Boldyreva and Daniele Micciancio, editors,  CRYPTO\u00a02019, Part\u00a0I, volume 11692 of LNCS, pages 89\u2013114. Springer, Heidelberg, 2019."},{"key":"9449_CR51","series-title":"Part II, volume 11477 of LNCS","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-17656-3_21","volume-title":"EUROCRYPT 2019","author":"Willy Quach","year":"2019","unstructured":"Willy Quach, Ron\u00a0D. Rothblum, and Daniel Wichs. Reusable designated-verifier NIZKs for all NP from CDH. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0II, volume 11477 of LNCS, pages 593\u2013621. Springer, Heidelberg, 2019."},{"key":"9449_CR52","doi-asserted-by":"crossref","unstructured":"Willy Quach, Brent Waters, and Daniel Wichs. Targeted lossy functions and applications. In Tal Malkin and Chris Peikert, editors, CRYPTO\u00a02021, Part\u00a0IV, volume 12828 of LNCS, pages 424\u2013453, Virtual Event, August 2021. Springer, Heidelberg.","DOI":"10.1007\/978-3-030-84259-8_15"},{"key":"9449_CR53","doi-asserted-by":"crossref","unstructured":"Ronald\u00a0L. Rivest, Adi Shamir, and Yael Tauman. How to leak a secret. In Colin Boyd, editor, ASIACRYPT\u00a02001, volume 2248 of  LNCS, pages 552\u2013565. Springer, Heidelberg, 2001.","DOI":"10.1007\/3-540-45682-1_32"},{"key":"9449_CR54","doi-asserted-by":"crossref","unstructured":"Amit Sahai and Brent Waters. How to use indistinguishability obfuscation: deniable encryption, and more. In David\u00a0B. Shmoys, editor, 46th ACM STOC, pages 475\u2013484. ACM Press, May\u00a0\/\u00a0June 2014.","DOI":"10.1145\/2591796.2591825"},{"key":"9449_CR55","doi-asserted-by":"crossref","unstructured":"Salil\u00a0P. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded storage model. In Dan Boneh, editor, CRYPTO\u00a02003, volume 2729 of LNCS, pages 61\u201377. Springer, Heidelberg, August 2003.","DOI":"10.1007\/978-3-540-45146-4_4"},{"key":"9449_CR56","series-title":"LNCS","first-page":"429","volume-title":"TCC 2006","author":"Hoeteck Wee","year":"2006","unstructured":"Hoeteck Wee. Finding pessiland. In Shai Halevi and Tal Rabin, editors, TCC\u00a02006, volume 3876 of LNCS, pages 429\u2013442. Springer, Heidelberg, March 2006."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09449-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09449-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T17:08:44Z","timestamp":1682442524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09449-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["9449"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09449-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]},"assertion":[{"value":"8 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}