{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:37:32Z","timestamp":1767339452398,"version":"3.37.3"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T00:00:00Z","timestamp":1666915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T00:00:00Z","timestamp":1666915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-CE23-0013"],"award-info":[{"award-number":["ANR-20-CE23-0013"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10994-022-06267-9","type":"journal-article","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T20:03:44Z","timestamp":1666987424000},"page":"4249-4293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An accurate, scalable and verifiable protocol for federated differentially private averaging"],"prefix":"10.1007","volume":"111","author":[{"given":"C\u00e9sar","family":"Sabater","sequence":"first","affiliation":[]},{"given":"Aur\u00e9lien","family":"Bellet","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0558-7176","authenticated-orcid":false,"given":"Jan","family":"Ramon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,28]]},"reference":[{"key":"6267_CR1","unstructured":"Agarwal, N., Kairouz, P., & Liu, Z. (2021). The Skellam mechanism for differentially private federated learning. In NeurIPS."},{"key":"6267_CR2","unstructured":"Agarwal, N., Suresh, A.T., Yu, F.X., Kumar, S., & McMahan, B. (2018). cpSGD: Communication-efficient and differentially-private distributed SGD. In NeurIPS."},{"key":"6267_CR3","unstructured":"Bagdasaryan, E., Veit, A., Hua, Y., Estrin, D., & Shmatikov, V. (2020). How to backdoor federated learning. In AISTATS."},{"key":"6267_CR4","doi-asserted-by":"crossref","unstructured":"Balcer, V., & Vadhan, S. (2018). Differential privacy on finite computers. In ITCS.","DOI":"10.29012\/jpc.679"},{"key":"6267_CR5","doi-asserted-by":"crossref","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., & Nissim, K. (2020). Private summation in the multi-message shuffle model. In CCS.","DOI":"10.1145\/3372297.3417242"},{"key":"6267_CR6","doi-asserted-by":"crossref","unstructured":"Barker, E. B., & Kelsey, J. M. (2007). Recommendation for random number generation using deterministic random bit generators (revised). NIST Special Publication (NIST SP).","DOI":"10.6028\/NIST.SP.800-90"},{"key":"6267_CR7","unstructured":"Bell, J., Bellet, A., Gasc\u00f3n, A., & Kulkarni, T. (2020). Private protocols for U-statistics in the local model and beyond. In AISTATS."},{"key":"6267_CR8","doi-asserted-by":"crossref","unstructured":"Bell, J. H., Bonawitz, K. A., Gasc\u00f3n, A., Lepoint, T., & Raykova, M. (2020). Secure single-server aggregation with (poly)logarithmic overhead. In CCS.","DOI":"10.1145\/3372297.3417885"},{"key":"6267_CR9","doi-asserted-by":"crossref","unstructured":"Ben\u00a0Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) Zerocash: Decentralized anonymous payments from bitcoin. In S &P.","DOI":"10.1109\/SP.2014.36"},{"key":"6267_CR10","doi-asserted-by":"crossref","unstructured":"Bernhard, D., Pereira, O., & Warinschi, B. (2012) How not to prove yourself: Pitfalls of the Fiat\u2013Shamir heuristic and applications to helios. In ASIACRYPT.","DOI":"10.1007\/978-3-642-34961-4_38"},{"key":"6267_CR11","doi-asserted-by":"crossref","unstructured":"Bertoni, G., Daemen, J., Peeters, M., & Van\u00a0Assche, G. (2010) Sponge-based pseudo-random number generators. In International workshop on cryptographic hardware and embedded systems.","DOI":"10.1007\/978-3-642-15031-9_3"},{"key":"6267_CR12","unstructured":"Bhagoji, A. N., Chakraborty, S., Mittal, P., & Calo, S. B. (2019). Analyzing federated learning through an adversarial lens. In ICML."},{"key":"6267_CR13","unstructured":"Blanchard, P., Mhamdi, E. M. E., Guerraoui, R., & Stainer, J. (2017). Machine learning with adversaries: Byzantine tolerant gradient descent. In NIPS."},{"issue":"1","key":"6267_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M Blum","year":"1983","unstructured":"Blum, M. (1983). Coin flipping by telephone a protocol for solving impossible problems. ACM SIGACT News, 15(1), 23\u201327.","journal-title":"ACM SIGACT News"},{"key":"6267_CR15","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B. (2001). Random graphs (2nd edn.). Cambridge University Press.","DOI":"10.1017\/CBO9780511814068"},{"key":"6267_CR16","doi-asserted-by":"crossref","unstructured":"Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., & Seth, K. (2017). Practical secure aggregation for privacy-preserving machine learning. In CCS.","DOI":"10.1145\/3133956.3133982"},{"key":"6267_CR17","doi-asserted-by":"crossref","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006). Randomized gossip algorithms. IEEE\/ACM Transactions on Networking,14(SI), 2508\u20132530.","DOI":"10.1109\/TIT.2006.874516"},{"key":"6267_CR18","doi-asserted-by":"crossref","unstructured":"Camenisch, J., & Michels, M. (1999). Proving in zero-knowledge that a number is the product of two safe primes. In EUROCRYPT.","DOI":"10.1007\/3-540-48910-X_8"},{"key":"6267_CR19","unstructured":"Chan, H., Perrig, A., & Song, D. X. (2003). Random key predistribution schemes for sensor networks. In S &P."},{"key":"6267_CR20","doi-asserted-by":"crossref","unstructured":"Chan, T. H. H., Shi, E., & Song, D. (2012). Optimal lower bound for differentially private multi-party aggregation. In ESA.","DOI":"10.1007\/978-3-642-33090-2_25"},{"key":"6267_CR21","doi-asserted-by":"crossref","unstructured":"Chan, T. H. H., Shi, E., & Song, D. (2012). Privacy-preserving stream aggregation with fault tolerance. In Financial cryptography.","DOI":"10.1007\/978-3-642-32946-3_15"},{"key":"6267_CR22","unstructured":"Chen, W.N., Kairouz, P., & Ozgur, A. (2020). Breaking the communication-privacy-accuracy trilemma. In NeurIPS."},{"key":"6267_CR23","doi-asserted-by":"crossref","unstructured":"Cheu, A., Smith, A. D., Ullman, J., Zeber, D., & Zhilyaev, M. (2019). Distributed differential privacy via shuffling. In EUROCRYPT.","DOI":"10.1007\/978-3-030-17653-2_13"},{"key":"6267_CR24","unstructured":"Chevillard, S., & Revol, N. (2008). Computation of the error functions ERF & ERFC in arbitrary precision with correct rounding (Research Report RR-6465, INRIA)."},{"key":"6267_CR25","unstructured":"Cramer, R. (1997). Modular design of secure yet practical cryptographic protocols (Ph.D. thesis, University of Amsterdam)."},{"key":"6267_CR26","doi-asserted-by":"crossref","unstructured":"Cramer, R., & Damg\u00e5rd, I. (1998). Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free? In CRYPTO.","DOI":"10.1007\/BFb0055745"},{"key":"6267_CR27","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., & Schoenmakers, B. (1994). Proofs of partial knowledge and simplified design of Witness Hiding Protocols. In CRYPTO.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"6267_CR28","unstructured":"Ding, B., Kulkarni, J., & Yekhanin, S. (2017). Collecting telemetry data privately. In NIPS."},{"key":"6267_CR29","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., & Syverson, P. (2004). Tor: The second-generation onion router (Tech. rep., Naval Research Lab Washington).","DOI":"10.21236\/ADA465464"},{"key":"6267_CR30","doi-asserted-by":"crossref","unstructured":"Duchi, J. C., Jordan, M. I., & Wainwright, M. J. (2013). Local privacy and statistical minimax rates. In FOCS.","DOI":"10.1109\/FOCS.2013.53"},{"key":"6267_CR31","doi-asserted-by":"crossref","unstructured":"Dwork, C. (2006). Differential privacy. In ICALP.","DOI":"10.1007\/11787006_1"},{"key":"6267_CR32","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006). Our data, ourselves: privacy via distributed noise generation. In EUROCRYPT.","DOI":"10.1007\/11761679_29"},{"issue":"3\u20134","key":"6267_CR33","first-page":"1","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., & Roth, A. (2014). The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, 9(3\u20134), 1\u2013277.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"6267_CR34","doi-asserted-by":"crossref","unstructured":"Erlingsson, U., Feldman, V., Mironov, I., Raghunathan, A., & Talwar, K. (2019). Amplification by shuffling: From local to central differential privacy via anonymity. In SODA.","DOI":"10.1137\/1.9781611975482.151"},{"key":"6267_CR35","doi-asserted-by":"crossref","unstructured":"Erlingsson, U., Pihur, V., & Korolova, A. (2014). Rappor: Randomized aggregatable privacy-preserving ordinal response. In CCS.","DOI":"10.1145\/2660267.2660348"},{"issue":"4","key":"6267_CR36","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF02579431","volume":"2","author":"TI Fenner","year":"1982","unstructured":"Fenner, T. I., & Frieze, A. M. (1982). On the connectivity of random m-orientable graphs and digraphs. Combinatorica, 2(4), 347\u2013359.","journal-title":"Combinatorica"},{"key":"6267_CR37","doi-asserted-by":"crossref","unstructured":"Franck, C., & Gro\u00dfsch\u00e4dl, J. (2017). Efficient implementation of Pedersen commitments using twisted Edwards curves. In Mobile, secure, and programmable networking.","DOI":"10.1007\/978-3-319-67807-8_1"},{"key":"6267_CR38","unstructured":"Geiping, J., Bauermeister, H., Dr\u00f6ge, H., & Moeller, M. (2020). Inverting gradients\u2014How easy is it to break privacy in federated learning? In NeurIPS."},{"key":"6267_CR39","doi-asserted-by":"crossref","unstructured":"Ghazi, B., Kumar, R., Manurangsi, P., & Pagh, R. (2020). Private counting from anonymous messages: Near-optimal accuracy with vanishing communication overhead. In ICML.","DOI":"10.1007\/978-3-030-45724-2_27"},{"key":"6267_CR40","unstructured":"Goldreich, O. (1998). Secure multi-party computation. Manuscript. Preliminary Version."},{"issue":"1","key":"6267_CR41","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., & Rackoff, C. (1989). The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1), 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"key":"6267_CR42","unstructured":"Hartmann, V., & West, R. (2019). Privacy-preserving distributed learning with secret gradient descent. Tech. rep. arXiv:1906.11993"},{"key":"6267_CR43","unstructured":"Hayes, J., & Ohrimenko, O. (2018). Contamination attacks and mitigation in multi-party machine learning. In NeurIPS."},{"key":"6267_CR44","unstructured":"Imtiaz, H., Mohammadi, J., & Sarwate, A. D. (2021). Distributed differentially private computation of functions with correlated noise. arXiv preprint arXiv:1904.10059"},{"key":"6267_CR45","unstructured":"Jayaraman, B., Wang, L., Evans, D., & Gu, Q. (2018). Distributed learning without distress: Privacy-preserving empirical risk minimization. In NeurIPS."},{"key":"6267_CR46","unstructured":"Kairouz, P., Bonawitz, K., & Ramage, D. (2016). Discrete distribution estimation under local privacy. In ICML."},{"key":"6267_CR47","unstructured":"Kairouz, P., Liu, Z., & Steinke, T. (2021). The distributed discrete gaussian mechanism for federated learning with secure aggregation. In ICML."},{"key":"6267_CR48","doi-asserted-by":"crossref","unstructured":"Kairouz, P., McMahan, H. B., Avent, B., Bellet, A., Bennis, M., Bhagoji, A. N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R., & D\u2019Oliveira, R. G. (2021). Advances and open problems in federated learning. Foundations and Trends\u00aein Machine Learning, 14(1-2), 1\u2013210.","DOI":"10.1561\/2200000083"},{"key":"6267_CR49","unstructured":"Kairouz, P., Oh, S., & Viswanath, P. (2015). Secure multi-party differential privacy. In NIPS."},{"key":"6267_CR50","first-page":"1","volume":"17","author":"P Kairouz","year":"2016","unstructured":"Kairouz, P., Oh, S., & Viswanath, P. (2016). Extremal mechanisms for local differential privacy. Journal of Machine Learning Research, 17, 1\u201351.","journal-title":"Journal of Machine Learning Research"},{"key":"6267_CR51","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., & Smith, A. D. (2008). What can we learn privately? In FOCS.","DOI":"10.1109\/FOCS.2008.27"},{"key":"6267_CR52","doi-asserted-by":"crossref","unstructured":"Katz, J., & Lindell, Y. (2014). Introduction to modern cryptography (2nd edn.). CRC Press.","DOI":"10.1201\/b17668"},{"issue":"4","key":"6267_CR53","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1137\/100805753","volume":"24","author":"M Krivelevich","year":"2010","unstructured":"Krivelevich, M. (2010). Embedding spanning trees in random graphs. SIAM Journal on Discrete Mathematics, 24(4), 1495\u20131500.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"6267_CR54","unstructured":"Lin, T., Stich, S. U., Patel, K. K., & Jaggi, M. (2020). Don\u2019t use large mini-batches, use local SGD.. In ICLR."},{"key":"6267_CR55","unstructured":"McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Ag\u00fcera\u00a0y Arcas, B. (2017). Communication-efficient learning of deep networks from decentralized data. In AISTATS."},{"key":"6267_CR56","doi-asserted-by":"crossref","unstructured":"Melis, L., Song, C., Cristofaro, E. D., & Shmatikov, V. (2019). Exploiting unintended feature leakage in collaborative learning. In S &P.","DOI":"10.1109\/SP.2019.00029"},{"key":"6267_CR57","unstructured":"Nakamoto, S. (2008). Bitcoin: A peer-to-peer electronic cash system. http:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"6267_CR58","unstructured":"Narula, N., Vasquez, W., & Virza, M. (2018). zkLedger: Privacy-preserving auditing for distributed ledgers. In USENIX security."},{"key":"6267_CR59","doi-asserted-by":"crossref","unstructured":"Nasr, M., Shokri, R., & Houmansadr, A. (2019). Comprehensive privacy analysis of deep learning: Passive and active white-box inference attacks against centralized and federated learning. In S &P.","DOI":"10.1109\/SP.2019.00065"},{"key":"6267_CR60","unstructured":"Pedersen, T. P. (1991). Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO."},{"key":"6267_CR61","unstructured":"Shi, E., Chan, T. H. H., Rieffel, E. G., Chow, R., & Song, D. (2011). Privacy-preserving aggregation of time-series data. In NDSS."},{"key":"6267_CR62","unstructured":"Stich, S. U. (2019). Local SGD converges fast and communicates little. In ICLR."},{"issue":"9","key":"6267_CR63","doi-asserted-by":"publisher","first-page":"5754","DOI":"10.1109\/TIT.2013.2265694","volume":"59","author":"O Ya\u011fan","year":"2013","unstructured":"Ya\u011fan, O., & Makowski, A. M. (2013). On the connectivity of sensor networks under random pairwise key predistribution. IEEE Transactions on Information Theory, 59(9), 5754\u20135762.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6267_CR64","doi-asserted-by":"crossref","unstructured":"Yao, A. C. (1982). Theory and application of trapdoor functions. In FOCS.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06267-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06267-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06267-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:03:02Z","timestamp":1698451382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06267-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,28]]},"references-count":64,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["6267"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06267-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2022,10,28]]},"assertion":[{"value":"15 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No ethical approval was needed.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"As there were no participants no consent was needed to participate nor to publish.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}