Protecting data privacy through hard-to-reverse negative databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4176 LNCS, Issue , 2006, Pages 72-84

  Esponda, Fernando ^a   Ackley, Elena S ^b   Helman, Paul ^b   Jia, Haixia ^b   Forrest, Stephanie ^b  

^a Yale University   (United States)

^b University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATABASE SYSTEMS; IMAGE ANALYSIS; IMAGE COMPRESSION; INFORMATION TECHNOLOGY;

NEGATIVE DATABASE (NDB); NEGATIVE IMAGE;

DATA PRIVACY;

EID: 33750273651     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11836810_6     Document Type: Conference Paper

References (41)

1. D. Achlioptas, Beame, and Molloy. A sharp threshold in proof complexity. In STOC: ACM Symposium on Theory of Computing (STOC), 2001.
2. D. Achlioptas, C. Gomes, H. Kautz, and B. Selman. Generating satisfiable problem instances. In Proceedings of AAAI-00 and IAAI-00, pages 256-261, Menlo Park, CA, July 30- 3 2000. AAAI Press.
3. k log 2 - O(k). JAMS: Journal of the American Mathematical Society, 17, 2004.
4. N. R. Adam and J. C. Wortman. Security-control methods for statistical databases. ACM Computing Surveys, 21(4):515-556, December 1989.
5. D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In Symposium on Principles of Database Systems, pages 247-255, 2001.
6. R. Agrawal and R. Srikant. Privacy-preserving data mining. In Proc. of the ACM SIGMOD Conference on Management of Data, pages 439-450. ACM Press, May 2000.
7. J. Cohen Benaloh and M. de Mare. One-way accumulators: A decentralized alternative to digital signatures. In Advances in Cryptology - EUROCRYPT '93, pages 274-285, 1994.
8. G. R. Blakley and C. Meadows. A database encryption scheme which allows the computation of statistics using encrypted data. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 116-122. IEEE CS Press, 1985.
9. M. Blum and S. Goldwasser. An efficient probabilistic public-key encryption scheme which hides all partial information. In George Robert Blakely and David Chaum, editors, Advances in Cryptology: proceedings of CRYPTO 84, volume 196 of Lecture Notes in Computer Science, pages 289-302, Berlin, Germany / Heidelberg, Germany / London, UK / etc., 1985. Springer-Verlag.
10. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Moti Yung, editor, Advances in Cryptology - CRYPTO ' 2002, volume 2442 of Lecture Notes in Computer Science, pages 61-76. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 2002.
11. F. Chin. Security problems on inference control for sum, max, and min queries. J. ACM, 33(3):451-464, 1986.
12. S. A. Cook and D. G. Mitchell. Finding hard instances of the satisfiability problem: A survey. In Du, Gu, and Pardalos, editors, Satisfiability Problem: Theory and Applications, volume 35 of Dimacs Series in Discrete Mathematics and Theoretical Computer Science, pages 1-17. American Mathematical Society, 1997.
13. D. Denning. Cryptography and Data Security. AddisonWesley, Reading, MA, 1982.
14. D.E. Denning and J. Schlorer. Inference controls for statistical databases. Computer, 16(7):69-82, July 1983.
15. D. Dobkin, A. Jones, and R. Lipton. Secure databases: Protection against user influence. ACM Transactions on Database Systems, 4(1):97-106, March 1979.
16. F. Esponda. Negative Representations of Information. PhD thesis, University of New Mexico, 2005.
17. F. Esponda, E. S. Ackley, S. Forrest, and P. Helman. On-line negative databases. In Proceedings of ICARIS, 2004.
18. F. Esponda, E. S. Ackley, S. Forrest, and P. Helman. On-line negative databases (with experimental results). International Journal of Unconventional Computing, 1(3):201-220, 2005.
19. F. Esponda, S. Forrest, and P. Helman. Enhancing privacy through negative representations of data. Technical report, University of New Mexico, 2004.
20. F. Esponda, S. Forrest, and P. Helman. Negative representations of information. Submitted to International Journal of Information Security, 2004.
21. S. Even and Y. Yacobi. Cryptography and np-completeness. In Proc. 7th Colloq. Automata, Languages, and Programming (Lecture Notes in Computer Science), volume 85, pages 195-207. Springer-Verlag, 1980.
22. J. Feigenbaum, E. Grosse, and J. A. Reeds. Cryptographic protection of membership lists. 9(1):16-20, 1992.
23. J. Feigenbaum, M. Y. Liberman, and R. N. Wright. Cryptographic protection of databases and software. In Distributed Computing and Cryptography, pages 161-172. American Mathematical Society, 1991.
24. C. Fiorini, E. Martinelli, and F. Massacci. How to fake an RSA signature by encoding modular root finding as a SAT problem. Discrete Appl. Math., 130(2):101-127, 2003.
25. I. P. Gent and T. Walsh. The SAT phase transition. In Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI'94), pages 105-109, 1994.
26. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2000.
27. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, 1984.
28. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from oneway functions. In Proceedings of the twenty-first annual ACM symposium on Theory of computing, pages 12-24. ACM Press, 1989.
29. R. Impagliazzo and M. Naor. Efficient cryptographic schemes provably as secure as subset sum. In IEEE, editor, 30th annual Symposium on Foundations of Computer Science, October 30-November 1, 1989, Research Triangle Park, NC, pages 236-241, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1989. IEEE Computer Society Press.
30. H. Jia, C. Moore, and D. Strain. Generating hard satisfiable formulas by hiding solutions deceptively. In AAAI, 2005.
31. H. A. Kautz, Y. Ruan, D. Achlioptas, C. Gomes, B. Selman, and M. E. Stickel. Balance and filtering in structured satisfiable problems. In IJCAI, pages 351-358, 2001.
32. N. S. Matloff. Inference control via query restriction vs. data modification: a perspective. In on Database Security: Status and Prospects, pages 159-166. North-Holland Publishing Co., 1988.
33. R. C. Merkle and M. E. Hellman. Hiding information and signatures in trapdoor knapsacks. IT-24:525-530, 1978.
34. S. Micali, M. Rabin, and J. Kilian. Zero-knowledge sets. In Proc. FOCS 2003., page 80, 2003.
35. D. Mitchell, B. Selman, and H. Levesque. Problem solving: Hardness and easiness - hard and easy distributions of SAT problems. In Proceeding of (AAAI-92), pages 459-465. AAAI Press, Menlo Park, California, USA, 1992.
36. M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing: Seattle, Washington, May 15-17, 1989, pages 33-43, New York, NY 10036, USA, 1989. ACM Press.
37. A. M. Odlyzko. The rise and fall of knapsack cryptosystems. In Carl Pomerance and S. Goldwasser, editors, Cryptology and Computational Number Theory, volume 42 of Proceedings of symposia in applied mathematics. AMS short course lecture notes, pages 75-88. pub-AMS, 1990.
38. R. Ostrovsky, C. Rackoff, and A. Smith. Efficient consistency proofs for generalized queries on a committed database. In ICALP: Annual International Colloquium on Automata, Languages and Programming, pages 1041-1053, 2004.
39. P. Shaw, K. Stergiou, and T. Walsh. Arc consistency and quasigroup completion. In In Proceedings of ECAI98 Workshop on Non-binary Constraints, 1998.
40. P. Tendick and N. Matloff. A modified random perturbation method for database security. ACM Trans. Database Syst., 19(1):47-63, 1994.
41. P. Wayner. Translucent Databases. Flyzone Press, 2002.