{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T18:06:33Z","timestamp":1793124393837,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1111599, 1563722"],"award-info":[{"award-number":["1111599, 1563722"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3243805","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T12:56:36Z","timestamp":1539694596000},"page":"525-537","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":201,"title":["Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures"],"prefix":"10.1145","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[{"name":"Georgia Tech, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Mihir Bellare, and Chanathip Namprempre.","author":"Abdalla Michel","year":"2002","unstructured":"Michel Abdalla , Jee Hea An , Mihir Bellare, and Chanathip Namprempre. 2002 . From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. In Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science), Lars R. Knudsen (Ed.), Vol. 2332 . Springer , Heidelberg, 418--433. Michel Abdalla, Jee Hea An, Mihir Bellare, and Chanathip Namprempre. 2002. From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security. In Advances in Cryptology -- EUROCRYPT 2002 (Lecture Notes in Computer Science), Lars R. Knudsen (Ed.), Vol. 2332. Springer, Heidelberg, 418--433."},{"key":"e_1_3_2_2_2_1","volume-title":"ICICS 04: 6th International Conference on Information and Communication Security (Lecture Notes in Computer Science), Javier L\u00f3pez","author":"Abdalla Michel","unstructured":"Michel Abdalla and Bogdan Warinschi . 2004. On the Minimal Assumptions of Group Signature Schemes . In ICICS 04: 6th International Conference on Information and Communication Security (Lecture Notes in Computer Science), Javier L\u00f3pez , Sihan Qing, and Eiji Okamoto (Eds.), Vol. 3269 . Springer , Heidelberg , 1--13. Michel Abdalla and Bogdan Warinschi. 2004. On the Minimal Assumptions of Group Signature Schemes. In ICICS 04: 6th International Conference on Information and Communication Security (Lecture Notes in Computer Science), Javier L\u00f3pez, Sihan Qing, and Eiji Okamoto (Eds.), Vol. 3269. Springer, Heidelberg, 1--13."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_17"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_5_1","volume-title":"Advances in Cryptology -- CRYPTO'92 (Lecture Notes in Computer Science),, Ernest F","author":"Bellare Mihir","unstructured":"Mihir Bellare and Oded Goldreich . 1993. On Defining Proofs of Knowledge . In Advances in Cryptology -- CRYPTO'92 (Lecture Notes in Computer Science),, Ernest F . Brickell (Ed.), Vol. 740 . Springer , Heidelberg , 390--420. Mihir Bellare and Oded Goldreich. 1993. On Defining Proofs of Knowledge. In Advances in Cryptology -- CRYPTO'92 (Lecture Notes in Computer Science),, Ernest F. Brickell (Ed.), Vol. 740. Springer, Heidelberg, 390--420."},{"key":"e_1_3_2_2_6_1","volume-title":"Simplified Requirements, and a Construction Based on General Assumptions. In Advances in Cryptology -- EUROCRYPT 2003 (Lecture Notes in Computer Science)","author":"Bellare Mihir","unstructured":"Mihir Bellare , Daniele Micciancio , and Bogdan Warinschi . 2003. Foundations of Group Signatures: Formal Definitions , Simplified Requirements, and a Construction Based on General Assumptions. In Advances in Cryptology -- EUROCRYPT 2003 (Lecture Notes in Computer Science) , Eli Biham (Ed.), Vol. 2656 . Springer , Heidelberg , 614--629. Mihir Bellare, Daniele Micciancio, and Bogdan Warinschi. 2003. Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. In Advances in Cryptology -- EUROCRYPT 2003 (Lecture Notes in Computer Science), Eli Biham (Ed.), Vol. 2656. Springer, Heidelberg, 614--629."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9011-9"},{"key":"e_1_3_2_2_9_1","volume-title":"SPHINCS: Practical Stateless Hash-Based Signatures. In Advances in Cryptology -- EUROCRYPT","author":"Bernstein Daniel J.","year":"2015","unstructured":"Daniel J. Bernstein , Daira Hopwood , Andreas H\u00fclsing , Tanja Lange , Ruben Niederhagen , Louiza Papachristodoulou , Michael Schneider , Peter Schwabe , and Zooko Wilcox-O'Hearn . 2015 . SPHINCS: Practical Stateless Hash-Based Signatures. In Advances in Cryptology -- EUROCRYPT 2015, Part I (Lecture Notes in Computer Science), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. 9056 . Springer , Heidelberg, 368--397. Daniel J. Bernstein, Daira Hopwood, Andreas H\u00fclsing, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider, Peter Schwabe, and Zooko Wilcox-O'Hearn. 2015. SPHINCS: Practical Stateless Hash-Based Signatures. In Advances in Cryptology -- EUROCRYPT 2015, Part I (Lecture Notes in Computer Science), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. 9056. Springer, Heidelberg, 368--397."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220068"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62222"},{"key":"e_1_3_2_2_13_1","volume-title":"Wu","author":"Boneh Dan","year":"2017","unstructured":"Dan Boneh , Yuval Ishai , Amit Sahai , and David J . Wu . 2017 . Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Lecture Notes in Computer Science). Springer , Heidelberg, 247--277. Dan Boneh, Yuval Ishai, Amit Sahai, and David J. Wu. 2017. Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Lecture Notes in Computer Science). Springer, Heidelberg, 247--277."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30598-9_9"},{"key":"e_1_3_2_2_15_1","unstructured":"Melissa Chase David Derler Steven Goldfeder Claudio Orlandi Sebastian Ramacher Christian Rechberger Daniel Slamanig and Greg Zaverucha. 2017a. The Picnic Signature Scheme Design Document (version 1.0). Available at https:\/\/microsoft.github.io\/Picnic.  Melissa Chase David Derler Steven Goldfeder Claudio Orlandi Sebastian Ramacher Christian Rechberger Daniel Slamanig and Greg Zaverucha. 2017a. The Picnic Signature Scheme Design Document (version 1.0). Available at https:\/\/microsoft.github.io\/Picnic."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133997"},{"key":"e_1_3_2_2_17_1","volume-title":"Advances in Cryptology -- EUROCRYPT'91 (Lecture Notes in Computer Science),, Donald W","author":"Chaum David","unstructured":"David Chaum and Eug\u00e8ne van Heyst . 1991. Group Signatures . In Advances in Cryptology -- EUROCRYPT'91 (Lecture Notes in Computer Science),, Donald W . Davies (Ed.), Vol. 547 . Springer , Heidelberg , 257--265. David Chaum and Eug\u00e8ne van Heyst. 1991. Group Signatures. In Advances in Cryptology -- EUROCRYPT'91 (Lecture Notes in Computer Science),, Donald W. Davies (Ed.), Vol. 547. Springer, Heidelberg, 257--265."},{"key":"e_1_3_2_2_18_1","volume-title":"$mathcalMQ$-Based Signatures in the QROM (Lecture Notes in Computer Science)","author":"Chen Ming-Shing","unstructured":"Ming-Shing Chen , Andreas H\u00fclsing , Joost Rijneveld , Simona Samardjiska , and Peter Schwabe . 2018. SOFIA : $mathcalMQ$-Based Signatures in the QROM (Lecture Notes in Computer Science) . Springer , Heidelberg , 3--33. Ming-Shing Chen, Andreas H\u00fclsing, Joost Rijneveld, Simona Samardjiska, and Peter Schwabe. 2018. SOFIA: $mathcalMQ$-Based Signatures in the QROM (Lecture Notes in Computer Science). Springer, Heidelberg, 3--33."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267809"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89549"},{"key":"e_1_3_2_2_23_1","volume-title":"Advances in Cryptology -- CRYPTO'86 (Lecture Notes in Computer Science), Andrew M","author":"Fiat Amos","unstructured":"Amos Fiat and Adi Shamir . 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In Advances in Cryptology -- CRYPTO'86 (Lecture Notes in Computer Science), Andrew M . Odlyzko (Ed.), Vol. 263 . Springer , Heidelberg , 186--194. Amos Fiat and Adi Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology -- CRYPTO'86 (Lecture Notes in Computer Science), Andrew M. Odlyzko (Ed.), Vol. 263. Springer, Heidelberg, 186--194."},{"key":"e_1_3_2_2_24_1","volume-title":"Jesper Buus Nielsen, and Claudio Orlandi","author":"Frederiksen Tore Kasper","year":"2015","unstructured":"Tore Kasper Frederiksen , Jesper Buus Nielsen, and Claudio Orlandi . 2015 . Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. In Advances in Cryptology -- EUROCRYPT 2015, Part II (Lecture Notes in Computer Science), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. 9057 . Springer , Heidelberg, 191--219. Tore Kasper Frederiksen, Jesper Buus Nielsen, and Claudio Orlandi. 2015. Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge. In Advances in Cryptology -- EUROCRYPT 2015, Part II (Lecture Notes in Computer Science), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. 9057. Springer, Heidelberg, 191--219."},{"key":"e_1_3_2_2_25_1","volume-title":"Advances in Cryptology -- EUROCRYPT 2013 (Lecture Notes in Computer Science), Thomas Johansson and Phong Q","author":"Gennaro Rosario","unstructured":"Rosario Gennaro , Craig Gentry , Bryan Parno , and Mariana Raykova . 2013. Quadratic Span Programs and Succinct NIZKs without PCPs . In Advances in Cryptology -- EUROCRYPT 2013 (Lecture Notes in Computer Science), Thomas Johansson and Phong Q . Nguyen (Eds.), Vol. 7881 . Springer , Heidelberg , 626--645. Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In Advances in Cryptology -- EUROCRYPT 2013 (Lecture Notes in Computer Science), Thomas Johansson and Phong Q. Nguyen (Eds.), Vol. 7881. Springer, Heidelberg, 626--645."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_2_27_1","volume-title":"ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In USENIX Security Symposium .","author":"Giacomelli Irene","year":"2016","unstructured":"Irene Giacomelli , Jesper Madsen , and Claudio Orlandi . 2016 . ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In USENIX Security Symposium . Irene Giacomelli, Jesper Madsen, and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In USENIX Security Symposium ."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_14"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516662"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3081738.3081739"},{"key":"e_1_3_2_2_37_1","volume-title":"Constant-Size Group Signatures from Lattices (Lecture Notes in Computer Science)","author":"Ling San","unstructured":"San Ling , Khoa Nguyen , Huaxiong Wang , and Yanhong Xu. 2018. Constant-Size Group Signatures from Lattices (Lecture Notes in Computer Science) . Springer , Heidelberg , 58--88. San Ling, Khoa Nguyen, Huaxiong Wang, and Yanhong Xu. 2018. Constant-Size Group Signatures from Lattices (Lecture Notes in Computer Science). Springer, Heidelberg, 58--88."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_2_39_1","volume-title":"Advances in Cryptology -- CRYPTO 2001 (Lecture Notes in Computer Science),","author":"Naor Dalit","unstructured":"Dalit Naor , Moni Naor , and Jeffery Lotspiech . 2001. Revocation and Tracing Schemes for Stateless Receivers . In Advances in Cryptology -- CRYPTO 2001 (Lecture Notes in Computer Science), , Joe Kilian (Ed.), Vol. 2139 . Springer , Heidelberg , 41--62. Dalit Naor, Moni Naor, and Jeffery Lotspiech. 2001. Revocation and Tracing Schemes for Stateless Receivers. In Advances in Cryptology -- CRYPTO 2001 (Lecture Notes in Computer Science),, Joe Kilian (Ed.), Vol. 2139. Springer, Heidelberg, 41--62."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"e_1_3_2_2_43_1","volume-title":"ICITS 16: 9th International Conference on Information Theoretic Security (Lecture Notes in Computer Science). Springer","author":"Ranellucci Samuel","year":"2016","unstructured":"Samuel Ranellucci , Alain Tapp , and Rasmus Winther Zakarias . 2016 . Efficient Generic Zero-Knowledge Proofs from Commitments . In ICITS 16: 9th International Conference on Information Theoretic Security (Lecture Notes in Computer Science). Springer , Heidelberg, 190--212. Samuel Ranellucci, Alain Tapp, and Rasmus Winther Zakarias. 2016. Efficient Generic Zero-Knowledge Proofs from Commitments. In ICITS 16: 9th International Conference on Information Theoretic Security (Lecture Notes in Computer Science). Springer, Heidelberg, 190--212."},{"key":"e_1_3_2_2_44_1","volume-title":"Advances in Cryptology -- ASIACRYPT 2001 (Lecture Notes in Computer Science),","author":"Rivest Ronald L.","unstructured":"Ronald L. Rivest , Adi Shamir , and Yael Tauman . 2001. How to Leak a Secret . In Advances in Cryptology -- ASIACRYPT 2001 (Lecture Notes in Computer Science), , Colin Boyd (Ed.), Vol. 2248 . Springer , Heidelberg , 552--565. Ronald L. Rivest, Adi Shamir, and Yael Tauman. 2001. How to Leak a Secret. In Advances in Cryptology -- ASIACRYPT 2001 (Lecture Notes in Computer Science),, Colin Boyd (Ed.), Vol. 2248. Springer, Heidelberg, 552--565."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_25"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_3"},{"key":"e_1_3_2_2_47_1","volume-title":"Faster Secure Two-Party Computation in the Single-Execution Setting (Lecture Notes in Computer Science)","author":"Wang Xiao","unstructured":"Xiao Wang , Alex J. Malozemoff , and Jonathan Katz . 2017a. Faster Secure Two-Party Computation in the Single-Execution Setting (Lecture Notes in Computer Science) . Springer , Heidelberg , 399--424. Xiao Wang, Alex J. Malozemoff, and Jonathan Katz. 2017a. Faster Secure Two-Party Computation in the Single-Execution Setting (Lecture Notes in Computer Science). Springer, Heidelberg, 399--424."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134053"}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243805","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243805","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:08:19Z","timestamp":1750212499000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":45,"alternative-id":["10.1145\/3243734.3243805","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243805","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}