skip to main content
research-article
Free Access

Understanding database reconstruction attacks on public data

Published:21 February 2019Publication History
Skip Abstract Section

Abstract

These attacks on statistical databases are no longer a theoretical danger.

References

  1. Adam, N.R., Worthmann, J.C. Security-control methods for statistical databases: A comparative study. ACM Computing Surveys 21, 4 (1989), 515--556 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Biere, A. PicoSAT essentials. J. Satisfiability, Boolean Modeling and Computation 4, (2008), 75--97; https://bit.ly/2QcziqWGoogle ScholarGoogle ScholarCross RefCross Ref
  3. Blum, A., Dwork, C., McSherry, F. Nissim, K. Practical privacy: The SuLQ framework. In Proceedings of the 24<sup>th</sup> ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2005, 128--138; https://dl.acm.org/citation.cfm?id=1065184. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dinur, I., Nissim, K. Revealing information while preserving privacy. In Proceedings of the 22<sup>nd</sup> ACM SIGMOD-SIGACT-SIGART Principles of Database Systems, 2003, 202--210; https://dl.acm.org/citation.cfm?id=773173. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Dwork, C., McSherry, F., Nissim, K., Smith, A. 2006. Calibrating noise to sensitivity in private data analysis. In Proceedings of the 3<sup>rd</sup> Conference on Theory of Cryptography, 2006, 265--284. Springer-Verlag, Berlin, Heidelberg Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Dwork, C., Nissim, K. Privacy-preserving datamining on vertically partitioned databases. In Proceedings of the 24<sup>th</sup> International Cryptology Conference 3152, 2004, 528--544. Springer Verlag, Santa Barbara, CA; https://bit.ly/2zKunmJGoogle ScholarGoogle ScholarCross RefCross Ref
  7. Heule, M.J.H., Kullmann, O. The science of brute force. Commun. ACM 60, 8 (Aug. 2017), 70--79 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Kleinberg, J., Papadimitriou, C., Raghavan, P. Auditing Boolean attributes. In Proceedings of the 19<sup>th</sup> ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000, 86--91 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Kong, S., Malec, D. Cook-Levin theorem. Lecture, University of Wisconsin, 2007.Google ScholarGoogle Scholar
  10. Marques-Silva, J., Lynce, I., Malik, S. Conflict-driven clause learning SAT solvers. Handbook of Satisfiability, 131--153. IOS Press, Amsterdam, The Netherlands, 2009.Google ScholarGoogle Scholar
  11. McCarthy, J. Recursive functions of symbolic expressions and their computation by machine, part I. Commun. ACM 3, 4 (Apr. 1960), 184--195; https://dl.acm.org/citation.cfm?id=367199. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Metin, H., Baarir, S., Colange, M., Kordon, F. CDCLSym: Introducing effective symmetry breaking in SAT solving. Tools and Algorithms for the Construction and Analysis of Systems. D. Beyer and M. Huisman, eds. Springer International Publishing, 2018, 99--114; https://link.springer.com/chapter/10.1007/978-3-319-89960-2_6.Google ScholarGoogle Scholar
  13. Tamura, N., Taga, A., Kitagawa, S., Banbara, M. Compiling finite linear CSP into SAT. Contraints 14, 2 (2009), 254--272; https://dl.acm.org/citation.cfm?id=1527316; http://bach.istc.kobe-u.ac.jp/sugar/. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Whitney, C.R. Jeanne Calment, world's elder, dies at 122. New York Times (Aug. 5, 1997); https://nyti.ms/2kM4oFb.Google ScholarGoogle Scholar
  15. Zayatz, L., Lucero, J., Massell, P., Ramanayake, A. Disclosure avoidance for Census 2010 and American Community Survey five-year tabular data products. Statistical Research Division, U.S. Census Bureau; https://www.census.gov/srd/CDAR/rrs2009-10_ACS_5yr.pdf.Google ScholarGoogle Scholar

Index Terms

  1. Understanding database reconstruction attacks on public data

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image Communications of the ACM
        Communications of the ACM  Volume 62, Issue 3
        March 2019
        109 pages
        ISSN:0001-0782
        EISSN:1557-7317
        DOI:10.1145/3314328
        Issue’s Table of Contents

        Copyright © 2019 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 21 February 2019

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Popular
        • Refereed

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format