The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Differential privacy under continual observation
Abstract
Differential privacy is a recent notion of privacy tailored to privacy-preserving data analysis [11]. Up to this point, research on differentially private data analysis has focused on the setting of a trusted curator holding a large, static, data set; thus every computation is a "one-shot" object: there is no point in computing something twice, since the result will be unchanged, up to any randomness introduced for privacy. However, many applications of data analysis involve repeated computations, either because the entire goal is one of monitoring, e.g., of traffic conditions, search trends, or incidence of influenza, or because the goal is some kind of adaptive optimization, e.g., placement of data to minimize access costs. In these cases, the algorithm must permit continual observation of the system's state. We therefore initiate a study of differential privacy under continual observation. We identify the problem of maintaining a counter in a privacy preserving manner and show its wide applicability to many different problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Self-citationDwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
Self-citationL -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
Warner, S. L. (1965) · Journal of the American Statistical Association · doi:10.1080/01621459.1965.10480775 · Cited by 3,255
(2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800481 · Cited by 2,303
Our Data, Ourselves: Privacy Via Distributed Noise Generation
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., & Naor, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_29 · Cited by 1,835 · cited 1×
“The one exception considers a distributed setting, in which each data holder controls her own data and decides in which analyses to participate [10].”
BackgroundSelf-citationTowards Sharp Inapproximability For Any 2-CSP
Austrin, P. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.41 · Cited by 1,294
Revealing information while preserving privacy
Dinur, I., & Nissim, K. (2003) · Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/773153.773173 · Cited by 980
A firm foundation for private data analysis
Dwork, C. (2011) · Communications of the ACM · doi:10.1145/1866739.1866758 · Cited by 841
Self-citationPractical privacy: the SuLQ framework
Blum, A., Dwork, C., McSherry, F., & Nissim, K. (2005) · Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/1065167.1065184 · Cited by 797
Self-citationGeneralizing data to provide anonymity when disclosing information (abstract)
Samarati, P., & Sweeney, L. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275508 · Cited by 779
Efficient algorithms for online decision problems
Kalai, A., & Vempala, S. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2004.10.016 · Cited by 591
Misra, J., & Gries, D. (1982) · Science of Computer Programming · doi:10.1016/0167-6423(82)90012-0 · Cited by 507
A learning theory approach to non-interactive database privacy
Blum, A., Ligett, K., & Roth, A. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374464 · Cited by 505
Private and Continual Release of Statistics
Chan, T.-H. H., Shi, E., & Song, D. (2011) · ACM Transactions on Information and System Security · doi:10.1145/2043621.2043626 · Cited by 352
Privacy-Preserving Datamining on Vertically Partitioned Databases
Dwork, C., & Nissim, K. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_32 · Cited by 348
Self-citation"You Might Also Like:" Privacy Risks of Collaborative Filtering
Calandrino, J. A., Kilzer, A., Narayanan, A., Felten, E. W., & Shmatikov, V. (2011) · 2011 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2011.40 · Cited by 311
The price of privacy and the limits of LP decoding
Dwork, C., McSherry, F., & Talwar, K. (2007) · Proceedings of the thirty-ninth annual ACM symposium on Theory of computing · doi:10.1145/1250790.1250804 · Cited by 205
Self-citationLearning, Regret Minimization, and Equilibria
Blum, A., & Mansour, Y. (2007) · Algorithmic Game Theory · doi:10.1017/cbo9780511800481.006 · Cited by 180
The matrix mechanism: optimizing linear counting queries under differential privacy
Li, C., Miklau, G., Hay, M., McGregor, A., & Rastogi, V. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0398-x · Cited by 146
The Differential Privacy Frontier (Extended Abstract)
Dwork, C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00457-5_29 · Cited by 136
Self-citationPan-Private Streaming Algorithms
Dwork, C., Naor, M., Pitassi, T., Rothblum, G. N., & Yekhanin, S. (2010) · Cited by 127
Self-citationThe geometry of differential privacy: the sparse and approximate cases
Nikolov, A., Talwar, K., & Zhang, L. (2013) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2488608.2488652 · Cited by 110
Differential Privacy in New Settings
Dwork, C. (2010) · Cited by 109
Self-citationNew Efficient Attacks on Statistical Disclosure Control Mechanisms
Dwork, C., & Yekhanin, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-85174-5_26 · Cited by 100
Self-citationPan-private algorithms via statistics on sketches
Mir, D., Muthukrishnan, S., Nikolov, A., & Wright, R. N. (2011) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/1989284.1989290 · Cited by 72
An Ad Omnia Approach to Defining and Achieving Private Data Analysis
Dwork, C. (2008) · Springer eBooks · doi:10.1007/978-3-540-78478-4_1 · Cited by 63
Self-citation
Cited by
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
Self-citationRAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response
Erlingsson, Ú., Pihur, V., & Korolova, A. (2014) · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2660267.2660348 · Cited by 1,838
Differential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
Protecting Locations with Differential Privacy under Temporal Correlations
Xiao, Y., & Xiong, L. (2015) · Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2810103.2813640 · Cited by 376
Private and Continual Release of Statistics
Chan, T.-H. H., Shi, E., & Song, D. (2011) · ACM Transactions on Information and System Security · doi:10.1145/2043621.2043626 · Cited by 352
Metadata
- Authors
- Dwork, C., Naor, M., Pitassi, T., & Rothblum, G. N.
- Venue
- Proceedings of the forty-second ACM symposium on Theory of computing
- Publisher
- ACM
- Published
- 2010-06-05
- Pages
- 715-724
- OpenAlex
- W2009611335
- Cited by
- 583
- References
- 30
- FWCI
- 14.55
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.