{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:29:14Z","timestamp":1778128154956,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":53,"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":[{"DOI":"10.13039\/501100006374","name":"Australian Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670345","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"3167-3181","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["LUNA: Quasi-Optimally Succinct Designated-Verifier Zero-Knowledge Arguments from Lattices"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1745-4183","authenticated-orcid":false,"given":"Ron","family":"Steinfeld","sequence":"first","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4569-3384","authenticated-orcid":false,"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1650-3748","authenticated-orcid":false,"given":"Muhammed F.","family":"Esgin","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7724-2601","authenticated-orcid":false,"given":"Veronika","family":"Kuchta","sequence":"additional","affiliation":[{"name":"Florida Atlantic University, Boca Raton, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7328-9501","authenticated-orcid":false,"given":"Mert","family":"Yassi","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1257-9147","authenticated-orcid":false,"given":"Raymond K.","family":"Zhao","sequence":"additional","affiliation":[{"name":"CSIRO's Data61, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42033-7_6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815111.2815158"},{"key":"e_1_3_2_1_3_1","volume-title":"CRYPTO (2) (LNCS","author":"Albrecht Martin R.","unstructured":"Martin R. Albrecht, Valerio Cini, Russell W. F. Lai, Giulio Malavolta, and Sri Aravinda Krishnan Thyagarajan. 2022. Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract). In CRYPTO (2) (LNCS, Vol. 13508). Springer, 102--132."},{"key":"e_1_3_2_1_4_1","volume-title":"SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. Cryptology ePrint Archive, Paper 2023\/1469.","author":"Albrecht Martin R.","year":"2022","unstructured":"Martin R. Albrecht, Giacomo Fenzi, Oleksandra Lapiha, and Ngoc Khanh Nguyen. 2022. SLAP: Succinct Lattice-Based Polynomial Commitments from Standard Assumptions. Cryptology ePrint Archive, Paper 2023\/1469."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Shahla Atapoor Karim Baghery Hilder V. L. Pereira and Jannik Spiessens. 2024. Verifiable FHE via Lattice-based SNARKs. Cryptology ePrint Archive Paper 2024\/032. https:\/\/eprint.iacr.org\/2024\/032","DOI":"10.62056\/a6ksdkp10"},{"key":"e_1_3_2_1_8_1","first-page":"46","article-title":"Scalable, transparent, and post-quantum secure computational integrity","volume":"2018","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptology ePrint Archive, Vol. 2018 (2018), 46. http:\/\/eprint.iacr.org\/2018\/046","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_9_1","volume-title":"Zerocash: Decentralized Anonymous Payments from Bitcoin","author":"Ben-Sasson Eli","year":"2014","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, and Madars Virza. 2014. Zerocash: Decentralized Anonymous Payments from Bitcoin. In IEEE S&P 2014. IEEE Computer Society, 459--474."},{"key":"e_1_3_2_1_10_1","volume-title":"EUROCRYPT","volume":"11476","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 2019, Vol. 11476. 103--128."},{"key":"e_1_3_2_1_11_1","first-page":"1","article-title":"DEEP-FRI: Sampling Outside the Box Improves Soundness. In ITCS (LIPIcs, Vol. 151)","volume":"5","author":"Ben-Sasson Eli","year":"2020","unstructured":"Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, and Shubhangi Saraf. 2020. DEEP-FRI: Sampling Outside the Box Improves Soundness. In ITCS (LIPIcs, Vol. 151). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 5:1--5:32.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_12_1","volume-title":"CRYPTO (5) (LNCS","author":"Beullens Ward","unstructured":"Ward Beullens and Gregor Seiler. 2023. LaBRADOR: Compact Proofs for R1CS from Module-SIS. In CRYPTO (5) (LNCS, Vol. 14085). Springer, 518--548."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--36594--2_18"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--56617--7_9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78372--7_8"},{"key":"e_1_3_2_1_16_1","volume-title":"CRYPTO (2) (LNCS","author":"Bootle Jonathan","unstructured":"Jonathan Bootle, Alessandro Chiesa, and Katerina Sotiraki. 2023. Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification. In CRYPTO (2) (LNCS, Vol. 14082). Springer, 227--251."},{"key":"e_1_3_2_1_17_1","volume-title":"Ngoc Khanh Nguyen, and Gregor Seiler","author":"Bootle Jonathan","year":"2020","unstructured":"Jonathan Bootle, Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Gregor Seiler. 2020. A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. In CRYPTO (2) (LNCS, Vol. 12171). Springer, 441--469."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"e_1_3_2_1_19_1","unstructured":"Florian Bourse and Malika Izabach\u00e8ne. 2022. Plug-and-play sanitization for TFHE. Cryptology ePrint Archive Paper 2022\/1438. https:\/\/eprint.iacr.org\/2022\/1438"},{"key":"e_1_3_2_1_20_1","first-page":"62","article-title":"FHE Circuit Privacy Almost for Free","volume":"9815","author":"Bourse Florian","year":"2016","unstructured":"Florian Bourse, Rafa\u00ebl Del Pino, Michele Minelli, and Hoeteck Wee. 2016. FHE Circuit Privacy Almost for Free. In CRYPTO, Vol. 9815. 62--89.","journal-title":"CRYPTO"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1090\/mcom\/3363"},{"key":"e_1_3_2_1_23_1","volume-title":"TCC (3) (LNCS","author":"B\u00fcnz Benedikt","unstructured":"Benedikt B\u00fcnz and Ben Fisch. 2023. Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct Arguments. In TCC (3) (LNCS, Vol. 14371). Springer, 394--423."},{"key":"e_1_3_2_1_24_1","volume-title":"CRYPTO (2) (LNCS","author":"Cini Valerio","unstructured":"Valerio Cini, Russell W. F. Lai, and Giulio Malavolta. 2023. Lattice-Based Succinct Arguments from Vanishing Polynomials - (Extended Abstract). In CRYPTO (2) (LNCS, Vol. 14082). Springer, 72--105."},{"key":"e_1_3_2_1_25_1","unstructured":"PALISADE Contributors. 2023. PALISADE Homomorphic Addition Software Library. https:\/\/palisade-crypto.org\/"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00007"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Thomas Debris-Alazard Pouria Fallahpour and Damien Stehl\u00e9. 2024. Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs. Cryptology ePrint Archive Paper 2024\/030.","DOI":"10.1145\/3618260.3649766"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--24676--3_31"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--49890--3_12"},{"key":"e_1_3_2_1_30_1","volume-title":"CRYPTO (5) (LNCS","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) (LNCS, Vol. 14085). Springer, 484--517."},{"key":"e_1_3_2_1_31_1","volume-title":"CRYPTO (1) (LNCS","author":"Esgin Muhammed F.","unstructured":"Muhammed F. Esgin, Ron Steinfeld, Joseph K. Liu, and Dongxi Liu. 2019. Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications. In CRYPTO (1) (LNCS, Vol. 11692). Springer, 115--146."},{"key":"e_1_3_2_1_32_1","unstructured":"Giacomo Fenzi Hossein Moghaddas and Ngoc Khanh Nguyen. 2023. Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency. Cryptology ePrint Archive Paper 2023\/846. https:\/\/eprint.iacr.org\/2023\/846"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243845"},{"key":"e_1_3_2_1_34_1","volume-title":"A fully homomorphic encryption scheme. Ph.,D. Dissertation","author":"Gentry Craig","unstructured":"Craig Gentry. 2009. A fully homomorphic encryption scheme. Ph.,D. Dissertation. Stanford University, USA. https:\/\/searchworks.stanford.edu\/view\/8493082"},{"key":"e_1_3_2_1_35_1","volume-title":"EUROCRYPT (1)","author":"Gentry Craig","unstructured":"Craig Gentry, Shai Halevi, and Vadim Lyubashevsky. 2022. Practical Non-interactive Publicly Verifiable Secret Sharing with Thousands of Parties. In EUROCRYPT (1), Vol. 13275. 458--487."},{"key":"e_1_3_2_1_36_1","volume-title":"Attribute-Based. In CRYPTO","volume":"8042","author":"Gentry Craig","year":"2013","unstructured":"Craig Gentry, Amit Sahai, and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based. In CRYPTO 2013, Vol. 8042. 75--92."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_38_1","volume-title":"On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT","volume":"9666","author":"Groth Jens","year":"2016","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT 2016, Vol. 9666. 305--326."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484572"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_41_1","unstructured":"Kamil Kluczniak. 2022. Circuit Privacy for FHEW\/TFHE-Style Fully Homomorphic Encryption in Practice. Cryptology ePrint Archive Paper 2022\/1459."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_1_43_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) (LNCS, Vol. 13508). Springer, 71--101."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447360"},{"key":"e_1_3_2_1_46_1","volume-title":"On the Non-existence of Short Vectors in Random Module Lattices. In ASIACRYPT","volume":"11922","author":"Nguyen Ngoc Khanh","year":"2019","unstructured":"Ngoc Khanh Nguyen. 2019. On the Non-existence of Short Vectors in Random Module Lattices. In ASIACRYPT 2019, Vol. 11922. 121--150."},{"key":"e_1_3_2_1_47_1","volume-title":"Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits. In LATINCRYPT","volume":"11774","author":"Nitulescu Anca","year":"2019","unstructured":"Anca Nitulescu. 2019. Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits. In LATINCRYPT 2019, Vol. 11774. 217--236."},{"key":"e_1_3_2_1_48_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In IEEE S&P. 238--252."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TETC.2021.3073475"},{"key":"e_1_3_2_1_50_1","volume-title":"EUROCRYPT (1)","author":"Rosca Miruna","unstructured":"Miruna Rosca, Damien Stehl\u00e9, and Alexandre Wallet. 2018. On the Ring-LWE and Polynomial-LWE Problems. In EUROCRYPT (1), Vol. 10820. 146--173."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_4"},{"key":"e_1_3_2_1_52_1","volume-title":"Zhao","author":"Steinfeld Ron","year":"2022","unstructured":"Ron Steinfeld, Amin Sakzad, Muhammed F. Esgin, Veronika Kuchta, Mert Yassi, and Raymond K. Zhao. 2022. LUNA: Quasi-Optimally Succinct Designated-Verifier Zero-Knowledge Arguments from Lattices. Cryptology ePrint Archive, Paper 2022\/1690. https:\/\/eprint.iacr.org\/2022\/1690"},{"key":"e_1_3_2_1_53_1","volume-title":"Wu","author":"Wee Hoeteck","year":"2023","unstructured":"Hoeteck Wee and David J. Wu. 2023. Lattice-Based Functional Commitments: Fast Verification and Cryptanalysis. In ASIACRYPT (5) (LNCS, Vol. 14442). Springer, 201--235."}],"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.3670345","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:57:43Z","timestamp":1755842263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":53,"alternative-id":["10.1145\/3658644.3670345","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670345","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"}}]}}