Fetching the paper…
Reading the bibliography…
We prove a general connection between the communication complexity of two-player games and the sample complexity of their multi-player locally private analogues.
Rounds in communication complexity revisited
Noam Nisan and Avi Wigderson · 1993
Earlier work this paper cites.
Coding for interactive communication
Leonard J Schulman · 1996
Earlier work this paper cites.
Efficient noise-tolerant learning from statistical queries
Michael Kearns · 1998
Earlier work this paper cites.
Calibrating noise to sensitivity in private data analysis
Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith · 2006
Earlier work this paper cites.
Distributed private data analysis: Simultaneously solving how and what
Amos Beimel, Kobbi Nissim, and Eran Omri · 2008
Earlier work this paper cites.
The limits of two-party differential privacy
Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, and Salil Vadhan · 2010
Earlier work this paper cites.
What can we learn privately?
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, and Adam Smith · 2011
Earlier work this paper cites.
A hard-to-compress interactive task?
Mark Braverman · 2013
Earlier work this paper cites.
Local privacy and statistical minimax rates
John C. Duchi, Michael I. Jordan, and Martin J. Wainwright · 2013
Earlier work this paper cites.
Toward coding for maximum errors in interactive communication
Mark Braverman and Anup Rao · 2014
Cited alongside, same era.
The algorithmic foundations of differential privacy
Cynthia Dwork and Aaron Roth · 2014
Cited alongside, same era.
Rappor: Randomized aggregatable privacy-preserving ordinal response
Úlfar Erlingsson, Vasyl Pihur, and Aleksandra Korolova · 2014
Cited alongside, same era.
Local, private, efficient protocols for succinct histograms
Raef Bassily and Adam Smith · 2015
Cited alongside, same era.
Simulating noisy channel interaction
Mark Braverman and Jieming Mao · 2015
Cited alongside, same era.
The challenge of scientific reproducibility and privacy protection for statistical agencies
John M. Abowd · 2016
Cited alongside, same era.
Collecting telemetry data privately
Bolin Ding, Janardhan Kulkarni, and Sergey Yekhanin · 2017
Later among the works it cites.
Is interaction necessary for distributed private learning?
Adam Smith, Abhradeep Thakurta, and Jalaj Upadhyay · 2017
Later among the works it cites.
The complexity of differential privacy
Salil Vadhan · 2017
Later among the works it cites.
Heavy hitters and the structure of local privacy
Mark Bun, Jelani Nelson, and Uri Stemmer · 2018
Later among the works it cites.
Distributed differential privacy via mixnets
Albert Cheu, Adam Smith, Jonathan Ullman, David Zeber, and Maxim Zhilyaev · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Exponential separation of communication and external information
Anat Ganor, Gillat Kol, and Ran Raz · 2016
Cited alongside, same era.
Learning with privacy at scale
Differential Privacy Team Apple · 2017
Cited alongside, same era.
Prochlo: Strong privacy for analytics in the crowd
Andrea Bittau, Úlfar Erlingsson, Petros Maniatis, Ilya Mironov, Ananth Raghunathan, David Lie, Mitch Rudominer, Ushasree Kode, Julien Tinnes, and Bernhard Seefeld · 2017
Cited alongside, same era.
Amit Daniely and Vitaly Feldman · 2018
Later among the works it cites.
Test without trust: Optimal locally private distribution testing
Jayadev Acharya, Clement Canonne, Cody Freitag, and Himanshu Tyagi · 2019
Closest in time.
Lower bounds for locally private estimation via communication complexity
John Duchi and Ryan Rogers · 2019
Closest in time.
The role of interactivity in local differential privacy
Matthew Joseph, Jieming Mao, Seth Neel, and Aaron Roth · 2019
Closest in time.