{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T16:12:20Z","timestamp":1786291940553,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["101002845"],"award-info":[{"award-number":["101002845"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690330","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"3125-3137","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["The LaZer Library: Lattice-Based Zero Knowledge and Succinct Proofs for Quantum-Safe Privacy"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5149-264X","authenticated-orcid":false,"given":"Vadim","family":"Lyubashevsky","sequence":"first","affiliation":[{"name":"IBM Research Europe, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5024-5123","authenticated-orcid":false,"given":"Gregor","family":"Seiler","sequence":"additional","affiliation":[{"name":"IBM Research Europe, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6760-5146","authenticated-orcid":false,"given":"Patrick","family":"Steuer","sequence":"additional","affiliation":[{"name":"IBM Research Europe, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CRYPTO (1) (Lecture Notes in Computer Science","author":"Aardal Marius A.","unstructured":"Marius A. Aardal, Diego F. Aranha, Katharina Boudgoust, Sebastian Kolby, and Akira Takahashi. 2024. Aggregating Falcon Signatures with LaBRADOR. In CRYPTO (1) (Lecture Notes in Computer Science, Vol. 14920). Springer, 71--106."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai. 1996. Generating Hard Instances of Lattice Problems (Extended Abstract). In STOC. 99--108.","DOI":"10.1145\/237814.237838"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Sven Argo Tim G\u00fcneysu Corentin Jeudy Georg Land Adeline Roux-Langlois and Olivier Sanders. 2024. Practical Post-Quantum Signatures for Privacy. IACR Cryptol. ePrint Arch. (2024) 131.","DOI":"10.1145\/3658644.3670297"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Carsten Baum Ivan Damg\u00e5rd Vadim Lyubashevsky Sabine Oechsner and Chris Peikert. 2018. More Efficient Commitments from Structured Lattice Assumptions. In SCN. 368--385.","DOI":"10.1007\/978-3-319-98113-0_20"},{"key":"e_1_3_2_1_6_1","first-page":"759","article-title":"Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings","volume":"2017","author":"Baum Carsten","year":"2017","unstructured":"Carsten Baum and Vadim Lyubashevsky. 2017. Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings. IACR Cryptology ePrint Archive, Vol. 2017 (2017), 759. http:\/\/eprint.iacr.org\/2017\/759","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_7_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. In EUROCRYPT (1) (Lecture Notes in Computer Science, Vol. 11476). Springer, 103--128."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Daniel J. Bernstein Andreas H\u00fclsing Stefan K\u00f6lbl Ruben Niederhagen Joost Rijneveld and Peter Schwabe. 2019. The SPHINCS(^mbox) Signature Framework. In CCS. ACM 2129--2146.","DOI":"10.1145\/3319535.3363229"},{"key":"e_1_3_2_1_9_1","volume-title":"CRYPTO (5) (Lecture Notes in Computer Science","author":"Beullens Ward","unstructured":"Ward Beullens and Gregor Seiler. 2023. LaBRADOR: Compact Proofs for R1CS from Module-SIS. In CRYPTO (5) (Lecture Notes in Computer Science, Vol. 14085). Springer, 518--548."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3474366.3486926"},{"key":"e_1_3_2_1_11_1","volume-title":"Ngoc Khanh Nguyen, and Alessandro Sorniotti","author":"Bootle Jonathan","year":"2023","unstructured":"Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Alessandro Sorniotti. 2023. A Framework for Practical Anonymous Credentials from Lattices. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 14082). Springer, 384--417."},{"key":"e_1_3_2_1_12_1","volume-title":"CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. In 2018 IEEE European Symposium on Security and Privacy, EuroS&P. 353--367","author":"Bos Joppe W.","year":"2018","unstructured":"Joppe W. Bos, L\u00e9o Ducas, Eike Kiltz, Tancr\u00e8de Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, and Damien Stehl\u00e9. 2018. CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM. In 2018 IEEE European Symposium on Security and Privacy, EuroS&P. 353--367."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2021.i2.159-188"},{"key":"e_1_3_2_1_14_1","unstructured":"Plonky3 Library Contributors. 2024. Plonky3. https:\/\/github.com\/Plonky3\/Plonky3."},{"key":"e_1_3_2_1_15_1","unstructured":"STARK Library Contributors. 2018. stark. https:\/\/github.com\/elibensasson\/libSTARK."},{"key":"e_1_3_2_1_16_1","unstructured":"Leo Ducas Tancrede Lepoint Vadim Lyubashevsky Peter Schwabe Gregor Seiler and Damien Stehle. 2017. CRYSTALS -- Dilithium: Digital Signatures from Module Lattices. Cryptology ePrint Archive Report 2017\/633. https:\/\/eprint.iacr.org\/eprint-bin\/getfile.pl?entry=2017\/633&version=20170627:201152&file=633.pdf."},{"key":"e_1_3_2_1_17_1","volume-title":"Financial Cryptography (2) (Lecture Notes in Computer Science","author":"Esgin Muhammed F.","unstructured":"Muhammed F. Esgin, Veronika Kuchta, Amin Sakzad, Ron Steinfeld, Zhenfei Zhang, Shifeng Sun, and Shumo Chu. 2021. Practical Post-quantum Few-Time Verifiable Random Function with Applications to Algorand. In Financial Cryptography (2) (Lecture Notes in Computer Science, Vol. 12675). Springer, 560--578."},{"key":"e_1_3_2_1_18_1","volume-title":"CRYPTO (5) (Lecture Notes in Computer Science","author":"Esgin Muhammed F.","unstructured":"Muhammed F. Esgin, Ron Steinfeld, Dongxi Liu, and Sushmita Ruj. 2023. Efficient Hybrid Exact\/Relaxed Lattice Proofs and Applications to Rounding and VRFs. In CRYPTO (5) (Lecture Notes in Computer Science, Vol. 14085). Springer, 484--517."},{"key":"e_1_3_2_1_19_1","volume-title":"Chipmunk: Better Synchronized Multi-Signatures from Lattices. In CCS. ACM, 386--400.","author":"Fleischhacker Nils","year":"2023","unstructured":"Nils Fleischhacker, Gottfried Herold, Mark Simkin, and Zhenfei Zhang. 2023. Chipmunk: Better Synchronized Multi-Signatures from Lattices. In CCS. ACM, 386--400."},{"key":"e_1_3_2_1_20_1","volume-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Paper 2019\/953. https:\/\/eprint.iacr.org\/2019\/953","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Paper 2019\/953. https:\/\/eprint.iacr.org\/2019\/953"},{"key":"e_1_3_2_1_21_1","volume-title":"Swoosh: Practical Lattice-Based Non-Interactive Key Exchange. IACR Cryptol. ePrint Arch.","author":"Gajland Phillip","year":"2023","unstructured":"Phillip Gajland, Bor de Kock, Miguel Quaresma, Giulio Malavolta, and Peter Schwabe. 2023. Swoosh: Practical Lattice-Based Non-Interactive Key Exchange. IACR Cryptol. ePrint Arch. (2023), 271."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_16"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Irakliy Khaburzaniya Konstantinos Chalkias Kevin Lewi and Harjasleen Malvai. 2022. Aggregating and Thresholdizing Hash-based Signatures using STARKs. In AsiaCCS. ACM 393--407.","DOI":"10.1145\/3488932.3524128"},{"key":"e_1_3_2_1_24_1","volume-title":"CRYPTO (5) (Lecture Notes in Computer Science","author":"Kim Duhyeong","unstructured":"Duhyeong Kim, Dongwon Lee, Jinyeong Seo, and Yongsoo Song. 2023. Toward Practical Lattice-Based Proof of Knowledge from Hint-MLWE. In CRYPTO (5) (Lecture Notes in Computer Science, Vol. 14085). Springer, 549--580."},{"key":"e_1_3_2_1_25_1","volume-title":"CRYPTO (2) (Lecture Notes in Computer Science","author":"Ling San","unstructured":"Beno^it Libert, San Ling, Khoa Nguyen, and Huaxiong Wang. 2018. Lattice-Based Zero-Knowledge Arguments for Integer Relations. In CRYPTO (2) (Lecture Notes in Computer Science, Vol. 10992). Springer, 700--732."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"San Ling Khoa Nguyen Damien Stehl\u00e9 and Huaxiong Wang. 2013. Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem and Applications. In PKC. 107--124.","DOI":"10.1007\/978-3-642-36362-7_8"},{"key":"e_1_3_2_1_27_1","first-page":"95","article-title":"BLOOM","volume":"13794","author":"Lyubashevsky Vadim","year":"2022","unstructured":"Vadim Lyubashevsky and Ngoc Khanh Nguyen. 2022. BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications. , Vol. 13794 (2022), 95--125.","journal-title":"Bimodal Lattice One-out-of-Many Proofs and Applications."},{"key":"e_1_3_2_1_28_1","volume-title":"Ngoc Khanh Nguyen, and Maxime Planccon","author":"Lyubashevsky Vadim","year":"2022","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Maxime Planccon. 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. https:\/\/eprint.iacr.org\/2022\/284 https:\/\/eprint.iacr.org\/2022\/284."},{"key":"e_1_3_2_1_29_1","volume-title":"Maxime Planccon, and Gregor Seiler.","author":"Lyubashevsky Vadim","year":"2021","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, Maxime Planccon, 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_30_1","volume-title":"CT-RSA (Lecture Notes in Computer Science","volume":"356","author":"Melchor Carlos Aguilar","year":"2016","unstructured":"Carlos Aguilar Melchor, Joris Barrier, Serge Guelton, Adrien Guinet, Marc-Olivier Killijian, and Tancr\u00e8de Lepoint. 2016. NFLlib: NTT-Based Fast Lattice Library. In CT-RSA (Lecture Notes in Computer Science, Vol. 9610). Springer, 341--356."},{"key":"e_1_3_2_1_31_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.."},{"key":"e_1_3_2_1_32_1","unstructured":"Armin Rigo and Maciej Fijalkowski. 2012--2018. CFFI documentation. https:\/\/cffi.readthedocs.io\/en\/latest\/index.html."},{"key":"e_1_3_2_1_33_1","volume-title":"1996--2021","author":"Shoup Victor","unstructured":"Victor Shoup. 1996--2021. NTL: A Library for doing Number Theory. https:\/\/libnt"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690330","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:15:01Z","timestamp":1755843301000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":33,"alternative-id":["10.1145\/3658644.3690330","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690330","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}