{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T08:41:30Z","timestamp":1780044090283,"version":"3.53.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00145-024-09535-0","type":"journal-article","created":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T18:55:52Z","timestamp":1736448952000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them"],"prefix":"10.1007","volume":"38","author":[{"given":"Matteo","family":"Campanelli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,9]]},"reference":[{"key":"9535_CR1","doi-asserted-by":"crossref","unstructured":"D.F. Aranha, E.\u00a0Madsen Bennedsen, M. Campanelli, C. Ganesh, C. Orlandi, A. Takahashi, ECLIPSE: Enhanced compiling method for pedersen-committed zkSNARK engines. In G. Hanaoka, J. Shikata, Y. Watanabe, editors, PKC\u00a02022, Part\u00a0I, volume 13177 of LNCS, (Springer, Cham, 2022) pp 584\u2013614","DOI":"10.1007\/978-3-030-97121-2_21"},{"key":"9535_CR2","doi-asserted-by":"crossref","unstructured":"S. Agrawal, C. Ganesh, P. Mohassel, Non-interactive zero-knowledge proofs for composite statements. In H. Shacham, A. Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0III, volume 10993 of LNCS, (Springer, Cham, August 2018) pp 643\u2013673","DOI":"10.1007\/978-3-319-96878-0_22"},{"key":"9535_CR3","doi-asserted-by":"crossref","unstructured":"A. Arun, S.T.V. Setty, J. Thaler, Jolt: SNARKs for virtual machines via lookups. In M. Joye, G. Leander, editors, EUROCRYPT\u00a02024, Part\u00a0VI, volume 14656 of LNCS, (Springer, Cham, 2024) pp 3\u201333","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"9535_CR4","doi-asserted-by":"crossref","unstructured":"D. Boneh, B. B\u00fcnz, B. Fisch, Batching techniques for accumulators with applications to IOPs and stateless blockchains. In A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0I, volume 11692 of LNCS, (Springer, Cham, 2019) pp 561\u2013586","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"9535_CR5","doi-asserted-by":"crossref","unstructured":"D. Benarroch, M. Campanelli, D. Fiore, K. Gurkan, D. Kolonelos, Zero-knowledge proofs for set membership: Efficient, succinct, modular. In N. Borisov, C. D\u00edaz, editors, FC 2021, Part\u00a0I, volume 12674 of LNCS, (Springer, Berlin, Heidelberg, 2021) pp 393\u2013414","DOI":"10.1007\/978-3-662-64322-8_19"},{"key":"9535_CR6","doi-asserted-by":"crossref","unstructured":"J. Bootle, A. Cerulli, J. Groth, S.K. Jakobsen, M. Maller. Arya: Nearly linear-time zero-knowledge proofs for correct program execution. In T. Peyrin, S. Galbraith, editors, ASIACRYPT\u00a02018, Part\u00a0I, volume 11272 of LNCS, (Springer, Cham, 2018) pp 595\u2013626","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"9535_CR7","doi-asserted-by":"crossref","unstructured":"J. Bootle, A. Chiesa, Y. Hu, M. Orr\u00f9, Gemini: Elastic SNARKs for diverse environments. In O. Dunkelman, S. Dziembowski, editors, EUROCRYPT\u00a02022, Part\u00a0II, volume 13276 of LNCS, (Springer, Cham, 2022) pp427\u2013457","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"9535_CR8","doi-asserted-by":"crossref","unstructured":"E. Ben-Sasson, A. Chiesa, M. Riabzev, N. Spooner, M. Virza, N.P. Ward, Aurora: Transparent succinct arguments for R1CS. In Y. Ishai, V. Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0I, volume 11476 of LNCS, (Springer, Cham, 2019) pp 103\u2013128","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"9535_CR9","doi-asserted-by":"crossref","unstructured":"B. B\u00fcnz, B. Fisch, A. Szepieniec. Transparent SNARKs from DARK compilers. In A. Canteaut, Y. Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, (Springer, Cham, 2020) pp 677\u2013706","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"9535_CR10","doi-asserted-by":"crossref","unstructured":"B. B\u00fcnz, M. Maller, P. Mishra, N. Tyagi, P. Vesely. Proofs for inner pairing products and applications. In M. Tibouchi, H. Wang, editors, ASIACRYPT\u00a02021, Part\u00a0III, volume 13092 of LNCS, (Springer, Cham, 2021) pp 65\u201397","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"9535_CR11","doi-asserted-by":"crossref","unstructured":"B. Chen, B. B\u00fcnz, D. Boneh, Z. Zhang. HyperPlonk: Plonk with linear-time prover and high-degree custom gates. In C. Hazay, M. Stam, editors, EUROCRYPT\u00a02023, Part\u00a0II, volume 14005 of LNCS, (Springer, Cham, 2023) pp 499\u2013530","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"9535_CR12","doi-asserted-by":"crossref","unstructured":"M. Campanelli, F. Engelmann, C. Orlandi. Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers. In C. Galdi, S. Jarecki, editors, SCN 22, volume 13409, (Springer, Cham, 2022) pp 761\u2013784","DOI":"10.1007\/978-3-031-14791-3_33"},{"key":"9535_CR13","doi-asserted-by":"crossref","unstructured":"M. Campanelli, . Faonio, D. Fiore, A. Querol, H. Rodr\u00edguez, Lunar: A toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions. In M. Tibouchi, H. Wang, editors, ASIACRYPT\u00a02021, Part\u00a0III, volume 13092 of LNCS, (Springer, Cham, 2021) pp 3\u201333","DOI":"10.1007\/978-3-030-92078-4_1"},{"key":"9535_CR14","doi-asserted-by":"crossref","unstructured":"M. Campanelli, A. Faonio, D. Fiore, T. Li, H. Lipmaa, Lookup arguments: Improvements, extensions and applications to zero-knowledge decision trees. In Q. Tang, V. Teague, editors, PKC\u00a02024, Part\u00a0II, volume 14602 of LNCS, (Springer, Cham, 2024) pp 337\u2013369","DOI":"10.1007\/978-3-031-57722-2_11"},{"key":"9535_CR15","doi-asserted-by":"crossref","unstructured":"M. Campanelli, D. Fiore, S. Han, J. Kim, D. Kolonelos, H. Oh. Succinct zero-knowledge batch proofs for set accumulators. In H. Yin, A. Stavrou, C. Cremers, E. Shi, editors, ACM CCS 2022, (ACM Press, 2022) pp 455\u2013469","DOI":"10.1145\/3548606.3560677"},{"key":"9535_CR16","doi-asserted-by":"crossref","unstructured":"M. Campanelli, D. Fiore, A. Querol, LegoSNARK: Modular design and composition of succinct zero-knowledge proofs. In L. Cavallaro, J. Kinder, X. Wang, J. Katz, editors, ACM CCS 2019, (ACM Press, 2019) pp 2075\u20132092","DOI":"10.1145\/3319535.3339820"},{"key":"9535_CR17","unstructured":"M. Campanelli, A. Faonio, L. Russo, SNARKs for virtual machines are non-malleable. Cryptology ePrint Archive, Paper 2024\/1551 (2024)"},{"key":"9535_CR18","doi-asserted-by":"crossref","unstructured":"M. Campanelli, N. Gailly, R. Gennaro, P. Jovanovic, M. Mihali, J. Thaler, Testudo: Linear time prover snarks with constant size proofs and square root size universal setup, in International Conference on Cryptology and Information Security in Latin America, (Springer, 2023) pp 331\u2013351","DOI":"10.1007\/978-3-031-44469-2_17"},{"key":"9535_CR19","doi-asserted-by":"crossref","unstructured":"M. Campanelli, M. Hall-Andersen, Veksel: Simple, efficient, anonymous payments with large anonymity sets from well-studied assumptions. In Y. Suga, K. Sakurai, X. Ding, K. Sako, editors, ASIACCS 22, (ACM Press, 2022) pp 652\u2013666","DOI":"10.1145\/3488932.3517424"},{"key":"9535_CR20","unstructured":"M. Campanelli, M. Hall-Andersen, S.H. Kamp, Curve trees: Practical and transparent $$\\{$$Zero-Knowledge$$\\}$$ accumulators. In 32nd USENIX Security Symposium (USENIX Security 23) (2023) pp 4391\u20134408"},{"key":"9535_CR21","unstructured":"M. Campanelli, M. Hall-Andersen, S.H. Kamp, Curve forests: Transparent zero-knowledge set membership with batching and strong security. Cryptology ePrint Archive, Paper 2024\/1647 (2024)"},{"key":"9535_CR22","unstructured":"H. Chung, K. Han, C. Ju, M. Kim, J.H. Seo, Bulletproofs+: Shorter proofs for privacy-enhanced distributed ledger. Cryptology ePrint Archive, Report 2020\/735 (2020)"},{"key":"9535_CR23","doi-asserted-by":"crossref","unstructured":"A. Chiesa, Y. Hu, M. Maller, P. Mishra, P. Vesely, N.P. Ward, Marlin: Preprocessing zkSNARKs with universal and updatable SRS. In A. Canteaut, Y. Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, volume 12105 of LNCS, (Springer, Cham, 2020) pp 738\u2013768","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"9535_CR24","unstructured":"L. Eagen, D. Fiore, A. Gabizon, cq: Cached quotients for fast lookups. Cryptology ePrint Archive, Report 2022\/1763 (2022)"},{"key":"9535_CR25","doi-asserted-by":"crossref","unstructured":"L. Eagen, S. Kanjalkar, T. Ruffing, J. Nick, Bulletproofs++: Next generation confidential transactions via reciprocal set membership arguments. In M. Joye, G. Leander, editors, EUROCRYPT\u00a02024, Part\u00a0V, volume 14655 of LNCS, (Springer, Cham, 2024) pp 249\u2013279","DOI":"10.1007\/978-3-031-58740-5_9"},{"key":"9535_CR26","unstructured":"D. Feist, D. Khovratovich, Fast amortized KZG proofs. Cryptology ePrint Archive, Paper 2023\/033 (2023)"},{"key":"9535_CR27","doi-asserted-by":"crossref","unstructured":"G. Fuchsbauer, E. Kiltz, J. Loss, The algebraic group model and its applications. In H. Shacham, A. Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0II, volume 10992 of LNCS, (Springer, Cham, 2018) pp 33\u201362","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"9535_CR28","doi-asserted-by":"crossref","unstructured":"D. Fiore, I. Tucker, Efficient zero-knowledge proofs on signed data with applications to verifiable computation on data streams. In H. Yin, A. Stavrou, C. Cremers, E. Shi, editors, ACM CCS 2022, (ACM Press, 2022) pp 1067\u20131080","DOI":"10.1145\/3548606.3560630"},{"key":"9535_CR29","unstructured":"A. Gabizon, D. Khovratovich, flookup: Fractional decomposition-based lookups in quasi-linear time independent of table size. Cryptology ePrint Archive, Report 2022\/1447 (2022)"},{"key":"9535_CR30","doi-asserted-by":"crossref","unstructured":"J. Groth, M. Kohlweiss, M. Maller, S. Meiklejohn, I. Miers, Updatable and universal common reference strings with applications to zk-SNARKs. In H. Shacham, A. Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0III, volume 10993 of LNCS, (Springer, Cham, 2018) pp 698\u2013728","DOI":"10.1007\/978-3-319-96878-0_24"},{"key":"9535_CR31","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y.T. Kalai, G.N. Rothblum. Delegating computation: interactive proofs for muggles. In Richard\u00a0E. Ladner and Cynthia Dwork, editors, 40th ACM STOC, (ACM Press, 2008) pp 113\u2013122","DOI":"10.1145\/1374376.1374396"},{"key":"9535_CR32","doi-asserted-by":"crossref","unstructured":"A. Golovnev, J. Lee, S.T.V. Setty, J. Thaler, R.S. Wahby. Brakedown: Linear-time and field-agnostic SNARKs for R1CS. In H. Handschuh and A. Lysyanskaya, editors, CRYPTO\u00a02023, Part\u00a0II, volume 14082 of LNCS,(Springer, Cham, 2023) pp 193\u2013226","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"9535_CR33","doi-asserted-by":"crossref","unstructured":"C. Ganesh, V. Nair, A. Sharma, Dual polynomial commitment schemes and applications to commit-and-prove SNARKs. Cryptology ePrint Archive, Paper 2024\/943, (2024) https:\/\/eprint.iacr.org\/2024\/943","DOI":"10.1145\/3658644.3690219"},{"key":"9535_CR34","doi-asserted-by":"crossref","unstructured":"J. Groth, On the size of pairing-based non-interactive arguments. In Marc Fischlin and Jean-S\u00e9bastien Coron, editors, EUROCRYPT\u00a02016, Part\u00a0II, volume 9666 of LNCS,(Springer, Berlin, Heidelberg, 2016) pp 305\u2013326","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"9535_CR35","unstructured":"A. Gabizon, Z.J. Williamson, plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Report 2020\/315 (2020)"},{"key":"9535_CR36","unstructured":"A. Gabizon, Z.J. Williamson, O. Ciobotaru, PLONK: Permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019)"},{"key":"9535_CR37","unstructured":"U. Hab\u00f6ck, Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Report 2022\/1530 (2022)"},{"key":"9535_CR38","unstructured":"halo2\u00a0book contributors. The halo2 book. 16-bit table chip for sha-256. https:\/\/zcash.github.io\/halo2\/design\/gadgets\/sha256\/table16.html#16-bit-table-chip-for-sha-256"},{"key":"9535_CR39","doi-asserted-by":"crossref","unstructured":"A. Kate, G.M. Zaverucha, I. Goldberg, Constant-size commitments to polynomials and their applications. In M. Abe, editor, ASIACRYPT\u00a02010, volume 6477 of, (Springer, Berlin, Heidelberg, 2010) pp 177\u2013194","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"9535_CR40","doi-asserted-by":"crossref","unstructured":"C. Lund, L. Fortnow, H.J. Karloff, N. Nisan, Algebraic methods for interactive proof systems. In 31st FOCS, (IEEE Computer Society Press, 1990) pp 2\u201310","DOI":"10.1109\/FSCS.1990.89518"},{"key":"9535_CR41","doi-asserted-by":"crossref","unstructured":"H. Lipmaa, Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In Ronald Cramer, editor, TCC\u00a02012, volume 7194 of LNCS, (Springer, Berlin, Heidelberg, 2012) pp 169\u2013189","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"9535_CR42","unstructured":"S. Papini, U. Hab\u00f6ck, Improving logarithmic derivative lookups using GKR. Cryptology ePrint Archive, Paper 2023\/1284 (2023) https:\/\/eprint.iacr.org\/2023\/1284"},{"key":"9535_CR43","unstructured":"J. Posen, A.A. Kattis, Caulk+: Table-independent lookup arguments. Cryptology ePrint Archive, Report 2022\/957 (2022)"},{"key":"9535_CR44","doi-asserted-by":"crossref","unstructured":"C. Papamanthou, E. Shi, R. Tamassia, Signatures of correct computation. In Amit Sahai, editor, TCC\u00a02013, volume 7785 of LNCS, (Springer, Berlin, Heidelberg, 2013) pp 222\u2013242","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"9535_CR45","unstructured":"Rick, M.W. Authors. Mr. meeseeks. rick and morty wiki. https:\/\/rickandmorty.fandom.com\/wiki\/Mr._Meeseeks"},{"key":"9535_CR46","doi-asserted-by":"crossref","unstructured":"M. Rosenberg, T. Mopuri, H. Hafezi, I. Miers, P. Mishra, Hekaton: Horizontally-scalable zkSNARKs via proof aggregation. Cryptology ePrint Archive, Paper 2024\/1208 (2024)","DOI":"10.1145\/3658644.3690282"},{"key":"9535_CR47","doi-asserted-by":"crossref","unstructured":"C. R\u00e0fols, A. Zapico, An algebraic framework for universal and updatable SNARKs. In Tal Malkin and Chris Peikert, editors, CRYPTO\u00a02021, Part\u00a0I, volume 12825 of LNCS, pages 774\u2013804, Virtual Event (Springer, Cham, 2021)","DOI":"10.1007\/978-3-030-84242-0_27"},{"key":"9535_CR48","doi-asserted-by":"crossref","unstructured":"S. Setty, Spartan: Efficient and general-purpose zkSNARKs without trusted setup. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0III, volume 12172 of LNCS, (Springer, Cham, 2020) pp 704\u2013737","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"9535_CR49","doi-asserted-by":"crossref","unstructured":"S.T.V. Setty, J. Thaler, R.S. Wahby, Unlocking the lookup singularity with Lasso. In Marc Joye and Gregor Leander, editors, EUROCRYPT\u00a02024, Part\u00a0VI, volume 14656 of LNCS, (Springer, Cham, 2024) pp 180\u2013209","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"9535_CR50","unstructured":"B. Whitehat, Lookup singularity. https:\/\/zkresear.ch\/t\/lookup-singularity\/65\/7"},{"key":"9535_CR51","doi-asserted-by":"crossref","unstructured":"T. Xie, Y. Zhang, D. Song, Orion: Zero knowledge proof with linear prover time. In Y. Dodis, T. Shrimpton, editors, CRYPTO\u00a02022, Part\u00a0IV, volume 13510 of LNCS, (Springer, Cham, 2022) pp 299\u2013328","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"9535_CR52","doi-asserted-by":"crossref","unstructured":"A. Zapico, V. Buterin, D. Khovratovich, M. Maller, A. Nitulescu, M. Simkin, Caulk: Lookup arguments in sublinear time. In H. Yin, A. Stavrou, C. Cremers, E. Shi, editors, ACM CCS 2022, (ACM Press, 2022) pp 3121\u20133134","DOI":"10.1145\/3548606.3560646"},{"key":"9535_CR53","unstructured":"A. Zapico, V. Buterin, D. Khovratovich, M. Maller, A. Nitulescu, M. Simkin, Caulk: Lookup arguments in sublinear time. Cryptology ePrint Archive, Report 2022\/621 (2022)"},{"key":"9535_CR54","unstructured":"A. Zapico, A. Gabizon, D. Khovratovich, M. Maller, C. R\u00e0fols, Baloo: Nearly optimal lookup arguments. Cryptology ePrint Archive, Report 2022\/1565 (2022)"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09535-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09535-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09535-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:33:50Z","timestamp":1739309630000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09535-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["9535"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09535-0","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"9 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}