Obfuscated databases and group privacy

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2005, Pages 102-111

  Narayanan, Arvind ^a   Shmatikov, Vitaly ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Database privacy; Obfuscation

Indexed keywords

ACCESS CONTROL; DATABASE PRIVACY; ENCRYPTED DATABASE; OBFUSCATION;

COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; COMPUTER SOFTWARE; DATABASE SYSTEMS; PUBLIC KEY CRYPTOGRAPHY; QUERY LANGUAGES;

SECURITY OF DATA;

EID: 33745784545     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1102120.1102135     Document Type: Conference Paper

References (27)

1. D. Aucsmith, Tamper resistant software: an implementation. In Proc. 1st International Workshop on Information Hiding, volume 1174 of LNCS, pages 317-333. Springer, 1996.
2. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, and K. Yang. On the (im) possibility of obfuscating programs. In Proc. Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 1-18. Springer, 2001.
3. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Locally random reductions: improvements and applications. J. Cryptology, 10:17-36, 1997.
4. D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano. Public key encryption with keyword search. In Proc. Advances in Cryptology - EUROCRYPT 2004, volume 3027 of LNCS, pages 506-522. Springer, 2004.
5. R. Canetti. Towards realizing random oracles: hash functions that hide all partial information. In Proc. Advances in Cryptology - CRYPTO 1997, volume 1294 of LNCS, pages 455-469. Springer, 1997.
6. R. Canetti, D. Micciancio, and O. Reingold. Perfectly one-way probabilistic hash functions. In Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), pages 131-140. ACM, 1998.
7. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Towards privacy in public databases. In Proc. 2nd Theory of Cryptography Conference (TCC), volume 3378 of LNCS, pages 363-385. Springer, 2005.
8. B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan. Private information retrieval. J. ACM, 45(6):965-981, 1998.
9. S. Chow, P. Eisen, H. Johnson, and P. van Oorschot. White-box cryptography and an AES implementation. In 9th Annual International Workshop on Selected Areas in Cryptography (SAC), volume 2595 of LNCS, pages 250-270. Springer, 2003.
10. S. Chow, P. Eisen, H. Johnson, and P. van Oorschot. A white-box DES implementation for DRM applications. In ACM Digital Rights Management Workshop, volume 2696 of LNCS, pages 1-15. Springer, 2003.
11. C. Collberg and C. Thomborson. Watermarking, tamper-proofing, and obfuscation - tools for software protection. IEEE Transactions on Software Engineering, 28(8):735-746, 2002.
12. C. Collberg, C. Thomborson, and D. Low. A taxonomy of obfuscating transformations. Technical Report 148, Department of Computer Sciences, The University of Auckland, July 1997.
13. C. Collberg, C. Thomborson, and D. Low. Manufacturing cheap, resilient, and stealthy opaque constructs. In Proc. 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 184-196. ACM, 1998.
14. D. Dean and A. Stubblefield. Using client puzzles to protect TLS. In Proc. 10th USENIX Security Symposium, pages 1-8. USENIX, 2001.
15. Y. Dodis and A. Smith. Correcting errors without leaking partial information. In Proc. 37th Annual ACM Symposium on Theory of Computing (STOC), pages 654-663. ACM, 2005.
16. C. Dwork and M. Naor. Pricing via processing or combatting junk mail, In Proc. Advances in Cryptology - CRYPTO 1992, volume 740 of LNCS, pages 139-147. Springer, 1993.
17. M. Franklin and D. Malkhi. Auditable metering with lightweight security. J. Computer Security, 6(4):237-255, 1998.
18. Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin. Protecting data privacy in private information retrieval schemes, In Proc. 30th Annual ACM Symposium on Theory of Computing (STOC), pages 151-160. ACM, 1998,
19. O. Goldreich and R. Ostrovsky. Software protection and simulation on oblivious rams. J. ACM, 43(3):431-473, 1996.
20. Y. Ishai, A. Sahai, and D. Wagner. Private circuits: securing hardware against probing attacks. In Proc. Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 463-481. Springer, 2003.
21. A. Juels and J. Brainard. Client puzzles: a cryptographic defense against connection depletion. In Proc. Network and Distributed System Security Symposium (NDSS), pages 151-165. The Internet Society, 1999.
22. B. Lynn, M. Prabhakaran, and A. Sahai. Positive results and techniques for obfuscation. In Proc. Advances in Cryptology - EUROCRYPT 2004, volume 3027 of LNCS, pages 20-39, Springer, 2004.
23. R. Rivest. Partial-match retrieval algorithms. SIAM Journal of Computing, 5(1):19-50, 1976.
24. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
25. D. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In Proc. IEEE Symposium on Security and Privacy, pages 44-55. IEEE Computer Society, 2000.
26. X. Wang and M. Reiter. Defending against denial-of-service attacks with puzzle auctions. In Proc. IEEE Symposium on Security and Privacy, pages 78-92. IEEE Computer Society, 2003.
27. H. Wee. On obfuscating point functions. In Proc. 37th Annual ACM Symposium on Theory of Computing (STOC), pages 523-532. ACM, 2005.