{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T23:15:51Z","timestamp":1776381351836,"version":"3.51.2"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1740047"],"award-info":[{"award-number":["1740047"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005595","name":"University of California National Laboratories","doi-asserted-by":"publisher","award":["LFR-18-548554"],"award-info":[{"award-number":["LFR-18-548554"]}],"id":[{"id":"10.13039\/100005595","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google Faculty Research Award","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/jsait.2021.3056102","type":"journal-article","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T06:30:36Z","timestamp":1612333836000},"page":"464-478","source":"Crossref","is-referenced-by-count":47,"title":["Shuffled Model of Federated Learning: Privacy, Accuracy and Communication Trade-Offs"],"prefix":"10.1109","volume":"2","author":[{"given":"Antonious M.","family":"Girgis","sequence":"first","affiliation":[]},{"given":"Deepesh","family":"Data","sequence":"additional","affiliation":[]},{"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Kairouz","sequence":"additional","affiliation":[]},{"given":"Ananda Theertha","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"1069","article-title":"Differentially private empirical risk minimization","volume":"12","author":"chaudhuri","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref38","article-title":"Breaking the communication-privacy-accuracy trilemma","volume":"33","author":"chen","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref33","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume":"70","author":"suresh","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref31","first-page":"7564","article-title":"cpSGD: Communication-efficient and differentially-private distributed SGD","author":"agarwal","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref30","author":"singh","year":"2020","journal-title":"SQuARM-SGD Communication-efficient momentum SGD for decentralized optimization"},{"key":"ref37","first-page":"51","article-title":"Communication complexity in locally private distribution estimation and heavy hitters","volume":"97","author":"acharya","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref36","first-page":"1120","article-title":"Hadamard response: Estimating distributions privately, efficiently, and with little communication","author":"acharya","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174075"},{"key":"ref34","author":"gandikota","year":"2019","journal-title":"vqSGD Vector quantized stochastic gradient descent"},{"key":"ref28","first-page":"14695","article-title":"Qsparse-local-SGD: Distributed SGD with quantization, sparsification and local computations","volume":"32","author":"basu","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref27","article-title":"Decentralized deep learning with arbitrary communication compression","author":"koloskova","year":"2020","journal-title":"Proc 8th Int Conf Learn Represent"},{"key":"ref29","author":"singh","year":"2019","journal-title":"SPARQ-SGD Event-triggered and compressed communication in decentralized stochastic optimization"},{"key":"ref2","article-title":"Federated learning: Strategies for improving communication efficiency","author":"konecn\u00fd","year":"2016","journal-title":"Proc NIPS Workshop Private Multi-Party Mach Learn"},{"key":"ref1","author":"kairouz","year":"2019","journal-title":"Advances and Open Problems in Federated Learning"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_26"},{"key":"ref22","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref21","author":"ullman","year":"2017","journal-title":"Cs7880 Rigorous Approaches to Data Privacy"},{"key":"ref24","first-page":"1509","article-title":"Terngrad: Ternary gradients to reduce communication in distributed deep learning","author":"wen","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref23","first-page":"3252","article-title":"Error feedback fixes SignSGD and other gradient compression schemes","author":"karimireddy","year":"2019","journal-title":"Proc 36th Int Conf Meach Learn (ICML)"},{"key":"ref26","first-page":"5973","article-title":"The convergence of sparsified gradient methods","author":"alistarh","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref25","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"ref51","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref53","first-page":"1376","article-title":"The composition theorem for differential privacy","author":"kairouz","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref52","first-page":"265","article-title":"Calibrating noise to sensitivity in private data analysis","author":"dwork","year":"2006","journal-title":"Proceedings of Theoretical Cryptography Conference (TCC)"},{"key":"ref10","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","author":"kairouz","year":"2016","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.151"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref12","article-title":"On the power of multiple anonymous messages","author":"ghazi","year":"2019"},{"key":"ref13","author":"balle","year":"2019","journal-title":"Improved summation from shuffling"},{"key":"ref14","author":"ghazi","year":"2019","journal-title":"Scalable and differentially private distributed aggregation in the shuffled model"},{"key":"ref15","author":"balle","year":"2019","journal-title":"Differentially private summation with multi-message shuffling"},{"key":"ref16","first-page":"3505","article-title":"Private counting from anonymous messages: Near-optimal accuracy with vanishing communication overhead","author":"ghazi","year":"2020","journal-title":"Proc 37th Int Conf Mach Learn"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_13"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"ref19","author":"balle","year":"2020","journal-title":"Private summation in the multi-message shuffle model"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.09.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"ref7","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"duchi","year":"2013","journal-title":"Proc Annu IEEE Symp Foundations Comput Sci"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3040403"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref46","author":"erlingsson","year":"2020","journal-title":"Encode Shuffle Analyze Privacy Revisited Formalizations and Empirical Evaluation"},{"key":"ref45","author":"feldman","year":"2020","journal-title":"Hiding among the clones A simple and nearly optimal analysis of privacy amplification by shuffling"},{"key":"ref48","first-page":"1161","article-title":"Lower bounds for locally private estimation via communication complexity","author":"duchi","year":"2019","journal-title":"Proc 32nd Conf Learn Theory (COLT)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"ref42","author":"bhowmick","year":"2018","journal-title":"Protection against reconstruction and its applications in private federated learning"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref44","first-page":"1226","article-title":"Subsampled renyi differential privacy and analytical moments accountant","author":"wang","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Stat"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"dwork","year":"2014","journal-title":"Found Trends Theor Comput Sci"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9380089\/9344807-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9380089\/09344807.pdf?arnumber=9344807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T19:59:09Z","timestamp":1625515149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9344807\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":53,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3056102","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}