{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,3]],"date-time":"2026-09-03T15:22:47Z","timestamp":1788448967576,"version":"build-2803163510"},"reference-count":80,"publisher":"Association for Computing Machinery (ACM)","issue":"9","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:p>Federated Learning (FL) emerges as a viable solution to facilitate data collaboration, enabling multiple clients to collaboratively train a machine learning (ML) model under the supervision of a central server while ensuring the confidentiality of their raw data. However, existing studies have unveiled two main risks: (i) the potential for the server to infer sensitive information from the client's uploaded updates (i.e., model gradients), compromising client input privacy, and (ii) the risk of malicious clients uploading malformed updates to poison the FL model, compromising input integrity. Recent works utilize secure aggregation with zero-knowledge proofs (ZKP) to guarantee input privacy and integrity in FL. Nevertheless, they suffer from extremely low efficiency and, thus, are impractical for real deployment. In this paper, we propose a novel and highly efficient approach RiseFL for secure and verifiable data collaboration, ensuring input privacy and integrity simultaneously. Firstly, we devise a probabilistic integrity check method that transforms strict checks into a hypothesis test problem, offering great optimization opportunities. Secondly, we introduce a hybrid commitment scheme to satisfy Byzantine robustness with improved performance. Thirdly, we present an optimized ZKP generation and verification technique that significantly reduces the ZKP cost based on probabilistic integrity checks. Furthermore, we theoretically prove the security guarantee of RiseFL and provide a cost analysis compared to state-of-the-art baselines. Extensive experiments on synthetic and real-world datasets suggest that our approach is effective and highly efficient in both client computation and communication. For instance, RiseFL is up to 28x, 53x, and 164x faster than baselines ACORN, RoFL, and EIFFeL for the client computation.<\/jats:p>","DOI":"10.14778\/3665844.3665860","type":"journal-article","created":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T18:19:07Z","timestamp":1722968347000},"page":"2321-2334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Secure and Verifiable Data Collaboration with Low-Cost Zero-Knowledge Proofs"],"prefix":"10.14778","volume":"17","author":[{"given":"Yizheng","family":"Zhu","sequence":"first","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuncheng","family":"Wu","sequence":"additional","affiliation":[{"name":"Renmin University of China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhaojing","family":"Luo","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2016. Regulation (eu) 2016\/679 of the european parliament and of the council of 27 april 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data and repealing directive 95\/46\/ec (general data protection regulation). (2016)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"6679","DOI":"10.1609\/aaai.v35i8.16826","article-title":"Tabnet: Attentive interpretable tabular learning","volume":"35","author":"Arik Sercan","year":"2021","unstructured":"Sercan \u00d6 Arik and Tomas Pfister. 2021. Tabnet: Attentive interpretable tabular learning. In AAAI, Vol. 35. 6679--6687.","journal-title":"AAAI"},{"key":"e_1_2_1_3_1","unstructured":"Eugene Bagdasaryan Andreas Veit Yiqing Hua Deborah Estrin and Vitaly Shmatikov. 2020. How To Backdoor Federated Learning. In AISTATS. 2938--2948."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"2348","DOI":"10.14778\/3551793.3551798","article-title":"Skellam Mixture Mechanism: a Novel Approach to Federated Learning with Differential Privacy","volume":"15","author":"Bao Ergute","year":"2022","unstructured":"Ergute Bao, Yizheng Zhu, Xiaokui Xiao, Yin Yang, Beng Chin Ooi, Benjamin Hong Meng Tan, and Khin Mi Mi Aung. 2022. Skellam Mixture Mechanism: a Novel Approach to Federated Learning with Differential Privacy. Proc. VLDB Endow. 15, 11 (2022), 2348--2360.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_5_1","volume-title":"Sebastian Benjamin Wrede, and Steffen Zeuch.","author":"Baunsgaard Sebastian","year":"2021","unstructured":"Sebastian Baunsgaard, Matthias Boehm, Ankit Chaudhary, Behrouz Derakhshan, Stefan Gei\u00dfels\u00f6der, Philipp M. Grulich, Michael Hildebrand, Kevin Innerebner, Volker Markl, Claus Neubauer, Sarah Osterburg, Olga Ovcharenko, Sergey Redyuk, Tobias Rieger, Alireza Rezaei Mahdiraji, Sebastian Benjamin Wrede, and Steffen Zeuch. 2021. ExDRa: Exploratory Data Science on Federated Raw Data. In SIGMOD. ACM, 2450--2463."},{"key":"e_1_2_1_6_1","first-page":"4805","article-title":"{ACORN}","volume":"23","author":"Bell James","year":"2023","unstructured":"James Bell, Adri\u00e0 Gasc\u00f3n, Tancr\u00e8de Lepoint, Baiyu Li, Sarah Meiklejohn, Mariana Raykova, and Cathie Yun. 2023. {ACORN}: Input Validation for Secure Aggregation. In USENIX Security 23. 4805--4822.","journal-title":"Input Validation for Secure Aggregation. In USENIX Security"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"James Henry Bell Kallista A. Bonawitz Adri\u00e0 Gasc\u00f3n Tancr\u00e8de Lepoint and Mariana Raykova. 2020. Secure Single-Server Aggregation with (Poly)Logarithmic Overhead. In CCS. 1253--1269.","DOI":"10.1145\/3372297.3417885"},{"key":"e_1_2_1_8_1","volume-title":"SNARKs for C: Verifying program executions succinctly and in zero knowledge","author":"Ben-Sasson Eli","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, and Madars Virza. 2013. SNARKs for C: Verifying program executions succinctly and in zero knowledge. In CRYPTO. Springer, 90--108."},{"key":"e_1_2_1_9_1","volume-title":"Calo","author":"Bhagoji Arjun Nitin","year":"2019","unstructured":"Arjun Nitin Bhagoji, Supriyo Chakraborty, Prateek Mittal, and Seraphin B. Calo. 2019. Analyzing Federated Learning through an Adversarial Lens. In ICML. 634--643."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","unstructured":"Jock Blackard. 1998. Covertype. UCI Machine Learning Repository. 10.24432\/C50K5N","DOI":"10.24432\/C50K5N"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Manuel Blum Paul Feldman and Silvio Micali. 1988. Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract). In STOC. 103--112.","DOI":"10.1145\/62212.62222"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Keith Bonawitz Vladimir Ivanov Ben Kreuter Antonio Marcedone H Brendan McMahan Sarvar Patel Daniel Ramage Aaron Segal and Karn Seth. 2017. Practical secure aggregation for privacy-preserving machine learning. In CCS. 1175--1191.","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_2_1_13_1","volume-title":"Bulletproofs: Short proofs for confidential transactions and more. In S&P","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 S&P. IEEE, 315--334."},{"key":"e_1_2_1_15_1","unstructured":"Xiaoyu Cao Minghong Fang Jia Liu and Neil Zhenqiang Gong. 2021. FLTrust: Byzantine-robust Federated Learning via Trust Bootstrapping. In NDSS."},{"key":"e_1_2_1_16_1","volume-title":"Prio: Private, Robust, and Scalable Computation of Aggregate Statistics.. In NSDI. 259--282.","author":"Corrigan-Gibbs Henry","year":"2017","unstructured":"Henry Corrigan-Gibbs and Dan Boneh. 2017. Prio: Private, Robust, and Scalable Computation of Aggregate Statistics.. In NSDI. 259--282."},{"key":"e_1_2_1_17_1","unstructured":"Georgios Damaskinos Rachid Guerraoui Rhicheek Patra Mahsa Taziki et al. 2018. Asynchronous Byzantine machine learning (the case of SGD). In ICML. PMLR 1145--1154."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Mads Jurik. 2001. A Generalisation a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In Public Key Cryptography. 119--136.","DOI":"10.1007\/3-540-44586-2_9"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Zhenan Fan Huang Fang Zirui Zhou Jian Pei Michael P. Friedlander Changxin Liu and Yong Zhang. 2022. Improving Fairness for Data Valuation in Horizontal Federated Learning. In ICDE. 2440--2453.","DOI":"10.1109\/ICDE53745.2022.00228"},{"key":"e_1_2_1_20_1","volume-title":"A practical scheme for non-interactive verifiable secret sharing","author":"Feldman Paul","unstructured":"Paul Feldman. 1987. A practical scheme for non-interactive verifiable secret sharing. In FOCS. IEEE, 427--438."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Fangcheng Fu Yingxia Shao Lele Yu Jiawei Jiang Huanran Xue Yangyu Tao and Bin Cui. 2021. VF2 Boost: Very Fast Vertical Federated Gradient Boosting for Cross-Enterprise Learning. In SIGMOD Guoliang Li Zhanhuai Li Stratos Idreos and Divesh Srivastava (Eds.). ACM 563--576.","DOI":"10.1145\/3448016.3457241"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Fangcheng Fu Huanran Xue Yong Cheng Yangyu Tao and Bin Cui. 2022. BlindFL: Vertical Federated Machine Learning without Peeking into Your Data. In SIGMOD. 1316--1330.","DOI":"10.1145\/3514221.3526127"},{"key":"e_1_2_1_23_1","first-page":"1","volume-title":"Proc. ACM Manag. Data 1","author":"Fu Rui","year":"2023","unstructured":"Rui Fu, Yuncheng Wu, Quanqing Xu, and Meihui Zhang. 2023. FEAST: A Communication-efficient Federated Feature Selection Framework for Relational Data. Proc. ACM Manag. Data 1, 1 (2023), 107:1--107:28."},{"key":"e_1_2_1_24_1","volume-title":"Mitigating Sybils in Federated Learning Poisoning. CoRR abs\/1808.04866","author":"Fung Clement","year":"2018","unstructured":"Clement Fung, Chris J. M. Yoon, and Ivan Beschastnikh. 2018. Mitigating Sybils in Federated Learning Poisoning. CoRR abs\/1808.04866 (2018)."},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","article-title":"A public key cryptosystem and a signature scheme based on discrete logarithms","volume":"31","author":"Gamal Taher El","year":"1985","unstructured":"Taher El Gamal. 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 4 (1985), 469--472.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"e_1_2_1_26_1","volume-title":"Quadratic span programs and succinct NIZKs without PCPs","author":"Gennaro Rosario","unstructured":"Rosario Gennaro, Craig Gentry, Bryan Parno, and Mariana Raykova. 2013. Quadratic span programs and succinct NIZKs without PCPs. In EUROCRYPT. Springer, 626--645."},{"key":"e_1_2_1_27_1","volume-title":"Practical non-interactive publicly verifiable secret sharing with thousands of parties","author":"Gentry Craig","unstructured":"Craig Gentry, Shai Halevi, and Vadim Lyubashevsky. 2022. Practical non-interactive publicly verifiable secret sharing with thousands of parties. In EURO-CRYPT. Springer, 458--487."},{"key":"e_1_2_1_28_1","volume-title":"The Foundations of Cryptography - Volume 1: Basic Techniques","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2001. The Foundations of Cryptography - Volume 1: Basic Techniques. Cambridge University Press."},{"key":"e_1_2_1_29_1","unstructured":"The Ristretto Group. [n.d.]. https:\/\/ristretto.group\/."},{"key":"e_1_2_1_30_1","unstructured":"Jamie Hayes and Olga Ohrimenko. 2018. Contamination Attacks and Mitigation in Multi-Party Machine Learning. In NeurIPS. 6604--6616."},{"key":"e_1_2_1_31_1","unstructured":"Kaiming He Xiangyu Zhang Shaoqing Ren and Jian Sun. 2016. Deep Residual Learning for Image Recognition. In CVPR. 770--778."},{"key":"e_1_2_1_32_1","unstructured":"Peter Kairouz Ziyu Liu and Thomas Steinke. 2021. The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregation. In ICML. 5201--5212."},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller. 2020. MP-SPDZ: A Versatile Framework for Multi-Party Computation. In CCS. 1575--1590.","DOI":"10.1145\/3372297.3417872"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1609\/aaai.v33i01.33011544","article-title":"RSA: Byzantine-robust stochastic aggregation methods for distributed learning from heterogeneous datasets","volume":"33","author":"Li Liping","year":"2019","unstructured":"Liping Li, Wei Xu, Tianyi Chen, Georgios B Giannakis, and Qing Ling. 2019. RSA: Byzantine-robust stochastic aggregation methods for distributed learning from heterogeneous datasets. In AAAI, Vol. 33. 1544--1551.","journal-title":"AAAI"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Qinbin Li Yiqun Diao Quan Chen and Bingsheng He. 2022. Federated Learning on Non-IID Data Silos: An Experimental Study. In ICDE. 965--978.","DOI":"10.1109\/ICDE53745.2022.00077"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.14778\/3594512.3594513","article-title":"ZKSQL: Verifiable and Efficient Query Evaluation with Zero-Knowledge Proofs","volume":"16","author":"Li Xiling","year":"2023","unstructured":"Xiling Li, Chenkai Weng, Yongxin Xu, Xiao Wang, and Jennie Rogers. 2023. ZKSQL: Verifiable and Efficient Query Evaluation with Zero-Knowledge Proofs. Proc. VLDB Endow. 16, 8 (2023), 1804--1816.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_37_1","unstructured":"Libsodium. [n.d.]. https:\/\/doc.libsodium.org\/."},{"key":"e_1_2_1_38_1","first-page":"828","article-title":"Projected Federated Averaging with Heterogeneous Differential Privacy","volume":"15","author":"Liu Junxu","year":"2021","unstructured":"Junxu Liu, Jian Lou, Li Xiong, Jinfei Liu, and Xiaofeng Meng. 2021. Projected Federated Averaging with Heterogeneous Differential Privacy. PVLDB 15, 4 (2021), 828--840.","journal-title":"PVLDB"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","first-page":"388","DOI":"10.14778\/3494124.3494125","article-title":"Enabling SQL-based Training Data Debugging for Federated Learning","volume":"15","author":"Liu Yejia","year":"2021","unstructured":"Yejia Liu, Weiyuan Wu, Lampros Flokas, Jiannan Wang, and Eugene Wu. 2021. Enabling SQL-based Training Data Debugging for Federated Learning. Proc. VLDB Endow. 15, 3 (2021), 388--400.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_40_1","first-page":"1","volume-title":"Proc. ACM Manag. Data 1","author":"Luo Zhaojing","year":"2023","unstructured":"Zhaojing Luo, Shaofeng Cai, Yatong Wang, and Beng Chin Ooi. 2023. Regularized Pairwise Relationship based Analytics for Structured Data. Proc. ACM Manag. Data 1, 1 (2023), 82:1--82:27. 10.1145\/3588936"},{"key":"e_1_2_1_41_1","volume-title":"Rofl: Robustness of secure federated learning. In S&P","author":"Lycklama Hidde","year":"2023","unstructured":"Hidde Lycklama, Lukas Burkhalter, Alexander Viand, Nicolas K\u00fcchler, and Anwar Hithnawi. 2023. Rofl: Robustness of secure federated learning. In S&P. IEEE, 453--476."},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","first-page":"3690","DOI":"10.1109\/TPDS.2022.3167434","article-title":"Differentially Private Byzantine-Robust Federated Learning","volume":"33","author":"Ma Xu","year":"2022","unstructured":"Xu Ma, Xiaoqian Sun, Yuduo Wu, Zheli Liu, Xiaofeng Chen, and Changyu Dong. 2022. Differentially Private Byzantine-Robust Federated Learning. IEEE Trans. Parallel Distributed Syst. 33, 12 (2022), 3690--3701.","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"e_1_2_1_43_1","unstructured":"Brendan McMahan Eider Moore Daniel Ramage Seth Hampson and Blaise Aguera y Arcas. 2017. Communication-efficient learning of deep networks from decentralized data. In AISTATS. 1273--1282."},{"key":"e_1_2_1_44_1","volume-title":"Emiliano De Cristofaro, and Vitaly Shmatikov","author":"Melis Luca","year":"2019","unstructured":"Luca Melis, Congzheng Song, Emiliano De Cristofaro, and Vitaly Shmatikov. 2019. Exploiting Unintended Feature Leakage in Collaborative Learning. In S&P. 691--706."},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1145\/359460.359473","article-title":"Secure Communications Over Insecure","volume":"21","author":"Merkle Ralph C.","year":"1978","unstructured":"Ralph C. Merkle. 1978. Secure Communications Over Insecure Channels. Commun. ACM 21, 4 (1978), 294--299.","journal-title":"Channels. Commun. ACM"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Milad Nasr Reza Shokri and Amir Houmansadr. 2019. Comprehensive Privacy Analysis of Deep Learning: Passive and Active White-box Inference Attacks against Centralized and Federated Learning. In S&P. 739--753.","DOI":"10.1109\/SP.2019.00065"},{"key":"e_1_2_1_47_1","volume-title":"SINGA: A Distributed Deep Learning Platform. In ACM MM. ACM, 685--688.","author":"Ooi Beng Chin","year":"2015","unstructured":"Beng Chin Ooi, Kian-Lee Tan, Sheng Wang, Wei Wang, Qingchao Cai, Gang Chen, Jinyang Gao, Zhaojing Luo, Anthony K. H. Tung, Yuan Wang, Zhongle Xie, Meihui Zhang, and Kaiping Zheng. 2015. SINGA: A Distributed Deep Learning Platform. In ACM MM. ACM, 685--688."},{"key":"e_1_2_1_48_1","unstructured":"Xudong Pan Mi Zhang Duocai Wu Qifan Xiao Shouling Ji and Min Yang. 2020. Justinian's GAAvernor: Robust Distributed Learning with Gradient Aggregation Agent. In USENIX Security. 1641--1658."},{"key":"e_1_2_1_49_1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/2856449","article-title":"Pinocchio: Nearly practical verifiable computation","volume":"59","author":"Parno Bryan","year":"2016","unstructured":"Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2016. Pinocchio: Nearly practical verifiable computation. Commun. ACM 59, 2 (2016), 103--112.","journal-title":"Commun. ACM"},{"key":"e_1_2_1_50_1","volume-title":"Non-interactive and information-theoretic secure verifiable secret sharing","author":"Pedersen Torben Pryds","unstructured":"Torben Pryds Pedersen. 2001. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO. Springer, 129--140."},{"key":"e_1_2_1_51_1","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0209022","article-title":"On the evaluation of powers and monomials","volume":"9","author":"Pippenger Nicholas","year":"1980","unstructured":"Nicholas Pippenger. 1980. On the evaluation of powers and monomials. SIAM J. Comput. 9, 2 (1980), 230--250.","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_52_1","unstructured":"C. Pomerance and S. Goldwasser. 1990. Cryptology and Computational Number Theory. American Mathematical Society. https:\/\/books.google.com.sg\/books?id=yyfS7MKQhJUC"},{"key":"e_1_2_1_53_1","volume-title":"IEEE","author":"Rathee Mayank","year":"2023","unstructured":"Mayank Rathee, Conghao Shen, Sameer Wagh, and Raluca Ada Popa. 2023. Elsa: Secure aggregation for federated learning with malicious actors. In S&P. IEEE, 1961--1979."},{"key":"e_1_2_1_54_1","unstructured":"Facebook Research. [n.d.]. FLSim: https:\/\/github.com\/facebookresearch\/FLSim."},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Amrita Roy Chowdhury Chuan Guo Somesh Jha and Laurens van der Maaten. 2022. EIFFeL: Ensuring Integrity for Federated Learning. In CCS. 2535--2549.","DOI":"10.1145\/3548606.3560611"},{"key":"e_1_2_1_56_1","volume-title":"Gilles Brassard (Ed.)","volume":"435","author":"Schnorr Claus-Peter","year":"1989","unstructured":"Claus-Peter Schnorr. 1989. Efficient Identification and Signatures for Smart Cards. In CRYPTO, Gilles Brassard (Ed.), Vol. 435. 239--252."},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir Adi","year":"1979","unstructured":"Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (1979), 612--613.","journal-title":"Commun. ACM"},{"key":"e_1_2_1_58_1","volume-title":"Proc. Symp. Math. Soc.","volume":"20","author":"Shanks Daniel","year":"1971","unstructured":"Daniel Shanks. 1971. Class number, a theory of factorization, and genera. In Proc. Symp. Math. Soc., 1971, Vol. 20. 415--440."},{"key":"e_1_2_1_59_1","volume-title":"Back to the Drawing Board: A Critical Evaluation of Poisoning Attacks on Production Federated Learning","author":"Shejwalkar Virat","unstructured":"Virat Shejwalkar, Amir Houmansadr, Peter Kairouz, and Daniel Ramage. 2022. Back to the Drawing Board: A Critical Evaluation of Poisoning Attacks on Production Federated Learning. In IEEE S&P. IEEE, 1354--1371."},{"key":"e_1_2_1_60_1","volume-title":"Pang Wei Koh, and Percy Liang","author":"Steinhardt Jacob","year":"2017","unstructured":"Jacob Steinhardt, Pang Wei Koh, and Percy Liang. 2017. Certified Defenses for Data Poisoning Attacks. In NeurIPS. 3517--3529."},{"key":"e_1_2_1_61_1","volume-title":"Ananda Theertha Suresh, and H Brendan McMahan","author":"Sun Ziteng","year":"2019","unstructured":"Ziteng Sun, Peter Kairouz, Ananda Theertha Suresh, and H Brendan McMahan. 2019. Can you really backdoor federated learning? arXiv preprint arXiv:1911.07963 (2019)."},{"key":"e_1_2_1_62_1","volume-title":"Papailiopoulos","author":"Wang Hongyi","year":"2020","unstructured":"Hongyi Wang, Kartik Sreenivasan, Shashank Rajput, Harit Vishwakarma, Saurabh Agarwal, Jy-yong Sohn, Kangwook Lee, and Dimitris S. Papailiopoulos. 2020. Attack of the Tails: Yes, You Really Can Backdoor Federated Learning. In NeurIPS."},{"key":"e_1_2_1_63_1","volume-title":"Lixin Fan, and Qiang Yang.","author":"Wang Yansheng","year":"2023","unstructured":"Yansheng Wang, Yongxin Tong, Zimu Zhou, Ruisheng Zhang, Sinno Jialin Pan, Lixin Fan, and Qiang Yang. 2023. Distribution-Regularized Federated Learning on Non-IID Data. In ICDE. IEEE, 2113--2125."},{"key":"e_1_2_1_64_1","first-page":"2","volume-title":"Proc. ACM Manag. Data 1","author":"Wang Yatong","year":"2023","unstructured":"Yatong Wang, Yuncheng Wu, Xincheng Chen, Gang Feng, and Beng Chin Ooi. 2023. Incentive-Aware Decentralized Data Collaboration. Proc. ACM Manag. Data 1, 2 (2023), 158:1--158:27."},{"key":"e_1_2_1_65_1","volume-title":"S&P","author":"Weng Chenkai","unstructured":"Chenkai Weng, Kang Yang, Jonathan Katz, and Xiao Wang. 2021. Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In S&P. IEEE, 1074--1091."},{"key":"e_1_2_1_66_1","volume-title":"Mystique: Efficient conversions for {Zero-Knowledge} proofs with applications to machine learning. In USENIX Security. 501--518.","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. 501--518."},{"key":"e_1_2_1_67_1","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.14778\/3407790.3407811","article-title":"Privacy Preserving Vertical Federated Learning for Tree-based Models","volume":"13","author":"Wu Yuncheng","year":"2020","unstructured":"Yuncheng Wu, Shaofeng Cai, Xiaokui Xiao, Gang Chen, and Beng Chin Ooi. 2020. Privacy Preserving Vertical Federated Learning for Tree-based Models. Proc. VLDB Endow. 13, 11 (2020), 2090--2103.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_68_1","doi-asserted-by":"crossref","first-page":"2471","DOI":"10.14778\/3603581.3603588","article-title":"Falcon: A Privacy-Preserving and Interpretable Vertical Federated Learning System","volume":"16","author":"Wu Yuncheng","year":"2023","unstructured":"Yuncheng Wu, Naili Xing, Gang Chen, Tien Tuan Anh Dinh, Zhaojing Luo, Beng Chin Ooi, Xiaokui Xiao, and Meihui Zhang. 2023. Falcon: A Privacy-Preserving and Interpretable Vertical Federated Learning System. Proc. VLDB Endow. 16, 10 (2023), 2471--2484.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_69_1","first-page":"2","volume-title":"Proc. ACM Manag. Data 1","author":"Xiang Zihang","year":"2023","unstructured":"Zihang Xiang, Tianhao Wang, Wanyu Lin, and Di Wang. 2023. Practical Differentially Private and Byzantine-resilient Federated Learning. Proc. ACM Manag. Data 1, 2 (2023), 119:1--119:26."},{"key":"e_1_2_1_70_1","volume-title":"ICML","volume":"139","author":"Xie Chulin","year":"2021","unstructured":"Chulin Xie, Minghao Chen, Pin-Yu Chen, and Bo Li. 2021. CRFL: Certifiably Robust Federated Learning against Backdoor Attacks. In ICML, Vol. 139. PMLR, 11372--11382."},{"key":"e_1_2_1_71_1","volume-title":"DBA: Distributed Backdoor Attacks against Federated Learning. In ICLR.","author":"Xie Chulin","year":"2020","unstructured":"Chulin Xie, Keli Huang, Pin-Yu Chen, and Bo Li. 2020. DBA: Distributed Backdoor Attacks against Federated Learning. In ICLR."},{"key":"e_1_2_1_72_1","volume-title":"robust asynchronous SGD with arbitrary number of Byzantine workers. arXiv preprint arXiv:1903.07020","author":"Xie Cong","year":"2019","unstructured":"Cong Xie, O Koyejo, and I Gupta. 2019. Zeno++: robust asynchronous SGD with arbitrary number of Byzantine workers. arXiv preprint arXiv:1903.07020 (2019)."},{"key":"e_1_2_1_73_1","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.14778\/3579075.3579081","article-title":"FederatedScope: A Flexible Federated Learning Platform for Heterogeneity","volume":"16","author":"Xie Yuexiang","year":"2023","unstructured":"Yuexiang Xie, Zhen Wang, Dawei Gao, Daoyuan Chen, Liuyi Yao, Weirui Kuang, Yaliang Li, Bolin Ding, and Jingren Zhou. 2023. FederatedScope: A Flexible Federated Learning Platform for Heterogeneity. Proc. VLDB Endow. 16, 5 (2023), 1059--1072.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_74_1","doi-asserted-by":"crossref","first-page":"4835","DOI":"10.1109\/TPDS.2022.3205714","article-title":"TDFL: Truth Discovery Based Byzantine Robust Federated Learning","volume":"33","author":"Xu Chang","year":"2022","unstructured":"Chang Xu, Yu Jia, Liehuang Zhu, Chuan Zhang, Guoxie Jin, and Kashif Sharif. 2022. TDFL: Truth Discovery Based Byzantine Robust Federated Learning. IEEE Trans. Parallel Distributed Syst. 33, 12 (2022), 4835--4848.","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Jiancheng Yang Rui Shi and Bingbing Ni. 2021. MedMNIST Classification Decathlon: A Lightweight AutoML Benchmark for Medical Image Analysis. In ISBI. 191--195.","DOI":"10.1109\/ISBI48211.2021.9434062"},{"key":"e_1_2_1_76_1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1038\/s41597-022-01721-8","article-title":"MedMNIST v2-A large-scale lightweight benchmark for 2D and 3D biomedical image classification","volume":"10","author":"Yang Jiancheng","year":"2023","unstructured":"Jiancheng Yang, Rui Shi, Donglai Wei, Zequan Liu, Lin Zhao, Bilian Ke, Hanspeter Pfister, and Bingbing Ni. 2023. MedMNIST v2-A large-scale lightweight benchmark for 2D and 3D biomedical image classification. Scientific Data 10, 1 (2023), 41.","journal-title":"Scientific Data"},{"key":"e_1_2_1_77_1","volume-title":"Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In CCS. 2986--3001.","author":"Yang Kang","year":"2021","unstructured":"Kang Yang, Pratik Sarkar, Chenkai Weng, and Xiao Wang. 2021. Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In CCS. 2986--3001."},{"key":"e_1_2_1_78_1","volume-title":"Bartlett","author":"Yin Dong","year":"2018","unstructured":"Dong Yin, Yudong Chen, Kannan Ramchandran, and Peter L. Bartlett. 2018. Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates. In ICML. 5636--5645."},{"key":"e_1_2_1_79_1","volume-title":"Bartlett","author":"Yin Dong","year":"2019","unstructured":"Dong Yin, Yudong Chen, Kannan Ramchandran, and Peter L. Bartlett. 2019. Defending Against Saddle Point Attack in Byzantine-Robust Distributed Learning. In ICML. 7074--7084."},{"key":"e_1_2_1_80_1","volume-title":"FLBooster: A Unified and Efficient Platform for Federated Learning Acceleration","author":"Zeng Zhihao","unstructured":"Zhihao Zeng, Yuntao Du, Ziquan Fang, Lu Chen, Shiliang Pu, Guodong Chen, Hui Wang, and Yunjun Gao. 2023. FLBooster: A Unified and Efficient Platform for Federated Learning Acceleration. In ICDE. IEEE, 3140--3153."},{"key":"e_1_2_1_81_1","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/TDSC.2022.3146448","article-title":"Aggregation Service for Federated Learning: An Efficient, Secure, and More Resilient Realization","volume":"20","author":"Zheng Yifeng","year":"2023","unstructured":"Yifeng Zheng, Shangqi Lai, Yi Liu, Xingliang Yuan, Xun Yi, and Cong Wang. 2023. Aggregation Service for Federated Learning: An Efficient, Secure, and More Resilient Realization. IEEE Trans. Dependable Secur. Comput. 20, 2 (2023), 988--1001.","journal-title":"IEEE Trans. Dependable Secur. Comput."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3665844.3665860","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T02:43:22Z","timestamp":1732589002000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3665844.3665860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":80,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["10.14778\/3665844.3665860"],"URL":"https:\/\/doi.org\/10.14778\/3665844.3665860","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"2024-08-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}