{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:11Z","timestamp":1773378071320,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["#1740047,#2007714"],"award-info":[{"award-number":["#1740047,#2007714"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517906","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"338-343","source":"Crossref","is-referenced-by-count":8,"title":["Differentially Private Federated Learning with Shuffling and Client Self-Sampling"],"prefix":"10.1109","author":[{"given":"Antonious M.","family":"Girgis","sequence":"first","affiliation":[{"name":"University of California,Los Angeles,USA"}]},{"given":"Deepesh","family":"Data","sequence":"additional","affiliation":[{"name":"University of California,Los Angeles,USA"}]},{"given":"Suhas","family":"Diggavi","sequence":"additional","affiliation":[{"name":"University of California,Los Angeles,USA"}]}],"member":"263","reference":[{"key":"ref33","first-page":"71","article-title":"Stochastic gradient descent for nonsmooth optimization: Convergence results and optimal averaging schemes","author":"shamir","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"ref31","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":"Foundations and Trends\ufffd in Theoretical Computer Science"},{"key":"ref30","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":"ref34","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_25"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"ref12","first-page":"2436","article-title":"Discrete distribution estimation under local privacy","author":"kairouz","year":"2016","journal-title":"ICML"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.151"},{"key":"ref14","first-page":"1382","article-title":"On the power of multiple anonymous messages","volume":"2019","author":"ghazi","year":"2019","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref15","article-title":"Improved summation from shuffling","author":"balle","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref16","article-title":"Scalable and differentially private distributed aggregation in the shuffled model","author":"ghazi","year":"2019","journal-title":"ar Xiv preprint"},{"key":"ref17","article-title":"Differentially private summation with multi-message shuffling","author":"balle","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref18","article-title":"Private counting from anonymous messages: Near-optimal accuracy with vanishing communication overhead","author":"ghazi","year":"2020","journal-title":"ICML"},{"key":"ref19","first-page":"375","article-title":"Dis-tributed differential privacy via shuffling","author":"cheu","year":"2019","journal-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"ref4","article-title":"Advances and open problems in federated learning","author":"kairouz","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref27","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":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"ref29","article-title":"Privacy amplification via random check-ins","author":"balle","year":"2020","journal-title":"ar Xiv preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.09.001"},{"key":"ref7","first-page":"429","article-title":"Local privacy and statistical minimax rates","author":"duchi","year":"2013","journal-title":"Symposium on Foundations of Computer Science (FOCS)"},{"key":"ref2","article-title":"Federated learning: Strategies for improving communication efficiency","author":"konecny","year":"2016","journal-title":"NIPS Workshop on Private Multi-Party Machine Learning PMPML '16"},{"key":"ref9","article-title":"Protection against reconstruction and its applications in private federated learning","author":"bhowmick","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref1","article-title":"Differentially private federated learning with shuffling and client self-sampling","author":"girgis","year":"2021","journal-title":"available online arxiv orv\/abs\/"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_26"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417242"},{"key":"ref24","article-title":"Differentially private federated learning: A client level perspective","author":"geyer","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref23","author":"ullman","year":"2017","journal-title":"Cs7880 rigorousapproaches to dataprivacy"},{"key":"ref26","article-title":"Encode, shuffle, analyze privacy revisited: formalizations and empirical evaluation","author":"erlingsson","year":"2020","journal-title":"ar Xiv preprint"},{"key":"ref25","article-title":"Shuffled model of federated learning: Privacy, communication and accuracy trade-offs","author":"girgis","year":"2020","journal-title":"ArXiv Preprint"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517906.pdf?arnumber=9517906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:08Z","timestamp":1773347768000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517906\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517906","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}