{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T09:31:40Z","timestamp":1774690300329,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T00:00:00Z","timestamp":1763769600000},"content-version":"vor","delay-in-days":3,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2236819,2318975"],"award-info":[{"award-number":["2236819,2318975"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Goole Research Awards"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,19]]},"DOI":"10.1145\/3719027.3744862","type":"proceedings-article","created":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T23:33:16Z","timestamp":1763854396000},"page":"1173-1187","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Founding Zero-Knowledge Proof of Training on Optimum Vicinity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-8234-0520","authenticated-orcid":false,"given":"Gefei","family":"Tan","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1807-8311","authenticated-orcid":false,"given":"Adria","family":"Gascon","sequence":"additional","affiliation":[{"name":"Google LLC, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5671-1395","authenticated-orcid":false,"given":"Sarah","family":"Meiklejohn","sequence":"additional","affiliation":[{"name":"Google LLC, New York, USA and University College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1744-4025","authenticated-orcid":false,"given":"Mariana","family":"Raykova","sequence":"additional","affiliation":[{"name":"Google LLC, New York, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5991-7417","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0638-037X","authenticated-orcid":false,"given":"Ning","family":"Luo","sequence":"additional","affiliation":[{"name":"UIUC, Champaign, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3670316"},{"key":"e_1_3_2_1_2_1","volume-title":"USENIX Security","author":"Angel Sebastian","year":"2022","unstructured":"Sebastian Angel, Andrew J. Blumberg, Eleftherios Ioannidis, and Jess Woods. 2022. Efficient Representation of Numerical Optimization Problems for SNARKs. In USENIX Security 2022, Kevin R. B. Butler and Kurt Thomas (Eds.). USENIX Association, 4273-4290. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/angel"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression","volume":"15","author":"Bach Francis","year":"2014","unstructured":"Francis Bach. 2014. Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression. J. Mach. Learn. Res., Vol. 15, 1 (Jan. 2014), 595\u2013627.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_1_4_1","volume-title":"Neural Spectrahedra and Semidefinite Lifts: Global Convex Optimization of Polynomial Activation Neural Networks in Fully Polynomial-Time. CoRR","author":"Bartan Burak","year":"2021","unstructured":"Burak Bartan and Mert Pilanci. 2021. Neural Spectrahedra and Semidefinite Lifts: Global Convex Optimization of Polynomial Activation Neural Networks in Fully Polynomial-Time. CoRR, Vol. abs\/2101.02429 (2021). https:\/\/arxiv.org\/abs\/2101.02429"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484812"},{"key":"e_1_3_2_1_6_1","volume-title":"CRYPTO","volume":"358","author":"Baum Carsten","year":"2022","unstructured":"Carsten Baum, Lennart Braun, Alexander Munch-Hansen, and Peter Scholl. 2022. MozZ_2^karella: Efficient Vector-OLE and Zero-Knowledge Proofs over Z_2^k. In CRYPTO 2022, Part IV (LNCS, Vol. 13510), Yevgeniy Dodis and Thomas Shrimpton (Eds.). Springer, Cham, 329-358."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.24432\/C5XW20"},{"key":"e_1_3_2_1_9_1","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2018. Scalable transparent and post-quantum secure computational integrity. Cryptology ePrint Archive Report 2018\/046. https:\/\/eprint.iacr.org\/2018\/046"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"e_1_3_2_1_12_1","volume-title":"Convex optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press."},{"key":"e_1_3_2_1_13_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 315-334","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 315-334."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_15_1","volume-title":"EUROCRYPT","volume":"768","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 2020, Part I (LNCS, Vol. 12105), Anne Canteaut and Yuval Ishai (Eds.). Springer, Cham, 738-768."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 37th International Conference on Neural Information Processing Systems","author":"Choi Dami","year":"2024","unstructured":"Dami Choi, Yonadav Shavit, and David Duvenaud. 2024. Tools for verifying neural models' training data. In Proceedings of the 37th International Conference on Neural Information Processing Systems (New Orleans, LA, USA) (NIPS '23). Curran Associates Inc., Red Hook, NY, USA, Article 56, 35 pages."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559385"},{"key":"e_1_3_2_1_18_1","volume-title":"International Conference on Machine Learning. PMLR, 2993-3003","author":"Ergen Tolga","year":"2021","unstructured":"Tolga Ergen and Mert Pilanci. 2021a. Global optimality beyond two layers: Training deep relu networks via convex programs. In International Conference on Machine Learning. PMLR, 2993-3003."},{"key":"e_1_3_2_1_19_1","volume-title":"Architectures: Convex Optimization of Two- and Three-Layer Networks in Polynomial Time. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=0N8jUH4JMv6","author":"Ergen Tolga","year":"2021","unstructured":"Tolga Ergen and Mert Pilanci. 2021b. Implicit Convex Regularizers of CNN, Architectures: Convex Optimization of Two- and Three-Layer Networks in Polynomial Time. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=0N8jUH4JMv6"},{"key":"e_1_3_2_1_20_1","first-page":"186","article-title":"How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO'86 (LNCS, Vol. 263), Andrew M. Odlyzko (Ed.). Springer, Berlin","author":"Fiat Amos","year":"1987","unstructured":"Amos Fiat and Adi Shamir. 1987. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO'86 (LNCS, Vol. 263), Andrew M. Odlyzko (Ed.). Springer, Berlin, Heidelberg, 186-194.","journal-title":"Heidelberg"},{"key":"e_1_3_2_1_21_1","volume-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Report 2019\/953. https:\/\/eprint.iacr.org\/2019\/953","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, Report 2019\/953. https:\/\/eprint.iacr.org\/2019\/953"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623202"},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"Ghodsi Zahra","year":"2017","unstructured":"Zahra Ghodsi, Tianyu Gu, and Siddharth Garg. 2017. SafetyNets: verifiable execution of deep neural networks on an untrusted cloud. In Proceedings of the 31st International Conference on Neural Information Processing Systems (Long Beach, California, USA) (NIPS'17). Curran Associates Inc., Red Hook, NY, USA, 4675\u20134684."},{"key":"e_1_3_2_1_24_1","volume-title":"17th","author":"Goldwasser Shafi","unstructured":"Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In 17th ACM STOC. ACM Press, 291-304."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_26_1","volume-title":"USENIX Security","author":"Grubbs Paul","year":"2022","unstructured":"Paul Grubbs, Arasu Arun, Ye Zhang, Joseph Bonneau, and Michael Walfish. 2022. Zero-Knowledge Middleboxes. In USENIX Security 2022, Kevin R. B. Butler and Kurt Thomas (Eds.). USENIX Association, 4255-4272. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/grubbs"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502106"},{"key":"e_1_3_2_1_28_1","volume-title":"Rene Peralta, and Harold Booth.","author":"Kelsey John","year":"2019","unstructured":"John Kelsey, Lu\u00eds TAN Brand ao, Rene Peralta, and Harold Booth. 2019. A reference for randomness beacons: Format and protocol version 2. Technical Report. National Institute of Standards and Technology."},{"key":"e_1_3_2_1_29_1","unstructured":"SCIPR Lab. 2017. libsnark: a C library for zkSNARK proofs. https:\/\/github.com\/scipr-lab\/libsnark"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3348760"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623134"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559373"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70890-9_12"},{"key":"e_1_3_2_1_34_1","volume-title":"ACM CCS","author":"Mohassel Payman","year":"2018","unstructured":"Payman Mohassel and Peter Rindal. 2018. ABY^3: A Mixed Protocol Framework for Machine Learning. In ACM CCS 2018, David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang (Eds.). ACM Press, 35-52."},{"key":"e_1_3_2_1_35_1","volume-title":"SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 19-38","author":"Mohassel Payman","year":"2017","unstructured":"Payman Mohassel and Yupeng Zhang. 2017. SecureML: A System for Scalable Privacy-Preserving Machine Learning. In 2017 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 19-38."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","unstructured":"S. Moro P. Rita and P. Cortez. 2014. Bank Marketing. UCI Machine Learning Repository. DOI: https:\/\/doi.org\/10.24432\/C5K306.","DOI":"10.24432\/C5K306"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-014-0194-2"},{"key":"e_1_3_2_1_38_1","unstructured":"Joann Peeler. 2024. Chess Engine Training Data. https:\/\/www.kaggle.com\/datasets\/joannpeeler\/labeled-chess-positions-109m-csv-format\/. Kaggle."},{"key":"e_1_3_2_1_39_1","volume-title":"International Conference on Machine Learning. PMLR, 7695-7705","author":"Pilanci Mert","year":"2020","unstructured":"Mert Pilanci and Tolga Ergen. 2020. Neural networks are convex regularizers: Exact polynomial-time convex optimization formulations for two-layer networks. In International Conference on Machine Learning. PMLR, 7695-7705."},{"key":"e_1_3_2_1_40_1","unstructured":"Kamil Pytlak. 2023. 2022 Annual CDC Survey Data on Indicators of Heart Disease. https:\/\/www.kaggle.com\/datasets\/kamilpytlak\/personal-key-indicators-of-heart-disease. Kaggle."},{"key":"e_1_3_2_1_41_1","volume-title":"Zero Knowledge Arguments for Verifiable Sampling. In NeurIPS 2021 Workshop Privacy in Machine Learning. https:\/\/openreview.net\/forum?id=YS47RZFtKm","author":"Sabater C\u00e9sar","year":"2021","unstructured":"C\u00e9sar Sabater and Jan Ramon. 2021. Zero Knowledge Arguments for Verifiable Sampling. In NeurIPS 2021 Workshop Privacy in Machine Learning. https:\/\/openreview.net\/forum?id=YS47RZFtKm"},{"key":"e_1_3_2_1_42_1","volume-title":"Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutions. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=e2Lle5cij9D","author":"Sahiner Arda","year":"2022","unstructured":"Arda Sahiner, Tolga Ergen, Batu Ozturkler, Burak Bartan, John M. Pauly, Morteza Mardani, and Mert Pilanci. 2022a. Hidden Convexity of Wasserstein GANs: Interpretable Generative Models with Closed-Form Solutions. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=e2Lle5cij9D"},{"key":"e_1_3_2_1_43_1","volume-title":"International Conference on Machine Learning. PMLR","author":"Sahiner Arda","year":"2022","unstructured":"Arda Sahiner, Tolga Ergen, Batu Ozturkler, John Pauly, Morteza Mardani, and Mert Pilanci. 2022b. Unraveling attention via convex duality: Analysis and interpretations of vision transformers. In International Conference on Machine Learning. PMLR, 19050-19088."},{"key":"e_1_3_2_1_44_1","volume-title":"Confidential-DPproof: Confidential Proof of Differentially Private Training. In International Conference on Learning Representations (ICLR).","author":"Shamsabadi Ali Shahin","year":"2024","unstructured":"Ali Shahin Shamsabadi, Gefei Tan, Tudor Ioan Cebere, Aur\u00e9lien Bellet, Hamed Haddadi, Nicolas Papernot, Xiao Wang, and Adrian Weller. 2024. Confidential-DPproof: Confidential Proof of Differentially Private Training. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_45_1","volume-title":"The Eleventh International Conference on Learning Representations.","author":"Shamsabadi Ali Shahin","year":"2022","unstructured":"Ali Shahin Shamsabadi, Sierra Calanda Wyllie, Nicholas Franzese, Natalie Dullerud, S\u00e9bastien Gambs, Nicolas Papernot, Xiao Wang, and Adrian Weller. 2022. Confidential-PROFITT: confidential PROof of fair training of trees. In The Eleventh International Conference on Learning Representations."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1841-6"},{"key":"e_1_3_2_1_47_1","volume-title":"The Thirty-eighth Annual Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=bf0MdFlz1i","author":"Srivastava Megha","year":"2024","unstructured":"Megha Srivastava, Simran Arora, and Dan Boneh. 2024. Optimistic Verifiable Training by Controlling Hardware Nondeterminism. In The Thirty-eighth Annual Conference on Neural Information Processing Systems. https:\/\/openreview.net\/forum?id=bf0MdFlz1i"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3520863"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Gefei Tan Adri\u00e0 Gasc\u00f3n Sarah Meiklejohn Mariana Raykova Xiao Wang and Ning Luo. 2025. Founding Zero-Knowledge Proofs of Training on Optimum Vicinity. Cryptology ePrint Archive Report 2025\/053. https:\/\/eprint.iacr.org\/2025\/053","DOI":"10.1145\/3719027.3744862"},{"key":"e_1_3_2_1_50_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016. EMP-Toolkit: Efficient Multiparty Computation Toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_51_1","article-title":"Distance metric learning for large margin nearest neighbor classification","volume":"10","author":"Weinberger Kilian Q","year":"2009","unstructured":"Kilian Q Weinberger and Lawrence K Saul. 2009. Distance metric learning for large margin nearest neighbor classification. Journal of machine learning research, Vol. 10, 2 (2009).","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_1_52_1","volume-title":"Mystique: Efficient Conversions for Zero-Knowledge Proofs with Applications to Machine Learning. In USENIX Security","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 Security 2021, Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association, 501-518. https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/weng"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560667"},{"key":"e_1_3_2_1_54_1","unstructured":"Zhibo Xing Zijian Zhang Meng Li Jiamou Liu Liehuang Zhu Giovanni Russello and Muhammad Rizwan Asghar. 2023. Zero-Knowledge Proof-based Practical Federated Learning on Blockchain. arXiv:2304.05590 [cs.CR] https:\/\/arxiv.org\/abs\/2304.05590"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484556"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956786"},{"key":"e_1_3_2_1_57_1","volume-title":"On the fenchel duality between strong convexity and lipschitz continuous gradient. arXiv preprint arXiv:1803.06573","author":"Zhou Xingyu","year":"2018","unstructured":"Xingyu Zhou. 2018. On the fenchel duality between strong convexity and lipschitz continuous gradient. arXiv preprint arXiv:1803.06573 (2018)."}],"event":{"name":"CCS '25: ACM SIGSAC Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"CCS '25","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3744862","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3719027.3744862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:16:12Z","timestamp":1766441772000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3719027.3744862"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,19]]},"references-count":57,"alternative-id":["10.1145\/3719027.3744862","10.1145\/3719027"],"URL":"https:\/\/doi.org\/10.1145\/3719027.3744862","relation":{},"subject":[],"published":{"date-parts":[[2025,11,19]]},"assertion":[{"value":"2025-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}