{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:31:42Z","timestamp":1774690302107,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":98,"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":"Hong Kong Research Grants Council","award":["GRF-16200721"],"award-info":[{"award-number":["GRF-16200721"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690318","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"3110-3124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Sparrow: Space-Efficient zkSNARK for Data-Parallel Circuits and Applications to Zero-Knowledge Decision Trees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5949-3620","authenticated-orcid":false,"given":"Christodoulos","family":"Pappas","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2621-3015","authenticated-orcid":false,"given":"Dimitrios","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2007. https:\/\/scikit-learn.org\/stable\/. (2007)."},{"key":"e_1_3_2_1_2_1","unstructured":"2015. https:\/\/github.com\/herumi\/mcl. (2015)."},{"key":"e_1_3_2_1_3_1","volume-title":"www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing","year":"2016","unstructured":"2016. Propub. (2016). www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing."},{"key":"e_1_3_2_1_4_1","unstructured":"2021. https:\/\/github.com\/arkworks-rs\/gemini. (2021)."},{"key":"e_1_3_2_1_5_1","unstructured":"2021. https:\/\/github.com\/TAMUCrypto\/virgo-plus. (2021)."},{"key":"e_1_3_2_1_6_1","volume-title":"https:\/\/github.com\/ChristodoulosPappas\/Sparrow-Full-Version","year":"2024","unstructured":"2024. (2024). https:\/\/github.com\/ChristodoulosPappas\/Sparrow-Full-Version."},{"key":"e_1_3_2_1_7_1","unstructured":"2024. https:\/\/github.com\/anonymousg3bz6q2\/Sparrow. (2024)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Kasra Abbaszadeh Christodoulos Pappas Dimitrios Papadopoulos and Jonathan Katz. 2024. Zero-Knowledge Proofs of Training for Deep Neural Networks. IACR Cryptol. ePrint Arch. (2024).","DOI":"10.1145\/3658644.3670316"},{"key":"e_1_3_2_1_9_1","volume-title":"www.techtarget.com\/searchenterpriseai\/tip\/What-is-trustworthy-AI-and-why-is-it-important","author":"Abercrombie Cortnie","year":"2023","unstructured":"Cortnie Abercrombie. 2023. (2023). www.techtarget.com\/searchenterpriseai\/tip\/What-is-trustworthy-AI-and-why-is-it-important."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Martin R. Albrecht Lorenzo Grassi Christian Rechberger Arnab Roy and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT. 191--219.","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"e_1_3_2_1_11_1","volume-title":"CLOUDS: A Decision Tree Classifier for Large Datasets","author":"Alsabti Khaled","year":"1998","unstructured":"Khaled Alsabti, Sanjay Ranka, and Vineet Singh. 1998. CLOUDS: A Decision Tree Classifier for Large Datasets. In KDD, Rakesh Agrawal, Paul E. Stolorz, and Gregory Piatetsky-Shapiro (Eds.). AAAI Press, 2--8."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Scott Ames Carmit Hazay Yuval Ishai and Muthuramakrishnan Venkitasubramaniam. 2023. Ligero: lightweight sublinear arguments without a trusted setup. Des. Codes Cryptogr. (2023) 3379--3424.","DOI":"10.1007\/s10623-023-01222-8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Laasya Bangalore Rishabh Bhadauria Carmit Hazay and Muthuramakrishnan Venkitasubramaniam. 2022. On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives. In TCC. 417--446.","DOI":"10.1007\/978-3-031-22318-1_15"},{"key":"e_1_3_2_1_14_1","volume-title":"Zerocash: Decentralized Anonymous Payments from Bitcoin","author":"Ben-Sasson Eli","year":"2014","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, and Madars Virza. 2014. Zerocash: Decentralized Anonymous Payments from Bitcoin. In IEEE SP. 459--474."},{"key":"e_1_3_2_1_15_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. In EUROCRYPT. 103--128."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014. Scalable Zero Knowledge via Cycles of Elliptic Curves. In CRYPTO. 276--294.","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417893"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Nir Bitansky Ran Canetti Alessandro Chiesa and Eran Tromer. 2013. Recursive composition and bootstrapping for SNARKS and proof-carrying data. In STOC. ACM 111--120.","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Nir Bitansky and Alessandro Chiesa. 2012. Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. In CRYPTO. 255--272.","DOI":"10.1007\/978-3-642-32009-5_16"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Alexander R. Block Justin Holmgren Alon Rosen Ron D. Rothblum and Pratik Soni. 2020. Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. In TCC. 168--197.","DOI":"10.1007\/978-3-030-64378-2_7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Alexander R. Block Justin Holmgren Alon Rosen Ron D. Rothblum and Pratik Soni. 2021. Time- and Space-Efficient Arguments from Groups of Unknown Order. In CRYPTO. 123--152.","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"e_1_3_2_1_22_1","volume-title":"Checking the Correctness of Memories. Algorithmica","author":"Blum Manuel","year":"1994","unstructured":"Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, and Moni Naor. 1994. Checking the Correctness of Memories. Algorithmica (1994), 225--244."},{"key":"e_1_3_2_1_23_1","volume-title":"Verifiable computation using multiple provers. Cryptology ePrint Archive","author":"Blumberg Andrew J","year":"2014","unstructured":"Andrew J Blumberg, Justin Thaler, Victor Vu, and Michael Walfish. 2014. Verifiable computation using multiple provers. Cryptology ePrint Archive (2014)."},{"key":"e_1_3_2_1_24_1","unstructured":"Andrew J. Blumberg Justin Thaler Victor Vu and Michael Walfish. 2014. Verifiable computation using multiple provers. IACR Cryptol. ePrint Arch. (2014)."},{"key":"e_1_3_2_1_25_1","volume-title":"Gemini: Elastic SNARKs for Diverse Environments. In EUROCRYPT. 427--457.","author":"Bootle Jonathan","year":"2022","unstructured":"Jonathan Bootle, Alessandro Chiesa, Yuncong Hu, and Michele Orr\u00f9. 2022. Gemini: Elastic SNARKs for Diverse Environments. In EUROCRYPT. 427--457."},{"key":"e_1_3_2_1_26_1","volume-title":"Halo: Recursive Proof Composition without a Trusted Setup. IACR Cryptol. ePrint Arch.","author":"Bowe Sean","year":"2019","unstructured":"Sean Bowe, Jack Grigg, and Daira Hopwood. 2019. Halo: Recursive Proof Composition without a Trusted Setup. IACR Cryptol. ePrint Arch. (2019), 1021."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"e_1_3_2_1_28_1","unstructured":"Leo Breiman J. H. Friedman Richard A. Olshen and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Benedikt B\u00fcnz and Jessica Chen. 2024. Proofs for Deep Thought: Accumulation for large memories and deterministic computations. IACR Cryptol. ePrint Arch. (2024) 325.","DOI":"10.1007\/978-981-96-0935-2_9"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Benedikt B\u00fcnz Alessandro Chiesa William Lin Pratyush Mishra and Nicholas Spooner. 2021. Proof-Carrying Data Without Succinct Arguments. In CRYPTO. 681--710.","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Benedikt B\u00fcnz Ben Fisch and Alan Szepieniec. 2020. Transparent SNARKs from DARK Compilers. In EUROCRYPT. 677--706.","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"e_1_3_2_1_34_1","volume-title":"Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. ePrint","author":"Campanelli Matteo","year":"2023","unstructured":"Matteo Campanelli, Antonio Faonio, Dario Fiore, Tianyu Li, and Helger Lipmaa. 2023. Lookup Arguments: Improvements, Extensions and Applications to Zero-Knowledge Decision Trees. ePrint, 2023\/1518."},{"key":"e_1_3_2_1_35_1","volume-title":"Popa","author":"Chang Ian","year":"2023","unstructured":"Ian Chang, Katerina Sotiraki, Weikeng Chen, Murat Kantarcioglu, and Raluca A. Popa. 2023. HOLMES: Efficient Distribution Testing for Secure Collaborative Learning. In USENIX Sec. 4823--4840."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Binyi Chen Benedikt B\u00fcnz Dan Boneh and Zhenfei Zhang. 2023. HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates. In EUROCRYPT. 499--530.","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"e_1_3_2_1_37_1","volume-title":"A Time-Space Tradeoff for the Sumcheck Prover. Cryptology ePrint Archive","author":"Chiesa Alessandro","year":"2024","unstructured":"Alessandro Chiesa, Elisabetta Fedele, Giacomo Fenzi, and Andrew Zitek-Estrada. 2024. A Time-Space Tradeoff for the Sumcheck Prover. Cryptology ePrint Archive (2024)."},{"key":"e_1_3_2_1_38_1","volume-title":"A Zero Knowledge Sumcheck and its Applications. CoRR","author":"Chiesa Alessandro","year":"2017","unstructured":"Alessandro Chiesa, Michael A. Forbes, and Nicholas Spooner. 2017. A Zero Knowledge Sumcheck and its Applications. CoRR (2017)."},{"key":"e_1_3_2_1_39_1","unstructured":"Alessandro Chiesa Ziyi Guan Shahar Samocha and Eylon Yogev. 2023. Security Bounds for Proof-Carrying Data from Straightline Extractors. IACR Cryptol. ePrint Arch. (2023) 1646. https:\/\/eprint.iacr.org\/2023\/1646"},{"key":"e_1_3_2_1_40_1","volume-title":"Ward","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Psi Vesely, and Nicholas P. Ward. 2020. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In EUROCRYPT. 738--768."},{"key":"e_1_3_2_1_41_1","volume-title":"Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In EUROCRYPT. 769--793.","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa, Dev Ojha, and Nicholas Spooner. 2020. Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In EUROCRYPT. 769--793."},{"key":"e_1_3_2_1_42_1","unstructured":"Arka Rai Choudhuri Sanjam Garg Aarushi Goel Sruthi Sekar and Rohit Sinha. 2023. SublonK: Sublinear Prover PlonK. IACR Cryptol. ePrint Arch. (2023) 902. https:\/\/eprint.iacr.org\/2023\/902"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_44_1","volume-title":"Dubhe: Succinct Zero-Knowledge Proofs for Standard AES and related Applications. In USENIX Sec. 4373--4390.","author":"Ding Changchang","year":"2023","unstructured":"Changchang Ding and Yan Huang. 2023. Dubhe: Succinct Zero-Knowledge Proofs for Standard AES and related Applications. In USENIX Sec. 4373--4390."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Jens Ernstberger Stefanos Chaliasos George Kadianakis Sebastian Steinhorst Philipp Jovanovic Arthur Gervais Benjamin Livshits and Michele Orr\u00f9. 2023. zk-Bench: A Toolset for Comparative Evaluation and Performance Benchmarking of SNARKs. IACR Cryptol. ePrint Arch. (2023).","DOI":"10.1007\/978-3-031-71070-4_3"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2208.03567"},{"key":"e_1_3_2_1_47_1","volume-title":"Interactive Proofs and the Hardness of Approximating Cliques. J. ACM","author":"Feige Uriel","year":"1996","unstructured":"Uriel Feige, Shafi Goldwasser, L\u00e1szl\u00f3 Lov\u00e1sz, Shmuel Safra, and Mario Szegedy. 1996. Interactive Proofs and the Hardness of Approximating Cliques. J. ACM (1996), 268--292."},{"key":"e_1_3_2_1_48_1","volume-title":"Zen: An optimizing compiler for verifiable, zero-knowledge neural network inferences. Cryptology ePrint Archive","author":"Feng Boyuan","year":"2021","unstructured":"Boyuan Feng, Lianke Qin, Zhenfei Zhang, Yufei Ding, and Shumo Chu. 2021. Zen: An optimizing compiler for verifiable, zero-knowledge neural network inferences. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_49_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. 2019. Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019)."},{"key":"e_1_3_2_1_50_1","volume-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch.","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch. (2019), 953."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg Aarushi Goel Somesh Jha Saeed Mahloujifar Mohammad Mahmoody Guru-Vamsi Policharla and Mingyuan Wang. 2023. Experimenting with Zero-Knowledge Proofs of Training. In ACM CCS. 1880--1894.","DOI":"10.1145\/3576915.3623202"},{"key":"e_1_3_2_1_52_1","volume-title":"Yael Tauman Kalai, and Guy N. Rothblum","author":"Goldwasser Shafi","year":"2008","unstructured":"Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. 2008. Delegating computation: interactive proofs for muggles. In ACM STOC, Cynthia Dwork (Ed.). 113--122."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Shafi Goldwasser Silvio Micali and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In ACM STOC. 291--304.","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT. 305--326.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_55_1","volume-title":"https:\/\/businessoverbroadway.com\/2021\/02\/14\/machine-learning-algorithms-and-the-data-pros-who-use-them","author":"Hayes Bob","year":"2021","unstructured":"Bob Hayes. 2021. (2021). https:\/\/businessoverbroadway.com\/2021\/02\/14\/machine-learning-algorithms-and-the-data-pros-who-use-them."},{"key":"e_1_3_2_1_56_1","volume-title":"Delegating Computations with (Almost) Minimal Time and Space Overhead","author":"Holmgren Justin","unstructured":"Justin Holmgren and Ron Rothblum. 2018. Delegating Computations with (Almost) Minimal Time and Space Overhead. In IEEE FOCS. 124--135."},{"key":"e_1_3_2_1_57_1","volume-title":"zkMLaaS: a Verifiable Scheme for Machine Learning as a Service","author":"Huang Chenyu","unstructured":"Chenyu Huang, Jianzong Wang, Huangxun Chen, Shijing Si, Zhangcheng Huang, and Jing Xiao. 2022. zkMLaaS: a Verifiable Scheme for Machine Learning as a Service. In IEEE GLOBECOM. 5475--5480."},{"key":"e_1_3_2_1_58_1","volume-title":"Proof-of-Learning: Definitions and Practice","author":"Jia Hengrui","unstructured":"Hengrui Jia, Mohammad Yaghini, Christopher A. Choquette-Choo, Natalie Dullerud, Anvith Thudi, Varun Chandrasekaran, and Nicolas Papernot. 2021. Proof-of-Learning: Definitions and Practice. In IEEE SP. 1039--1056."},{"key":"e_1_3_2_1_59_1","volume-title":"Communication and Memory Efficient Parallel Decision Tree Construction. In SIAM International Conference on Data Mining. SIAM, 119--129","author":"Jin Ruoming","year":"2003","unstructured":"Ruoming Jin and Gagan Agrawal. 2003. Communication and Memory Efficient Parallel Decision Tree Construction. In SIAM International Conference on Data Mining. SIAM, 119--129."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_61_1","volume-title":"LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In Annual Conference on Neural Information Processing Systems. 3146--3154","author":"Ke Guolin","year":"2017","unstructured":"Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, and Tie-Yan Liu. 2017. LightGBM: A Highly Efficient Gradient Boosting Decision Tree. In Annual Conference on Neural Information Processing Systems. 3146--3154."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"crossref","unstructured":"Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In ACM STOC. 723--732.","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_63_1","volume-title":"Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. In CRYPTO. 359--388.","author":"Kothapalli Abhiram","year":"2022","unstructured":"Abhiram Kothapalli, Srinath T. V. Setty, and Ioanna Tzialla. 2022. Nova: Recursive Zero-Knowledge Arguments from Folding Schemes. In CRYPTO. 359--388."},{"key":"e_1_3_2_1_64_1","volume-title":"Dory: Efficient, transparent arguments for generalised inner products and polynomial commitments. In TCC. 1--34.","author":"Lee Jonathan","year":"2021","unstructured":"Jonathan Lee. 2021. Dory: Efficient, transparent arguments for generalised inner products and polynomial commitments. In TCC. 1--34."},{"key":"e_1_3_2_1_65_1","unstructured":"Seunghwa Lee Hankyung Ko Jihye Kim and Hyunok Oh. 2020. vCNN: Verifiable Convolutional Neural Network. IACR Cryptol. ePrint Arch. (2020). https:\/\/eprint.iacr.org\/2020\/584"},{"key":"e_1_3_2_1_66_1","volume-title":"vCNN: Verifiable convolutional neural network based on zk-snarks. Cryptology ePrint Archive","author":"Lee Seunghwa","year":"2020","unstructured":"Seunghwa Lee, Hankyung Ko, Jihye Kim, and Hyunok Oh. 2020. vCNN: Verifiable convolutional neural network based on zk-snarks. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_67_1","volume-title":"Annual Conference on Neural Information Processing Systems. 897--904","author":"Li Ping","year":"2007","unstructured":"Ping Li, Christopher J. C. Burges, and Qiang Wu. 2007. McRank: Learning to Rank Using Multiple Classification and Gradient Boosting. In Annual Conference on Neural Information Processing Systems. 897--904."},{"key":"e_1_3_2_1_68_1","volume-title":"Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch.","author":"Liu Tianyi","year":"2023","unstructured":"Tianyi Liu, Tiancheng Xie, Jiaheng Zhang, Dawn Song, and Yupeng Zhang. 2023. Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. (2023)."},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Tianyi Liu Xiang Xie and Yupeng Zhang. 2021. zkCNN: Zero Knowledge Proofs for Convolutional Neural Network Predictions and Accuracy. In CCS. ACM 2968--2985.","DOI":"10.1145\/3460120.3485379"},{"key":"e_1_3_2_1_70_1","volume-title":"Algebraic Methods for Interactive Proof Systems. J. ACM","author":"Lund Carsten","year":"1992","unstructured":"Carsten Lund, Lance Fortnow, Howard J. Karloff, and Noam Nisan. 1992. Algebraic Methods for Interactive Proof Systems. J. ACM (1992), 859--868."},{"key":"e_1_3_2_1_71_1","unstructured":"Amit Raja Naik. 2021. Solving Machine Learning Problems On Kaggle Vs Real Life. (2021). https:\/\/analyticsindiamag.com\/solving-machine-learning-problems-on-kaggle-vs-real-life."},{"key":"e_1_3_2_1_72_1","volume-title":"Mangrove: A Scalable Framework for Folding-based SNARKs. IACR Cryptol. ePrint Arch.","author":"Nguyen Wilson D.","year":"2024","unstructured":"Wilson D. Nguyen, Trisha Datta, Binyi Chen, Nirvan Tyagi, and Dan Boneh. 2024. Mangrove: A Scalable Framework for Folding-based SNARKs. IACR Cryptol. ePrint Arch. (2024), 416."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--36594--2_13"},{"key":"e_1_3_2_1_74_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In IEEE SP. 238--252."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856449"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"crossref","unstructured":"J. Ross Quinlan. 1986. Induction of Decision Trees. Mach. Learn. (1986) 81--106.","DOI":"10.1023\/A:1022643204877"},{"key":"e_1_3_2_1_77_1","unstructured":"J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann."},{"key":"e_1_3_2_1_78_1","volume-title":"Book Review: C4.5: Programs for Machine Learning by J. Ross Quinlan","author":"Salzberg Steven","year":"1994","unstructured":"Steven Salzberg. 1994. Book Review: C4.5: Programs for Machine Learning by J. Ross Quinlan. Morgan Kaufmann Publishers, Inc., 1993. Mach. Learn. (1994), 235--240."},{"key":"e_1_3_2_1_79_1","volume-title":"Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty and Jonathan Lee. 2020. Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_80_1","volume-title":"Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO. 704--737.","author":"Setty Srinath T. V.","year":"2020","unstructured":"Srinath T. V. Setty. 2020. Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO. 704--737."},{"key":"e_1_3_2_1_81_1","volume-title":"Setty and Jonathan Lee","author":"Srinath T.","year":"2020","unstructured":"Srinath T. V. Setty and Jonathan Lee. 2020. Quarks: Quadruple-efficient transparent zkSNARKs. IACR Cryptol. ePrint Arch. (2020)."},{"key":"e_1_3_2_1_82_1","volume-title":"Wahby","author":"Setty Srinath T. V.","year":"2023","unstructured":"Srinath T. V. Setty, Justin Thaler, and Riad S. Wahby. 2023. Unlocking the lookup singularity with Lasso. IACR Cryptol. ePrint Arch. (2023), 1216."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"crossref","unstructured":"Justin Thaler. 2013. Time-Optimal Interactive Proofs for Circuit Evaluation. In CRYPTO. 71--89.","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_1_84_1","volume-title":"Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs. Post-Quantum ZK-SNARKs on a Browser","author":"Venkitasubramaniam Muthuramakrishnan","year":"2023","unstructured":"Muthuramakrishnan Venkitasubramaniam. 2023. Ligetron: Lightweight Scalable End-to-End Zero-Knowledge Proofs. Post-Quantum ZK-SNARKs on a Browser. In IEEE SP. 86--86."},{"key":"e_1_3_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133984"},{"key":"e_1_3_2_1_86_1","volume-title":"Doubly-Efficient zkSNARKs Without Trusted Setup","author":"Wahby Riad S.","unstructured":"Riad S. Wahby, Ioanna Tzialla, Abhi Shelat, Justin Thaler, and Michael Walfish. 2018. Doubly-Efficient zkSNARKs Without Trusted Setup. In IEEE SP. 926--943."},{"key":"e_1_3_2_1_87_1","volume-title":"ezDPS: An Efficient and Zero-Knowledge Machine Learning Inference Pipeline. arXiv preprint arXiv:2212.05428","author":"Wang Haodi","year":"2022","unstructured":"Haodi Wang and Thang Hoang. 2022. ezDPS: An Efficient and Zero-Knowledge Machine Learning Inference Pipeline. arXiv preprint arXiv:2212.05428 (2022)."},{"key":"e_1_3_2_1_88_1","first-page":"501","volume-title":"USENIX Sec.","author":"Weng Chenkai","year":"2021","unstructured":"Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang. 2021. Mystique: Efficient conversions for Zero-Knowledge proofs with applications to machine learning. In USENIX Sec., pp. 501--518."},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"crossref","unstructured":"Tiancheng Xie Jiaheng Zhang Zerui Cheng Fan Zhang Yupeng Zhang Yongzheng Jia Dan Boneh and Dawn Song. 2022. zkbridge: Trustless cross-chain bridges made practical. In ACM CCS. 3003--3017.","DOI":"10.1145\/3548606.3560652"},{"key":"e_1_3_2_1_90_1","volume-title":"Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO. 733--764.","author":"Xie Tiancheng","year":"2019","unstructured":"Tiancheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO. 733--764."},{"key":"e_1_3_2_1_91_1","volume-title":"Orion: Zero knowledge proof with linear prover time. In CRYPTO. 299--328.","author":"Xie Tiancheng","year":"2022","unstructured":"Tiancheng Xie, Yupeng Zhang, and Dawn Song. 2022. Orion: Zero knowledge proof with linear prover time. In CRYPTO. 299--328."},{"key":"e_1_3_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417278"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"crossref","unstructured":"Jiaheng Zhang Tianyi Liu Weijie Wang Yinuo Zhang Dawn Song Xiang Xie and Yupeng Zhang. 2021. Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time. In CCS. ACM 159--177.","DOI":"10.1145\/3460120.3484767"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"},{"key":"e_1_3_2_1_95_1","volume-title":"Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof","author":"Zhang Jiaheng","unstructured":"Jiaheng Zhang, Tiancheng Xie, Yupeng Zhang, and Dawn Song. 2020. Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof. In IEEE SP. 859--876."},{"key":"e_1_3_2_1_96_1","volume-title":"vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases","author":"Zhang Yupeng","unstructured":"Yupeng Zhang, Daniel Genkin, Jonathan Katz, Dimitrios Papadopoulos, and Charalampos Papamanthou. 2017. vSQL: Verifying Arbitrary SQL Queries over Dynamic Outsourced Databases. In IEEE SP. 863--880."},{"key":"e_1_3_2_1_97_1","volume-title":"vRAM: Faster verifiable RAM with program-independent preprocessing","author":"Zhang Yupeng","unstructured":"Yupeng Zhang, Daniel Genkin, Jonathan Katz, Dimitrios Papadopoulos, and Charalampos Papamanthou. 2018. vRAM: Faster verifiable RAM with program-independent preprocessing. In SP. IEEE, 908--925."},{"key":"e_1_3_2_1_98_1","volume-title":"Veriml: Enabling integrity assurances and fair payments for machine learning as a service","author":"Zhao Lingchen","year":"2021","unstructured":"Lingchen Zhao, Qian Wang, Cong Wang, Qi Li, Chao Shen, and Bo Feng. 2021. Veriml: Enabling integrity assurances and fair payments for machine learning as a service. IEEE Transactions on Parallel and Distributed Systems (2021), 2524--2540."}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"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.3690318","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:08:26Z","timestamp":1755842906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":98,"alternative-id":["10.1145\/3658644.3690318","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690318","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"}}]}}