The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Revealing information while preserving privacy
Abstract
We examine the tradeoff between privacy and usability of statistical databases. We model a statistical database by an n-bit string d1,..,dn, with a query being a subset q ⊆ [n] to be answered by Σiεq di. Our main result is a polynomial reconstruction algorithm of data from noisy (perturbed) subset sums. Applying this reconstruction algorithm to statistical databases we show that in order to achieve privacy one has to add perturbation of magnitude (Ω√n). That is, smaller perturbation always results in a strong violation of privacy. We show that this result is tight by exemplifying access algorithms for statistical databases that preserve privacy while adding perturbation of magnitude Õ(√n).For time-T bounded adversaries we demonstrate a privacypreserving access algorithm whose perturbation magnitude is ≈ √T.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Cryptography and data security
Denning, D. E. (1982) · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · Cited by 1,904
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335438 · Cited by 1,719
A hard-core predicate for all one-way functions
Goldreich, O., & Levin, L. A. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73010 · Cited by 1,193
On the design and quantification of privacy preserving data mining algorithms
Agrawal, D., & Aggarwal, C. C. (2001) · Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/375551.375602 · Cited by 1,006
Security-control methods for statistical databases: a comparative study
Adam, N. R., & Worthmann, J. C. (1989) · ACM Computing Surveys · doi:10.1145/76894.76895 · Cited by 969
Alon, N., & Spencer, J. H. (2000) · Wiley eBooks · doi:10.1002/0471722154 · Cited by 949
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Sudan, M. (1997) · Journal of Complexity · doi:10.1006/jcom.1997.0439 · Cited by 723
The tracker: a threat to statistical database security
Denning, D. E., & Denning, P. J. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320069 · Cited by 209
Secure statistical databases with random sample queries
Denning, D. E. (1980) · ACM Transactions on Database Systems · doi:10.1145/320613.320616 · Cited by 204
Secure databases: protection against user influence
Dobkin, D., Jones, A. K., & Lipton, R. J. (1979) · ACM Transactions on Database Systems · doi:10.1145/320064.320068 · Cited by 203
A data distortion by probability distribution
Liew, C. K., Choi, U. J., & Liew, C. J. (1985) · ACM Transactions on Database Systems · doi:10.1145/3979.4017 · Cited by 202
Statistical Databases: Characteristics, Problems, and some Solutions
Shoshani, A. (1982) · Very Large Data Bases · Cited by 201
Auditing and Inference Control in Statistical Databases
Chin, F. Y., & Ozsoyoglu, G. (1982) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1982.236161 · Cited by 189
On the Question of Statistical Confidentiality
Fellegi, I. P. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481199 · Cited by 180
The statistical security of a statistical database
Traub, J. F., Yemini, Y., & Woźniakowski, H. (1984) · ACM Transactions on Database Systems · doi:10.1145/1994.383392 · Cited by 156
A security machanism for statistical database
Beck, L. L. (1980) · ACM Transactions on Database Systems · doi:10.1145/320613.320617 · Cited by 135
Practical data-swapping: the first steps
Reiss, S. P. (1984) · ACM Transactions on Database Systems · doi:10.1145/348.349 · Cited by 123
Kleinberg, J. M., Papadimitriou, C. H., & Raghavan, P. (2003) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(02)00036-3 · Cited by 76
Kleinberg, J. M., Papadimitriou, C. H., & Raghavan, P. (2000) · doi:10.1145/335168.335210 · Cited by 64
An Analytic Approach to Statistical Databases
Lefons, E., SILVESTRI, A., & Tangorra, F. (1983) · Cited by 54
The Effectiveness Of Output Modification By Rounding For Protection Of Statistical Data Bases*
Achugbue, J. O., & Chin, F. Y. L. (1979) · INFOR Information Systems and Operational Research · doi:10.1080/03155986.1979.11731734 · Cited by 25
Cited by
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
Dwork, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_1 · Cited by 5,291
The Algorithmic Foundations of Differential Privacy
Dwork, C., & Roth, A. (2013) · doi:10.1561/9781601988195 · Cited by 3,856
L -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
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542
Metadata
- Authors
- Dinur, I., & Nissim, K.
- Venue
- Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 2003-06-09
- Pages
- 202-210
- OpenAlex
- W2110868467
- Cited by
- 980
- References
- 25
- FWCI
- 13.01
- 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.