{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:03:19Z","timestamp":1780588999000,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Postdoctoral Fellowship Program of CPSF","award":["GZB20250407"],"award-info":[{"award-number":["GZB20250407"]}]},{"name":"Zhejiang Provincial Natural Science Foundation of China","award":["LMS26F020011"],"award-info":[{"award-number":["LMS26F020011"]}]},{"name":"China Postdoctoral Science Foundation","award":["2025M771571"],"award-info":[{"award-number":["2025M771571"]}]},{"name":"National Natural Science Foundation of China","award":["62232002"],"award-info":[{"award-number":["62232002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1145\/3779208.3805964","type":"proceedings-article","created":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:21:58Z","timestamp":1780586518000},"page":"852-868","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SoK: Understanding zkVM: From Research to Practice"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4949-7738","authenticated-orcid":false,"given":"Guomin","family":"Yang","sequence":"first","affiliation":[{"name":"Singapore Management University, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2381-9257","authenticated-orcid":false,"given":"Yang","family":"Yunbo","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4890-1937","authenticated-orcid":false,"given":"Yuejia","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of Sussex, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0514-9537","authenticated-orcid":false,"given":"Haibo","family":"Tang","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8961-0723","authenticated-orcid":false,"given":"Bingsheng","family":"Zhang","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3441-6277","authenticated-orcid":false,"given":"Kui","family":"Ren","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_3_1","volume-title":"Springer","author":"Ben-Sasson Eli","year":"2013","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, and Madars Virza. Snarks for c: Verifying program executions succinctly and in zero knowledge. In Annual cryptology conference, pages 90\u2013108. Springer, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_5_1","volume-title":"Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon, Zachary J Williamson, and Oana Ciobotaru. Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, 2019."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_1_7_1","volume-title":"Risc zero: A zero-knowledge verifiable general computing platform. GitHub repository","author":"Zero RISC","year":"2024","unstructured":"RISC Zero. Risc zero: A zero-knowledge verifiable general computing platform. GitHub repository, 2024. https:\/\/github.com\/risc0\/risc0."},{"key":"e_1_3_2_1_8_1","volume-title":"Whitepaper","author":"Zero Team RISC","year":"2023","unstructured":"RISC Zero Team. RISC Zero zkVM: Scalable, transparent arguments of RISC-V integrity. Whitepaper, 2023. https:\/\/www.risczero.com\/proof-system-in-detail.pdf."},{"key":"e_1_3_2_1_9_1","volume-title":"Sp1: A performant, 100% open-source, contributor-friendly zkvm. GitHub repository","author":"Labs Succinct","year":"2024","unstructured":"Succinct Labs. Sp1: A performant, 100% open-source, contributor-friendly zkvm. GitHub repository, 2024. https:\/\/github.com\/succinctlabs\/sp1."},{"key":"e_1_3_2_1_10_1","volume-title":"Technical Documentation","author":"Labs Succinct","year":"2024","unstructured":"Succinct Labs. SP1: A high-performance, open-source zkVM. Technical Documentation, 2024. https:\/\/docs.succinct.xyz\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"e_1_3_2_1_12_1","volume-title":"Scroll: Native zkEVM layer 2 for ethereum. https:\/\/github.com\/scroll-tech\/scroll","author":"Tech Scroll","year":"2024","unstructured":"Scroll Tech. Scroll: Native zkEVM layer 2 for ethereum. https:\/\/github.com\/scroll-tech\/scroll, 2024."},{"key":"e_1_3_2_1_13_1","volume-title":"Modular, performant zkVM framework. https:\/\/github.com\/openvm-org\/openvm","year":"2024","unstructured":"Axiom. OpenVM: Modular, performant zkVM framework. https:\/\/github.com\/openvm-org\/openvm, 2024."},{"key":"e_1_3_2_1_14_1","volume-title":"A survey on the applications of zero-knowledge proofs. arXiv preprint arXiv:2408.00243","author":"Lavin Ryan","year":"2024","unstructured":"Ryan Lavin, Xuekai Liu, Hardhik Mohanty, Logan Norman, Giovanni Zaarour, and Bhaskar Krishnamachari. A survey on the applications of zero-knowledge proofs. arXiv preprint arXiv:2408.00243, 2024."},{"key":"e_1_3_2_1_15_1","volume-title":"Sok: Understanding zk-snarks: The gap between research and practice. arXiv preprint arXiv:2502.02387","author":"Liang Junkai","year":"2025","unstructured":"Junkai Liang, Daqi Hu, Pengfei Wu, Yunbo Yang, Qingni Shen, and Zhonghai Wu. Sok: Understanding zk-snarks: The gap between research and practice. arXiv preprint arXiv:2502.02387, 2025."},{"key":"e_1_3_2_1_16_1","volume-title":"Zero-knowlege virtual machines","author":"Veli\u010dka Karel","year":"2025","unstructured":"Karel Veli\u010dka. Zero-knowlege virtual machines. 2025."},{"key":"e_1_3_2_1_17_1","volume-title":"Arguzz: Testing zkvms for soundness and completeness bugs. arXiv preprint arXiv:2509.10819","author":"Hochrainer Christoph","year":"2025","unstructured":"Christoph Hochrainer, Valentin W\u00fcstholz, and Maria Christakis. Arguzz: Testing zkvms for soundness and completeness bugs. arXiv preprint arXiv:2509.10819, 2025."},{"key":"e_1_3_2_1_18_1","volume-title":"Evaluating compiler optimization impacts on zkvm performance. arXiv preprint arXiv:2508.17518","author":"Gassmann Thomas","year":"2025","unstructured":"Thomas Gassmann, Stefanos Chaliasos, Thodoris Sotiropoulos, and Zhendong Su. Evaluating compiler optimization impacts on zkvm performance. arXiv preprint arXiv:2508.17518, 2025."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_21_1","volume-title":"transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, 2018."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_1_25_1","first-page":"1","volume-title":"45th international colloquium on automata, languages, and programming (icalp","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. Fast reed-solomon interactive oracle proofs of proximity. In 45th international colloquium on automata, languages, and programming (icalp 2018), pages 14\u20131. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018."},{"key":"e_1_3_2_1_26_1","volume-title":"Recursive proof composition without a trusted setup. Cryptology ePrint Archive","author":"Bowe Sean","year":"2019","unstructured":"Sean Bowe, Jack Grigg, and Daira Hopwood. Recursive proof composition without a trusted setup. Cryptology ePrint Archive, 2019."},{"key":"e_1_3_2_1_27_1","first-page":"128","volume-title":"Annual international conference on the theory and applications of cryptographic techniques","author":"Ben-Sasson Eli","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P Ward. Aurora: Transparent succinct arguments for r1cs. In Annual international conference on the theory and applications of cryptographic techniques, pages 103\u2013128. Springer, 2019."},{"key":"e_1_3_2_1_28_1","volume-title":"plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive","author":"Gabizon Ariel","year":"2020","unstructured":"Ariel Gabizon and Zachary J Williamson. plookup: A simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, 2020."},{"key":"e_1_3_2_1_29_1","volume-title":"Pico: A lightweight zkVM. https:\/\/github.com\/brevis-network\/pico","author":"Network Brevis","year":"2024","unstructured":"Brevis Network. Pico: A lightweight zkVM. https:\/\/github.com\/brevis-network\/pico, 2024."},{"key":"e_1_3_2_1_30_1","volume-title":"Ceno: Zero-knowledge proofs for RISC-V. https:\/\/github.com\/scroll-tech\/ceno","author":"Tech Scroll","year":"2024","unstructured":"Scroll Tech. Ceno: Zero-knowledge proofs for RISC-V. https:\/\/github.com\/scroll-tech\/ceno, 2024."},{"key":"e_1_3_2_1_31_1","volume-title":"Airbender: STARK-based zkVM. https:\/\/github.com\/matter-labs\/zksync-airbender","author":"Labs Matter","year":"2024","unstructured":"Matter Labs. Airbender: STARK-based zkVM. https:\/\/github.com\/matter-labs\/zksync-airbender, 2024."},{"key":"e_1_3_2_1_32_1","volume-title":"Jolt: SNARKs for virtual machines via lookups. GitHub repository","year":"2024","unstructured":"a16z crypto research. Jolt: SNARKs for virtual machines via lookups. GitHub repository, 2024. https:\/\/github.com\/a16z\/jolt."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"e_1_3_2_1_34_1","volume-title":"Nexus zkvm. GitHub repository","author":"Nexus Inc.","year":"2024","unstructured":"Nexus Inc. Nexus zkvm. GitHub repository, 2024. https:\/\/github.com\/nexus-xyz\/nexus-zkvm\/."},{"key":"e_1_3_2_1_35_1","volume-title":"Stwo: Starkware's next-generation prover. https:\/\/github.com\/starkware-libs\/stwo","year":"2024","unstructured":"StarkWare. Stwo: Starkware's next-generation prover. https:\/\/github.com\/starkware-libs\/stwo, 2024."},{"key":"e_1_3_2_1_36_1","volume-title":"Zisk: RISC-V zkVM for zero-knowledge proofs. https:\/\/github.com\/0xPolygonZero\/zisk","author":"Labs Polygon","year":"2024","unstructured":"Polygon Labs. Zisk: RISC-V zkVM for zero-knowledge proofs. https:\/\/github.com\/0xPolygonZero\/zisk, 2024."},{"key":"e_1_3_2_1_37_1","volume-title":"Cairo programming language. https:\/\/github.com\/starkware-libs\/cairo-lang","year":"2024","unstructured":"StarkWare. Cairo programming language. https:\/\/github.com\/starkware-libs\/cairo-lang, 2024."},{"key":"e_1_3_2_1_38_1","volume-title":"Cairo-a turing-complete stark-friendly cpu architecture. Cryptology ePrint Archive","author":"Goldberg Lior","year":"2021","unstructured":"Lior Goldberg, Shahar Papini, and Michael Riabzev. Cairo-a turing-complete stark-friendly cpu architecture. Cryptology ePrint Archive, 2021."},{"key":"e_1_3_2_1_39_1","volume-title":"Cairo-M: A micro-architecture for cairo. https:\/\/github.com\/kkrt-labs\/cairo-m","author":"Labs KKRT","year":"2024","unstructured":"KKRT Labs. Cairo-M: A micro-architecture for cairo. https:\/\/github.com\/kkrt-labs\/cairo-m, 2024."},{"key":"e_1_3_2_1_40_1","volume-title":"Miden VM: STARK-based virtual machine. https:\/\/github.com\/0xPolygonMiden\/miden-vm","author":"Labs Polygon","year":"2024","unstructured":"Polygon Labs. Miden VM: STARK-based virtual machine. https:\/\/github.com\/0xPolygonMiden\/miden-vm, 2024."},{"key":"e_1_3_2_1_41_1","volume-title":"Valida zkVM: STARK-based zero-knowledge virtual machine. https:\/\/github.com\/lita-xyz\/valida","author":"Foundation Lita","year":"2024","unstructured":"Lita Foundation. Valida zkVM: STARK-based zero-knowledge virtual machine. https:\/\/github.com\/lita-xyz\/valida, 2024."},{"key":"e_1_3_2_1_42_1","volume-title":"snarkVM: A zero-knowledge virtual machine. https:\/\/github.com\/ProvableHQ\/snarkVM","author":"HQ.","year":"2024","unstructured":"ProvableHQ. snarkVM: A zero-knowledge virtual machine. https:\/\/github.com\/ProvableHQ\/snarkVM, 2024."},{"key":"e_1_3_2_1_43_1","volume-title":"Lean zkVM: Formal verification for zkVMs. https:\/\/github.com\/leanEthereum\/leanMultisig","author":"Ethereum Lean","year":"2025","unstructured":"Lean Ethereum. Lean zkVM: Formal verification for zkVMs. https:\/\/github.com\/leanEthereum\/leanMultisig, 2025."},{"key":"e_1_3_2_1_44_1","volume-title":"Ziren: ZKM zkVM implementation. https:\/\/github.com\/ProjectZKM\/Ziren","author":"ZKM.","year":"2024","unstructured":"ProjectZKM. Ziren: ZKM zkVM implementation. https:\/\/github.com\/ProjectZKM\/Ziren, 2024."},{"key":"e_1_3_2_1_45_1","volume-title":"o1vm: A MIPS-based zkVM. https:\/\/github.com\/o1-labs\/proof-systems","year":"2024","unstructured":"O1 Labs. o1vm: A MIPS-based zkVM. https:\/\/github.com\/o1-labs\/proof-systems, 2024."},{"key":"e_1_3_2_1_46_1","volume-title":"zkWasm: Zero-knowledge WebAssembly virtual machine. https:\/\/github.com\/DelphinusLab\/zkWasm","author":"Lab Delphinus","year":"2024","unstructured":"Delphinus Lab. zkWasm: Zero-knowledge WebAssembly virtual machine. https:\/\/github.com\/DelphinusLab\/zkWasm, 2024."},{"key":"e_1_3_2_1_47_1","volume-title":"Nova: Recursive zero-knowledge arguments. https:\/\/github.com\/microsoft\/nova","author":"Research Microsoft","year":"2024","unstructured":"Microsoft Research. Nova: Recursive zero-knowledge arguments. https:\/\/github.com\/microsoft\/nova, 2024."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"e_1_3_2_1_49_1","volume-title":"Powdr: Modular zero-knowledge stack. https:\/\/github.com\/powdr-labs\/powdr","author":"Labs Powdr","year":"2024","unstructured":"Powdr Labs. Powdr: Modular zero-knowledge stack. https:\/\/github.com\/powdr-labs\/powdr, 2024."},{"key":"e_1_3_2_1_50_1","first-page":"1","article-title":"The risc-v instruction set manual, volume i: Base user-level isa. EECS Department, UC Berkeley","volume":"2011","author":"Waterman Andrew","year":"2011","unstructured":"Andrew Waterman, Yunsup Lee, David A Patterson, and Krste Asanovic. The risc-v instruction set manual, volume i: Base user-level isa. EECS Department, UC Berkeley, Tech. Rep. UCB\/EECS-2011-62, 116:1\u201332, 2011.","journal-title":"Tech. Rep. UCB\/EECS-"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCAE53984.2021.9707613"},{"key":"e_1_3_2_1_52_1","volume-title":"Cannon: MIPS-based fault proof VM. https:\/\/github.com\/ethereum-optimism\/optimism\/tree\/develop\/cannon","author":"Foundation Optimism","year":"2024","unstructured":"Optimism Foundation. Cannon: MIPS-based fault proof VM. https:\/\/github.com\/ethereum-optimism\/optimism\/tree\/develop\/cannon, 2024."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"e_1_3_2_1_54_1","volume-title":"Small-field hash-based snargs are less sound than conjectured. Cryptology ePrint Archive","author":"Fenzi Giacomo","year":"2025","unstructured":"Giacomo Fenzi and Antonio Sanso. Small-field hash-based snargs are less sound than conjectured. Cryptology ePrint Archive, 2025."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185212"},{"key":"e_1_3_2_1_56_1","volume-title":"Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive","author":"Hab\u00f6ck Ulrich","year":"2022","unstructured":"Ulrich Hab\u00f6ck. Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, 2022."},{"key":"e_1_3_2_1_57_1","first-page":"356","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Settty Srinath","year":"2018","unstructured":"Srinath Settty, Sebastian Angel, Trinabh Gupta, and Jonathan Lee. Proving the correct execution of concurrent services in zero-knowledge. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), pages 339\u2013356, 2018."},{"key":"e_1_3_2_1_58_1","volume-title":"Twist and shout: Faster memory checking arguments via one-hot addressing and increments. Cryptology ePrint Archive","author":"Setty Srinath","year":"2025","unstructured":"Srinath Setty and Justin Thaler. Twist and shout: Faster memory checking arguments via one-hot addressing and increments. Cryptology ePrint Archive, 2025."},{"key":"e_1_3_2_1_59_1","volume-title":"Yael Tauman Kalai, and Guy N Rothblum. Delegating computation: interactive proofs for muggles. Journal of the ACM (JACM), 62(4):1\u201364","author":"Goldwasser Shafi","year":"2015","unstructured":"Shafi Goldwasser, Yael Tauman Kalai, and Guy N Rothblum. Delegating computation: interactive proofs for muggles. Journal of the ACM (JACM), 62(4):1\u201364, 2015."},{"key":"e_1_3_2_1_60_1","volume-title":"Circle starks. Cryptology ePrint Archive","author":"Hab\u00f6ck Ulrich","year":"2024","unstructured":"Ulrich Hab\u00f6ck, David Levit, and Shahar Papini. Circle starks. Cryptology ePrint Archive, 2024."},{"key":"e_1_3_2_1_61_1","volume-title":"Algebraic methods for interactive proof systems. Journal of the ACM (JACM), 39(4):859\u2013868","author":"Lund Carsten","year":"1992","unstructured":"Carsten Lund, Lance Fortnow, Howard Karloff, and Noam Nisan. Algebraic methods for interactive proof systems. Journal of the ACM (JACM), 39(4):859\u2013868, 1992."},{"key":"e_1_3_2_1_62_1","volume-title":"Springer","author":"Thaler Justin","year":"2013","unstructured":"Justin Thaler. Time-optimal interactive proofs for circuit evaluation. In Annual cryptology conference, pages 71\u201389. Springer, 2013."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"e_1_3_2_1_65_1","volume-title":"https:\/\/github.com\/Plonky3\/Plonky3","author":"Project Polygon","year":"2024","unstructured":"Polygon Project. Plonky3. https:\/\/github.com\/Plonky3\/Plonky3, 2024."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3591282"},{"key":"e_1_3_2_1_69_1","first-page":"692","volume-title":"27th USENIX Security Symposium (USENIX Security 18)","author":"Wu Howard","year":"2018","unstructured":"Howard Wu, Wenting Zheng, Alessandro Chiesa, Raluca Ada Popa, and Ion Stoica. {DIZK}: A distributed zero knowledge proof system. In 27th USENIX Security Symposium (USENIX Security 18), pages 675\u2013692, 2018."},{"key":"e_1_3_2_1_70_1","volume-title":"Vdoram: Towards a random access machine with both public verifiability and distributed obliviousness. Cryptology ePrint Archive","author":"Qi Huayi","year":"2025","unstructured":"Huayi Qi, Minghui Xu, Xiaohua Jia, and Xiuzhen Cheng. Vdoram: Towards a random access machine with both public verifiability and distributed obliviousness. Cryptology ePrint Archive, 2025."}],"event":{"name":"ASIA CCS '26: ACM Asia Conference on Computer and Communications Security","location":"Bangalore India","acronym":"ASIA CCS '26","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3779208.3805964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:34:34Z","timestamp":1780587274000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3779208.3805964"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":70,"alternative-id":["10.1145\/3779208.3805964","10.1145\/3779208"],"URL":"https:\/\/doi.org\/10.1145\/3779208.3805964","relation":{},"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"2026-06-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}