{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T12:56:21Z","timestamp":1761396981914,"version":"3.40.4"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:00:00Z","timestamp":1737504000000},"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,4]]},"DOI":"10.1007\/s00145-024-09533-2","type":"journal-article","created":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T19:51:54Z","timestamp":1737575514000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ceno: Non-uniform, Segment and Parallel Zero-Knowledge Virtual Machine"],"prefix":"10.1007","volume":"38","author":[{"given":"Tianyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenfei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuncong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenqing","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"K. Abbaszadeh, C. Pappas, D. Papadopoulos, J. Katz, Zero-knowledge proofs of training for deep neural networks. IACR Cryptol. ePrint Arch.162 (2024)","key":"9533_CR1","DOI":"10.1145\/3658644.3670316"},{"unstructured":"Arkworks contributors. Arkworks zksnark ecosystem (2022)","key":"9533_CR2"},{"unstructured":"A. Arun, S. Setty, J. Thaler, Jolt: Snarks for virtual machines via lookups, in Cryptology ePrint Archive, Paper 2023\/1217 (2023). https:\/\/eprint.iacr.org\/2023\/1217","key":"9533_CR3"},{"unstructured":"Azetc foundation. Aztec. https:\/\/aztec.network\/","key":"9533_CR4"},{"unstructured":"Aztec project. Noir language (2023). https:\/\/noir-lang.org\/docs\/","key":"9533_CR5"},{"unstructured":"E. Ben-Sasson, A. Chiesa, N. Spooner, Interactive oracle proofs, in Cryptology ePrint Archive, Paper 2016\/116 (2016). https:\/\/eprint.iacr.org\/2016\/116","key":"9533_CR6"},{"unstructured":"E. Ben-Sasson, A. Chiesa, E. Tromer, M. Virza, Succinct non-interactive zero knowledge for a von Neumann architecture, in Proceedings of the 23rd USENIX Conference on Security Symposium, SEC\u201914 (USENIX Association, USA, 2014), pp. 781\u2013796","key":"9533_CR7"},{"key":"9533_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology\u2013 CRYPTO 2013","author":"E Ben-Sasson","year":"2013","unstructured":"E. Ben-Sasson, A. Chiesa, D. Genkin, E. Tromer, M. Virza, Snarks for c: Verifying program executions succinctly and in zero knowledge, in R. Canetti, J.\u00a0A. Garay, editors, Advances in Cryptology\u2014 CRYPTO 2013 (Springer, Berlin, 2013), pp. 90\u2013108"},{"key":"9533_CR9","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-44381-1_16","volume-title":"Advances in Cryptology\u2013CRYPTO 2014","author":"E Ben-Sasson","year":"2014","unstructured":"E. Ben-Sasson, A. Chiesa, E. Tromer, M. Virza, Scalable zero knowledge via cycles of elliptic curves, in J.\u00a0A. Garay, R. Gennaro, editors, Advances in Cryptology\u2014CRYPTO 2014 (Springer, Berlin, 2014), pp. 276\u2013294"},{"key":"9533_CR10","first-page":"46","volume":"2018","author":"E Ben-Sasson","year":"2018","unstructured":"E. Ben-Sasson, I. Bentov, Y. Horesh, M. Riabzev, Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch.2018, 46 (2018)","journal-title":"IACR Cryptol. ePrint Arch."},{"doi-asserted-by":"crossref","unstructured":"M.\u00a0Blum, W.\u00a0Evans, P.\u00a0Gemmell, S.\u00a0Kannan, M.\u00a0Naor, Checking the correctness of memories, in [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991), pp. 90\u201399","key":"9533_CR11","DOI":"10.1109\/SFCS.1991.185352"},{"unstructured":"S. Bowe, A. Chiesa, M. Green, I. Miers, P. Mishra, H. Wu, Zexe: Enabling decentralized private computation, in Cryptology ePrint Archive, Paper 2018\/962 (2018). https:\/\/eprint.iacr.org\/2018\/962","key":"9533_CR12"},{"doi-asserted-by":"crossref","unstructured":"B. Braun, A.J. Feldman, Z. Ren, T.V.S. Srinath, A.J. Blumberg, M. Walfish, Verifying computations with state, in SOSP (2013), pp. 341\u2013357","key":"9533_CR13","DOI":"10.1145\/2517349.2522733"},{"unstructured":"B. B\u00fcnz, J. Chen, Proofs for deep thought: Accumulation for large memories and deterministic computations, in Cryptology ePrint Archive, Paper 2024\/325 (2024). https:\/\/eprint.iacr.org\/2024\/325","key":"9533_CR14"},{"unstructured":"B. B\u00fcnz, B. Chen, Protostar: Generic efficient accumulation\/folding for special sound protocols, in Cryptology ePrint Archive, Paper 2023\/620 (2023). https:\/\/eprint.iacr.org\/2023\/620","key":"9533_CR15"},{"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 Advances in Cryptology\u2014EUROCRYPT 2023 (2023), pp. 499\u2013530","key":"9533_CR16","DOI":"10.1007\/978-3-031-30617-4_17"},{"doi-asserted-by":"crossref","unstructured":"A. Chiesa, Y. Hu, M. Maller, P. Mishra, N. Vesely, N. Ward, Marlin: Preprocessing zkSNARKs with universal and updatable SRS, in Advances in Cryptology\u2014EUROCRYPT 2020 (2020), pp. 738\u2013768","key":"9533_CR17","DOI":"10.1007\/978-3-030-45721-1_26"},{"unstructured":"A. Chiesa, R. Lehmkuhl, P. Mishra, Y. Zhang, EOS: Efficient private delegation of zkSNARK provers, in USENIX Security Symposium (2023), pp. 6453\u20136469","key":"9533_CR18"},{"unstructured":"S. Chu, B.H. Gomes, F.H. Iglesias, T. Norton, D. Tebbs, Uniplonk: Plonk with universal verifier, in Cryptology ePrint Archive, Paper 2023\/869 (2023). https:\/\/eprint.iacr.org\/2023\/869","key":"9533_CR19"},{"doi-asserted-by":"crossref","unstructured":"G. Cormode, M. Mitzenmacher, J. Thaler, Practical verified computation with streaming interactive proofs, in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (2012), pp. 90\u2013112","key":"9533_CR20","DOI":"10.1145\/2090236.2090245"},{"unstructured":"Ethereum Org, Go ethereum: Official go implementation of the ethereum protocol. https:\/\/github.com\/ethereum\/go-ethereum","key":"9533_CR21"},{"doi-asserted-by":"crossref","unstructured":"A. Fiat, A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, in Advances in Cryptology\u2014CRYPTO\u2019 86 (1987), pp. 186\u2013194","key":"9533_CR22","DOI":"10.1007\/3-540-47721-7_12"},{"unstructured":"A. Gabizon, Z.J. Williamson, O. Ciobotaru, Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge, in Cryptology ePrint Archive, Paper 2019\/953 (2019)","key":"9533_CR23"},{"unstructured":"S. Garg, A. Goel, A. Jain, G.-V. Policharla, S. Sekar, zkSaaS: zero-knowledge SNARKs as a service, in USENIX Security Symposium (2023), pp. 4427\u20134444","key":"9533_CR24"},{"unstructured":"L. Goldberg, S. Papini, M. Riabzev. Cairo\u2014a Turing-complete STARK-friendly CPU architecture, in Cryptology ePrint Archive, Paper 2021\/1063 (2021). https:\/\/eprint.iacr.org\/2021\/1063","key":"9533_CR25"},{"doi-asserted-by":"crossref","unstructured":"S. Goldwasser, Y.T. Kalai, G.N. Rothblum, Delegating computation: interactive proofs for muggles (2008), pp. 113\u2013122","key":"9533_CR26","DOI":"10.1145\/1374376.1374396"},{"doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof-systems (extended abstract), in R. Sedgewick, editor, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6\u20138, 1985, Providence, Rhode Island, USA (ACM, 1985), pp. 291\u2013304","key":"9533_CR27","DOI":"10.1145\/22145.22178"},{"unstructured":"J. Groth, On the size of pairing-based non-interactive arguments, in Cryptology ePrint Archive, Paper 2016\/260 (2016). https:\/\/eprint.iacr.org\/2016\/260","key":"9533_CR28"},{"unstructured":"D. Hopwood, S. Bowe, T. Hornby, N. Wilcox, Zcash protocol specification. version 2022.3.8. (2022). https:\/\/zips.z.cash\/protocol\/protocol.pdf","key":"9533_CR29"},{"doi-asserted-by":"crossref","unstructured":"A. Kothapalli, S.T.V. Setty, I. Tzialla, Nova: Recursive zero-knowledge arguments from folding schemes, in Y. Dodis, T. Shrimpton, editors, Advances in Cryptology\u2014CRYPTO 2022\u201442nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15\u201318, 2022, Proceedings, Part IV, Volume 13510 of Lecture Notes in Computer Science (Springer, 2022), pp. 359\u2013388","key":"9533_CR30","DOI":"10.1007\/978-3-031-15985-5_13"},{"doi-asserted-by":"crossref","unstructured":"T. Liu, X. Xie, Y. Zhang, zkcnn: Zero knowledge proofs for convolutional neural network predictions and accuracy, in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (2021), pp. 2968\u20132985","key":"9533_CR31","DOI":"10.1145\/3460120.3485379"},{"doi-asserted-by":"crossref","unstructured":"T. Liu, T. Xie, J. Zhang, D. Song, Y. Zhang, Pianist: Scalable zkrollups via fully distributed zero-knowledge proofs, in IEEE Symposium on Security and Privacy (2024), pp. 35\u201335","key":"9533_CR32","DOI":"10.1109\/SP54263.2024.00035"},{"key":"9533_CR33","first-page":"2","volume":"1","author":"C Lund","year":"1990","unstructured":"C. Lund, L. Fortnow, H. Karloff, N. Nisan, Algebraic Methods for interactive proof systems. vol.1, pp. 2\u201310 (1990)","journal-title":"Algebraic Methods for interactive proof systems."},{"unstructured":"Modulus Lab, Scaling intelligence: Verifiable decision forest interence with remainder. Github (2022). https:\/\/github.com\/Modulus-Labs\/Papers\/blob\/master\/remainder-paper.pdf.","key":"9533_CR34"},{"unstructured":"Monero Project. Monero (2022). https:\/\/github.com\/monero-project\/monero","key":"9533_CR35"},{"unstructured":"Nexus Inc. Nexus zkVM. https:\/\/github.com\/nexus-xyz\/nexus-zkvm\/","key":"9533_CR36"},{"unstructured":"S. Papini, U. Hab\u00f6ck, Improving logarithmic derivative lookups using GKR. In Cryptology ePrint Archive, Paper 2023\/1284 (2023)","key":"9533_CR37"},{"unstructured":"Paradigm. Reth: Modular, contributor-friendly and blazing-fast implementation of the ethereum protocol, in rust. https:\/\/github.com\/paradigmxyz\/reth","key":"9533_CR38"},{"unstructured":"Polygon project. Plonky2. https:\/\/github.com\/mir-protocol\/plonky2","key":"9533_CR39"},{"unstructured":"Polygon project. Plonky3. https:\/\/github.com\/Plonky3\/Plonky3","key":"9533_CR40"},{"unstructured":"Polygon project. Polygon Hermez. https:\/\/polygon.technology\/solutions\/polygon-hermez\/","key":"9533_CR41"},{"unstructured":"Polygon project. Polygon Miden. https:\/\/polygon.technology\/polygon-miden","key":"9533_CR42"},{"unstructured":"Risc-Zero project. Risc-Zero. https:\/\/www.risczero.com\/","key":"9533_CR43"},{"unstructured":"SCIPR Lab. libiop: a C++ library for IOP-based zkSNARKs. https:\/\/github.com\/scipr-lab\/libiop (2021)","key":"9533_CR44"},{"unstructured":"Scroll tech. Scroll. https:\/\/scroll.io\/","key":"9533_CR45"},{"doi-asserted-by":"crossref","unstructured":"S. Setty, Spartan: Efficient and general-purpose zkSNARKs without trusted setup, in Advances in Cryptology\u2014CRYPTO 2020 (2020), pp. 704\u2013737","key":"9533_CR46","DOI":"10.1007\/978-3-030-56877-1_25"},{"unstructured":"S. Setty, J. Thaler, R. Wahby, Customizable constraint systems for succinct arguments, in Cryptology ePrint Archive, Paper 2023\/552 (2023)","key":"9533_CR47"},{"unstructured":"S. Setty, J. Thaler, R. Wahby, Unlocking the lookup singularity with lasso, in Cryptology ePrint Archive, Paper 2023\/1216 (2023)","key":"9533_CR48"},{"unstructured":"Spartan2. https:\/\/github.com\/microsoft\/Spartan2","key":"9533_CR49"},{"unstructured":"StarkWare Team. ethSTARK. https:\/\/github.com\/starkware-libs\/ethSTARK (2021)","key":"9533_CR50"},{"unstructured":"Starkware. Starknet. https:\/\/www.starknet.io\/en","key":"9533_CR51"},{"unstructured":"Succinct lab. Succinct processor 1. https:\/\/blog.succinct.xyz\/introducing-sp1\/","key":"9533_CR52"},{"doi-asserted-by":"crossref","unstructured":"J. Thaler, Proofs, Arguments, and Zero-Knowledge (2022)","key":"9533_CR53","DOI":"10.1561\/9781638281252"},{"doi-asserted-by":"crossref","unstructured":"J. Thaler, Time-optimal interactive proofs for circuit evaluation, in Advances in Cryptology\u2014CRYPTO 2013 (2013), pp. 71\u201389","key":"9533_CR54","DOI":"10.1007\/978-3-642-40084-1_5"},{"unstructured":"Valida. Valida, a stark-based virtual machine (2023). https:\/\/github.com\/valida-xyz\/valida","key":"9533_CR55"},{"doi-asserted-by":"crossref","unstructured":"R.S. Wahby, Y.\u00a0Ji, A.J. Blumberg, A. Shelat, J. Thaler, M. Walfish, T. Wies, Full accounting for verifiable outsourcing, in Cryptology ePrint Archive, Paper 2017\/242 (2017). https:\/\/eprint.iacr.org\/2017\/242","key":"9533_CR56","DOI":"10.1145\/3133956.3133984"},{"doi-asserted-by":"crossref","unstructured":"R.\u00a0Wahby, S.\u00a0Setty, Z.\u00a0Ren, A.J.\u00a0Blumberg, M. Walfish, Efficient ram and control flow in verifiable outsourced computation, in Network and Distributed System Security Symposium (NDSS) (2015)","key":"9533_CR57","DOI":"10.14722\/ndss.2015.23097"},{"unstructured":"Wikipedia contributors. Basic block\u2014Wikipedia, the free encyclopedia (2023)","key":"9533_CR58"},{"doi-asserted-by":"crossref","unstructured":"T. Xie, J. Zhang, Z. Cheng, F. Zhang, Y. Zhang, Y. Jia, D. Boneh, D. Song, zkbridge: Trustless cross-chain bridges made practical, in H. Yin, A. Stavrou, C. Cremers, E. Shi, editors, Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7\u201311, 2022 (ACM, 2022), pp. 3003\u20133017","key":"9533_CR59","DOI":"10.1145\/3548606.3560652"},{"doi-asserted-by":"crossref","unstructured":"T. Xie, J. Zhang, Y. Zhang, C. Papamanthou, D. Song, Libra: Succinct zero-knowledge proofs with optimal prover computation, in Advances in Cryptology\u2014CRYPTO 2019 (2019), pp. 733\u2013764","key":"9533_CR60","DOI":"10.1007\/978-3-030-26954-8_24"},{"unstructured":"A.L. Xiong, B. Chen, Z. Zhang, B. B\u00fcnz, B. Fisch, F. Krell, P. Camacho, Veri-zexe: Decentralized private computation with universal setup, in Cryptology ePrint Archive, Paper 2022\/802 (2022). https:\/\/eprint.iacr.org\/2022\/802","key":"9533_CR61"},{"unstructured":"Zcash project. PLONKish arithmetization (2022). https:\/\/zcash.github.io\/halo2\/concepts\/arithmetization.html","key":"9533_CR62"},{"unstructured":"Zcash project. The halo2 book","key":"9533_CR63"},{"doi-asserted-by":"crossref","unstructured":"Y. Zhang, D. Genkin, J. Katz, D. Papadopoulos, C. Papamanthou, vRAM: Faster verifiable RAM with program-independent preprocessing, in 2018 IEEE Symposium on Security and Privacy (SP) (2018), pp. 908\u2013925","key":"9533_CR64","DOI":"10.1109\/SP.2018.00013"},{"doi-asserted-by":"crossref","unstructured":"Y. Zhang, D. Genkin, J. Katz, D. Papadopoulos, C. Papamanthou, vSQL: Verifying arbitrary SQL queries over dynamic outsourced databases, in 2017 IEEE Symposium on Security and Privacy (SP) (2017), pp. 863\u2013880","key":"9533_CR65","DOI":"10.1109\/SP.2017.43"},{"doi-asserted-by":"crossref","unstructured":"J. Zhang, T. Liu, W. Wang, Y. Zhang, D. Song, X. Xie, Y. Zhang, Doubly efficient interactive proofs for general arithmetic circuits with linear prover time, in Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (CCS) (2021), pp. 159\u2013177","key":"9533_CR66","DOI":"10.1145\/3460120.3484767"},{"doi-asserted-by":"crossref","unstructured":"J. Zhang, T. Xie, Y. Zhang, D.X. Song, Transparent polynomial delegation and its applications to zero knowledge proof, in 2020 IEEE Symposium on Security and Privacy (SP) (2020), pp. 859\u2013876","key":"9533_CR67","DOI":"10.1109\/SP40000.2020.00052"},{"key":"9533_CR68","first-page":"2039","volume-title":"CCS \u201920: 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"J Zhang","year":"2020","unstructured":"J. Zhang, Z. Fang, Y. Zhang, D. Song, Zero knowledge proofs for decision tree predictions and accuracy, in J. Ligatti, X. Ou, J. Katz, G. Vigna, editors, CCS \u201920: 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, USA, November 9\u201313, 2020 (ACM, 2020), pp. 2039\u20132053"},{"unstructured":"ZkSync project. ZkSync. https:\/\/zksync.io\/","key":"9533_CR69"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09533-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09533-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09533-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T13:11:27Z","timestamp":1745932287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09533-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,22]]},"references-count":69,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["9533"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09533-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2025,1,22]]},"assertion":[{"value":"28 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 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":"22 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}