{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:42Z","timestamp":1765113042716,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":32,"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":"IBM Global University Program Academic Award"},{"name":"Rising Star Award, Intel Corporation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690219","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"884-898","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2909-9177","authenticated-orcid":false,"given":"Chaya","family":"Ganesh","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bengaluru, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9542-038X","authenticated-orcid":false,"given":"Vineet","family":"Nair","sequence":"additional","affiliation":[{"name":"Arithmic Labs, Bengaluru, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2539-7446","authenticated-orcid":false,"given":"Ashish","family":"Sharma","sequence":"additional","affiliation":[{"name":"Arithmic Labs, Bengaluru, India"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","unstructured":"Masayuki Abe Georg Fuchsbauer Jens Groth Kristiyan Haralambiev and Miyako Ohkubo. 2010. Structure-Preserving Signatures and Commitments to Group Elements. 209--236. https:\/\/doi.org\/10.1007\/978--3--642--14623--7_12","DOI":"10.1007\/978--3--642--14623--7_12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--97121--2_21"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--58751--1_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030-03326--2_20"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031-07085--3_15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--92078--4_1"},{"key":"e_1_3_2_1_7_1","unstructured":"Matteo Campanelli Dario Fiore and Rosario Gennaro. 2024. Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them. Cryptology ePrint Archive Paper 2024\/1058. https:\/\/eprint.iacr.org\/2024\/1058 https:\/\/eprint.iacr.org\/2024\/1058."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Matteo Campanelli Dario Fiore and Ana\u00efs Querol. 2019. LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs. 2075--2092. https:\/\/doi.org\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_1_9_1","unstructured":"Liam Eagen Dario Fiore and Ariel Gabizon. 2022. cq: Cached quotients for fast lookups. Cryptology ePrint Archive Paper 2022\/1763. https:\/\/eprint.iacr.org\/2022\/1763 https:\/\/eprint.iacr.org\/2022\/1763."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Amos Fiat and Adi Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. 186--194. https:\/\/doi.org\/10.1007\/3--540--47721--7_12","DOI":"10.1007\/3--540--47721--7_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"Georg Fuchsbauer Eike Kiltz and Julian Loss. 2018. The Algebraic Group Model and its Applications. 33--62. https:\/\/doi.org\/10.1007\/978--3--319--96881-0_2","DOI":"10.1007\/978--3--319--96881-0_2"},{"key":"e_1_3_2_1_12_1","volume":"202","author":"Gabizon Ariel","unstructured":"Ariel Gabizon and Zachary J. Williamson. 2020. plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Paper 2020\/315. https:\/\/eprint.iacr.org\/2020\/315 https:\/\/eprint.iacr.org\/2020\/315.","journal-title":"Zachary J. Williamson."},{"key":"e_1_3_2_1_13_1","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 https:\/\/eprint.iacr.org\/2019\/953."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Chaya Ganesh Vineet Nair and Ashish Sharma. 2024. Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs. Cryptology ePrint Archive Paper 2024\/943. https:\/\/eprint.iacr.org\/2024\/943","DOI":"10.1145\/3658644.3690219"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Shafi Goldwasser Silvio Micali and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). 291--304. https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. 305--326. https:\/\/doi.org\/10.1007\/978--3--662--49896--5_11","DOI":"10.1007\/978--3--662--49896--5_11"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"Jens Groth Markulf Kohlweiss Mary Maller Sarah Meiklejohn and Ian Miers. 2018. Updatable and Universal Common Reference Strings with Applications to zk-SNARKs. 698--728. https:\/\/doi.org\/10.1007\/978--3--319--96878-0_24","DOI":"10.1007\/978--3--319--96878-0_24"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Aniket Kate Gregory M. Zaverucha and Ian Goldberg. 2010. Constant-Size Commitments to Polynomials and Their Applications. 177--194. https:\/\/doi.org\/10.1007\/978--3--642--17373--8_11","DOI":"10.1007\/978--3--642--17373--8_11"},{"key":"e_1_3_2_1_20_1","unstructured":"Tohru Kohrita and Patrick Towa. 2023. Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments. Cryptology ePrint Archive Paper 2023\/917. https:\/\/eprint.iacr.org\/2023\/917 https:\/\/eprint.iacr.org\/2023\/917."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--15985--5_13"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--90453--1_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","unstructured":"Charalampos Papamanthou Elaine Shi and Roberto Tamassia. 2013. Signatures of Correct Computation. 222--242. https:\/\/doi.org\/10.1007\/978--3--642--36594--2_13","DOI":"10.1007\/978--3--642--36594--2_13"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--56877--1_25"},{"key":"e_1_3_2_1_26_1","volume-title":"Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Paper 2020\/1275. https:\/\/eprint.iacr.org\/2020\/1275 https:\/\/eprint.iacr.org\/2020\/1275.","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty and Jonathan Lee. 2020. Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Paper 2020\/1275. https:\/\/eprint.iacr.org\/2020\/1275 https:\/\/eprint.iacr.org\/2020\/1275."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--58751--1_7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","unstructured":"Justin Thaler. 2013. Time-Optimal Interactive Proofs for Circuit Evaluation. 71--89. https:\/\/doi.org\/10.1007\/978--3--642--40084--1_5","DOI":"10.1007\/978--3--642--40084--1_5"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_1_30_1","unstructured":"Barry Whitehat. [n. d.]. Lookup singularity. ( [n. d.]). https:\/\/zkresear.ch\/t\/lookup-singularity\/65\/7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560646"},{"key":"e_1_3_2_1_32_1","volume-title":"Baloo: Nearly Optimal Lookup Arguments. Cryptology ePrint Archive, Paper 2022\/1565. https:\/\/eprint.iacr.org\/2022\/1565.","author":"Zapico Arantxa","year":"2022","unstructured":"Arantxa Zapico, Ariel Gabizon, Dmitry Khovratovich, Mary Maller, and Carla R\u00e0fols. 2022. Baloo: Nearly Optimal Lookup Arguments. Cryptology ePrint Archive, Paper 2022\/1565. https:\/\/eprint.iacr.org\/2022\/1565."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Salt Lake City UT USA","acronym":"CCS '24"},"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.3690219","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:11:07Z","timestamp":1755843067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":32,"alternative-id":["10.1145\/3658644.3690219","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690219","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"}}]}}