{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:36:35Z","timestamp":1772757395194,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"EU ERC","award":["101002845 PLAZA"],"award-info":[{"award-number":["101002845 PLAZA"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3616613","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"16-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Lattice-Based Blind Signatures: Short, Efficient, and Round-Optimal"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0888-283X","authenticated-orcid":false,"given":"Ward","family":"Beullens","sequence":"first","affiliation":[{"name":"IBM Research Europe - Zurich, Ruschlikon, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5149-264X","authenticated-orcid":false,"given":"Vadim","family":"Lyubashevsky","sequence":"additional","affiliation":[{"name":"IBM Research Europe - Zurich, Ruschlikon, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8240-6167","authenticated-orcid":false,"given":"Ngoc Khanh","family":"Nguyen","sequence":"additional","affiliation":[{"name":"EPFL, Lausanne, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5024-5123","authenticated-orcid":false,"given":"Gregor","family":"Seiler","sequence":"additional","affiliation":[{"name":"IBM Research Europe - Zurich, Ruschlikon, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ASIACRYPT (1) (Lecture Notes in Computer Science","author":"Agrawal Shweta","unstructured":"Shweta Agrawal, Craig Gentry, Shai Halevi, and Amit Sahai. 2013. Discrete Gaussian Leftover Hash Lemma over Infinite Domains. In ASIACRYPT (1) (Lecture Notes in Computer Science, Vol. 8269). Springer, 97--116."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Shweta Agrawal Elena Kirshanova Damien Stehl\u00e9 and Anshu Yadav. 2022. Practical Round-Optimal Lattice-Based Blind Signatures. In CCS. ACM 39--53.","DOI":"10.1145\/3548606.3560650"},{"key":"e_1_3_2_1_3_1","volume-title":"Smart","author":"Albrecht Martin R.","year":"2021","unstructured":"Martin R. Albrecht, Alex Davidson, Amit Deo, and Nigel P. Smart. 2021. Round-Optimal Verifiable Oblivious Pseudorandom Functions from Ideal Lattices. In Public Key Cryptography (2) (Lecture Notes in Computer Science, Vol. 12711). Springer, 261--289. https:\/\/eprint.iacr.org\/2019\/1271."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_5_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science","author":"Attema Thomas","unstructured":"Thomas Attema, Vadim Lyubashevsky, and Gregor Seiler. 2020. Practical Product Proofs for Lattice Commitments. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 12171). Springer, 470--499."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_20"},{"key":"e_1_3_2_1_7_1","volume-title":"EUROCRYPT (1) (Lecture Notes in Computer Science","author":"Benhamouda Fabrice","unstructured":"Fabrice Benhamouda, Tancr\u00e8de Lepoint, Julian Loss, Michele Orr\u00f9, and Mariana Raykova. 2021. On the (in)security of ROS. In EUROCRYPT (1) (Lecture Notes in Computer Science, Vol. 12696). Springer, 33--53."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Ward Beullens and Gregor Seiler. 2022. LaBRADOR: Compact Proofs for R1CS from Module-SIS. IACR Cryptol. ePrint Arch. (2022) 1341.","DOI":"10.1007\/978-3-031-38554-4_17"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417893"},{"key":"e_1_3_2_1_10_1","volume-title":"CRYPTO (1) (Lecture Notes in Computer Science","author":"Bootle Jonathan","unstructured":"Jonathan Bootle, Vadim Lyubashevsky, and Gregor Seiler. 2019. Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs. In CRYPTO (1) (Lecture Notes in Computer Science, Vol. 11692). Springer, 176--202."},{"key":"e_1_3_2_1_11_1","volume-title":"EuroS&P","author":"Casacuberta S\u00edlvia","year":"2022","unstructured":"S\u00edlvia Casacuberta, Julia Hesse, and Anja Lehmann. 2022. SoK: Oblivious Pseudo-random Functions. In EuroS&P. IEEE, 625--646. https:\/\/eprint.iacr.org\/2022\/302."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase Sarah Meiklejohn and Greg Zaverucha. 2014. Algebraic MACs and Keyed-Verification Anonymous Credentials. In CCS. ACM 1205--1216.","DOI":"10.1145\/2660267.2660328"},{"key":"e_1_3_2_1_13_1","volume-title":"Blind Signatures for Untraceable Payments","author":"Chaum David","unstructured":"David Chaum. 1982. Blind Signatures for Untraceable Payments. In CRYPTO. Plenum Press, New York, 199--203."},{"key":"e_1_3_2_1_14_1","unstructured":"David Chaum and Thomas Moser. 2022. eCash 2.0: Inalienably private and quantum-resistant to counterfeiting . https:\/\/chaum.com\/publications\/."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2021.i2.159-188"},{"key":"e_1_3_2_1_16_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science","author":"del Pino Rafa\u00ebl","unstructured":"Rafa\u00ebl del Pino and Shuichi Katsumata. 2022. A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 13508). Springer, 306--336."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas Alain Durmus Tancr\u00e8de Lepoint and Vadim Lyubashevsky. 2013. Lattice Signatures and Bimodal Gaussians. In CRYPTO (1). 40--56.","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"L\u00e9o Ducas Vadim Lyubashevsky and Thomas Prest. 2014. Efficient Identity-Based Encryption over NTRU Lattices. In ASIACRYPT. 22--41.","DOI":"10.1007\/978-3-662-45608-8_2"},{"key":"e_1_3_2_1_19_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Esgin Muhammed F.","year":"2020","unstructured":"Muhammed F. Esgin, Ngoc Khanh Nguyen, and Gregor Seiler. 2020. Practical Exact Proofs from Lattices: New Techniques to Exploit Fully-Splitting Rings. In ASIACRYPT (2). 259--288."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_4"},{"key":"e_1_3_2_1_21_1","volume-title":"Nguyen","author":"Gama Nicolas","year":"2008","unstructured":"Nicolas Gama and Phong Q. Nguyen. 2008. Predicting Lattice Reduction. In EUROCRYPT. 31--51."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry Chris Peikert and Vinod Vaikuntanathan. 2008. Trapdoors for hard lattices and new cryptographic constructions. In STOC. 197--206.","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_23_1","volume-title":"Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX Security Symposium. USENIX Association, 519--535","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy, and Markus Schofnegger. 2021. Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In USENIX Security Symposium. USENIX Association, 519--535."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky. 2012. Lattice Signatures Without Trapdoors. In EURO-CRYPT. 738--755.","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"e_1_3_2_1_25_1","volume-title":"BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. IACR Cryptol. ePrint Arch.","author":"Lyubashevsky Vadim","year":"2022","unstructured":"Vadim Lyubashevsky and Ngoc Khanh Nguyen. 2022. BLOOM: Bimodal Lattice One-Out-of-Many Proofs and Applications. IACR Cryptol. ePrint Arch. (2022), 1307."},{"key":"e_1_3_2_1_26_1","volume-title":"Ngoc Khanh Nguyen, and Maxime Plan\u00e7on","author":"Lyubashevsky Vadim","year":"2022","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Maxime Plan\u00e7on. 2022. Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 13508). Springer, 71--101."},{"key":"e_1_3_2_1_27_1","volume-title":"Maxime Plan\u00e7on, and Gregor Seiler.","author":"Lyubashevsky Vadim","year":"2021","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Plan\u00e7on, and Gregor Seiler. 2021. Shorter Lattice-Based Group Signatures via \"Almost Free\" Encryption and Other Optimizations. In ASIACRYPT (4). Springer, 218--248."},{"key":"e_1_3_2_1_28_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Lyubashevsky Vadim","year":"2020","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Gregor Seiler. 2020. Practical Lattice-Based Zero-Knowledge Proofs for Integer Relations. In CCS. ACM, 1051--1070."},{"key":"e_1_3_2_1_29_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Lyubashevsky Vadim","year":"2021","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Gregor Seiler. 2021. Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments. In Public Key Cryptography (1). Springer, 215--241."},{"key":"e_1_3_2_1_30_1","volume-title":"Post-quantum cryptography","author":"Micciancio Daniele","unstructured":"Daniele Micciancio and Oded Regev. 2009. Lattice-based cryptography. In Post-quantum cryptography. Springer, 147--191."},{"key":"e_1_3_2_1_31_1","unstructured":"NIST. 2022. Status Report on the Third Round of the NIST Post-Quantum Cryptography Standardization Process. https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/ 8413\/final."},{"key":"e_1_3_2_1_32_1","unstructured":"NSA. 2022. Announcing the Commercial National Security Algorithm Suite 2.0. https:\/\/media.defense.gov\/2022\/Sep\/07\/2003071834\/-1\/-1\/0\/CSA_CNSA_2.0_ALGORITHMS_.PDF."},{"key":"e_1_3_2_1_33_1","volume-title":"Wood","author":"Policharla Guru-Vamsi","year":"2023","unstructured":"Guru-Vamsi Policharla, Bas Westerbaan, Armando Faz-Hern\u00e1ndez, and Christopher A. Wood. 2023. Post-Quantum Privacy Pass via Post-Quantum Anonymous Credentials. IACR Cryptol. ePrint Arch. (2023), 414."},{"key":"e_1_3_2_1_34_1","volume-title":"Technical Report","author":"Prest Thomas","unstructured":"Thomas Prest, Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Ricosset, Gregor Seiler, William Whyte, and Zhenfei Zhang. 2017. FALCON. Technical Report. National Institute of Standards and Technology. https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-1-submissions.."}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616613","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3616613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:47:32Z","timestamp":1755740852000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":34,"alternative-id":["10.1145\/3576915.3616613","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3616613","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}