{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T04:43:20Z","timestamp":1780634600175,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560646","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"3121-3134","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Caulk"],"prefix":"10.1145","author":[{"given":"Arantxa","family":"Zapico","sequence":"first","affiliation":[{"name":"Universitat Pompeu Fabra, Barcelona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vitalik","family":"Buterin","sequence":"additional","affiliation":[{"name":"Ethereum Foundation, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmitry","family":"Khovratovich","sequence":"additional","affiliation":[{"name":"Ethereum Foundation, Luxembourg, Luxembourg"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mary","family":"Maller","sequence":"additional","affiliation":[{"name":"Ethereum Foundation, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anca","family":"Nitulescu","sequence":"additional","affiliation":[{"name":"Protocol Labs, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[{"name":"Ethereum Foundation, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"191","volume-title":"MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT 2016","volume":"10031","author":"Albrecht M. R.","year":"2016","unstructured":"M. R. Albrecht , L. Grassi , C. Rechberger , A. Roy , and T. Tiessen . MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT 2016 , volume 10031 of LNCS, pages 191 -- 219 , 2016 . M. R. Albrecht, L. Grassi, C. Rechberger, A. Roy, and T. Tiessen. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT 2016, volume 10031 of LNCS, pages 191--219, 2016."},{"key":"e_1_3_2_1_2_1","volume-title":"arkworks zksnark ecosystem","year":"2022","unstructured":"arkworks contributors. arkworks zksnark ecosystem , 2022 . arkworks contributors. arkworks zksnark ecosystem, 2022."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_38"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-64322-8_19"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24174-6_13"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"J.\n      Bootle\n     and \n      J.\n      Groth\n  . \n  Efficient batch zero-knowledge arguments for low degree polynomials\n  . In M. Abdalla and R. Dahab editors Public-Key Cryptography - PKC \n  2018\n   - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography Rio de Janeiro Brazil March 25--29 2018 Proceedings Part II volume \n  10770\n   of \n  Lecture Notes in Computer Science pages \n  561\n  --\n  588\n  . \n  Springer 2018.  J. Bootle and J. Groth. Efficient batch zero-knowledge arguments for low degree polynomials. In M. Abdalla and R. Dahab editors Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography Rio de Janeiro Brazil March 25--29 2018 Proceedings Part II volume 10770 of Lecture Notes in Computer Science pages 561--588. Springer 2018.","DOI":"10.1007\/978-3-319-76581-5_19"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_15"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_5"},{"key":"e_1_3_2_1_11_1","volume-title":"Succinct zeroknowledge batch proofs for set accumulators. IACR Cryptol. ePrint Arch., page 1672","author":"Campanelli M.","year":"2021","unstructured":"M. Campanelli , D. Fiore , S. Han , J. Kim , D. Kolonelos , and H. Oh . Succinct zeroknowledge batch proofs for set accumulators. IACR Cryptol. ePrint Arch., page 1672 , 2021 . M. Campanelli, D. Fiore, S. Han, J. Kim, D. Kolonelos, and H. Oh. Succinct zeroknowledge batch proofs for set accumulators. IACR Cryptol. ePrint Arch., page 1672, 2021."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_1_13_1","unstructured":"D. Feist and D. Khovratovich. Fast amortized kate proofs.  D. Feist and D. Khovratovich. Fast amortized kate proofs."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"G.\n      Fuchsbauer E.\n      Kiltz and \n      J.\n      Loss\n  . \n  The algebraic group model and its applications\n  . In H. Shacham and A. Boldyreva editors CRYPTO \n  2018 Santa Barbara CA USA August 19--23 2018 Proceedings Part II volume \n  10992\n   of \n  LNCS pages \n  33\n  --\n  62\n  . \n  Springer 2018.  G. Fuchsbauer E. Kiltz and J. Loss. The algebraic group model and its applications. In H. Shacham and A. Boldyreva editors CRYPTO 2018 Santa Barbara CA USA August 19--23 2018 Proceedings Part II volume 10992 of LNCS pages 33--62. Springer 2018.","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"e_1_3_2_1_15_1","first-page":"953","author":"Gabizon A.","year":"2019","unstructured":"A. Gabizon and Z. J. Williamson . Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. IACR Cryptol. ePrint Arch., page 953 , 2019 . A. Gabizon and Z. J. Williamson. Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. IACR Cryptol. ePrint Arch., page 953, 2019.","journal-title":"IACR Cryptol. ePrint Arch., page"},{"key":"e_1_3_2_1_16_1","volume-title":"plookup: A simplified polynomial protocol for lookup tables. IACR Cryptol. ePrint Arch., page 315","author":"Gabizon A.","year":"2020","unstructured":"A. Gabizon and Z. J. Williamson . plookup: A simplified polynomial protocol for lookup tables. IACR Cryptol. ePrint Arch., page 315 , 2020 . A. Gabizon and Z. J. Williamson. plookup: A simplified polynomial protocol for lookup tables. IACR Cryptol. ePrint Arch., page 315, 2020."},{"key":"e_1_3_2_1_17_1","first-page":"343","author":"Ghadafi E.","year":"2017","unstructured":"E. Ghadafi and J. Groth . Towards a classification of non-interactive computational assumptions in cyclic groups. IACR Cryptol. ePrint Arch., page 343 , 2017 . E. Ghadafi and J. Groth. Towards a classification of non-interactive computational assumptions in cyclic groups. IACR Cryptol. ePrint Arch., page 343, 2017.","journal-title":"IACR Cryptol. ePrint Arch., page"},{"key":"e_1_3_2_1_18_1","first-page":"2021","author":"Grassi L.","year":"2021","unstructured":"L. Grassi , D. Khovratovich , A. Roy , C. Rechberger , and M. Schofnegger . Poseidon: A new hash function for zero-knowledge proof systems. Usenix Security 2021 , 2021 . L. Grassi, D. Khovratovich, A. Roy, C. Rechberger, and M. Schofnegger. Poseidon: A new hash function for zero-knowledge proof systems. Usenix Security 2021, 2021.","journal-title":"Usenix Security"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_9"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02384-2_17"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.34"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"e_1_3_2_1_26_1","volume-title":"Plonkup: Reconciling plonk with plookup. IACR Cryptol. ePrint Arch., page 86","author":"Pearson L.","year":"2022","unstructured":"L. Pearson , J. Fitzgerald , H. Masip , M. Bell\u00e9s-Mu\u00f1oz , and J. L. Mu\u00f1oz-Tapia . Plonkup: Reconciling plonk with plookup. IACR Cryptol. ePrint Arch., page 86 , 2022 . L. Pearson, J. Fitzgerald, H. Masip, M. Bell\u00e9s-Mu\u00f1oz, and J. L. Mu\u00f1oz-Tapia. Plonkup: Reconciling plonk with plookup. IACR Cryptol. ePrint Arch., page 86, 2022."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"e_1_3_2_1_28_1","unstructured":"Tornado cash privacy solution version 1.4 2021. https:\/\/tornado.cash\/Tornado. cash_whitepaper_v1.4.pdf.  Tornado cash privacy solution version 1.4 2021. https:\/\/tornado.cash\/Tornado. cash_whitepaper_v1.4.pdf."},{"key":"e_1_3_2_1_29_1","unstructured":"ZCash protocol specification 2022 1st February. https:\/\/github.com\/zcash\/zips\/ blob\/master\/protocol\/protocol.pdf.  ZCash protocol specification 2022 1st February. https:\/\/github.com\/zcash\/zips\/ blob\/master\/protocol\/protocol.pdf."},{"key":"e_1_3_2_1_30_1","unstructured":"Zksync rollup protocol 2021. https:\/\/github.com\/matter-labs\/zksync\/blob\/ master\/docs\/protocol.md.  Zksync rollup protocol 2021. https:\/\/github.com\/matter-labs\/zksync\/blob\/ master\/docs\/protocol.md."}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560646","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560646"}},"subtitle":["Lookup Arguments in Sublinear Time"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":30,"alternative-id":["10.1145\/3548606.3560646","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560646","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}