Two-Party Computation Model for Privacy-Preserving Queries over Distributed Databases

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2009

Volumn , Issue , 2009, Pages

  Chow, Sherman S M ^a   Lee, Jie Han ^a   Subramanian, Lakshminarayanan ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DISTRIBUTED DATABASE SYSTEMS; NETWORK SECURITY; SCALABILITY;

ALTERNATIVE SYSTEMS; COMPUTATION MODEL; CRYPTOGRAPHIC TECHNIQUES; DISTRIBUTED DATABASE; LARGE DATABASE; PRIVACY PRESERVING; PRIVATE INFORMATION; SENSITIVE INFORMATIONS; TRUSTED PARTY; TWO-PARTY COMPUTATION;

PRIVACY-PRESERVING TECHNIQUES;

EID: 79960885939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. G. Aggarwal, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi, R. Motwani, U. Srivastava, D. Thomas, and Y. Xu. Two Can Keep A Secret: A Distributed Architecture for Secure Database Services. In Conference on Innovative Data Systems Research (CIDR 2005), pages 186–199, 2005.
2. G. Aggarwal, N. Mishra, and B. Pinkas. Secure Computation of the kth-Ranked Element. In EUROCRYPT 2004, LNCS 3027, pages 40–55. Springer, 2004.
3. R. Agrawal, D. Asonov, M. Kantarcioglu, and Y. Li. Sovereign Joins. In ICDE 2006, page 26. IEEE Computer Society, 2006.
4. R. Agrawal, A. V. Evfimievski, and R. Srikant. Information Sharing Across Private Databases. In SIG-MOD 2003, pages 86–97. ACM, 2003.
5. S. Ajmani, R. Morris, and B. Liskov. A Trusted Third-Party Computation Service. Technical Report MIT-LCS-TR-847, MIT, May 2001.
6. M. Bellare, A. Boldyreva, and A. O’Neill. Deterministic and Efficiently Searchable Encryption. In CRYPTO, LNCS 4622, pages 535–552. Springer, 2007.
7. M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In CCS 1993, pages 62–73, 1993.
8. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. Public Key Encryption with Keyword Search. In EUROCRYPT 2004, LNCS 3027, pages 506–522. Springer, 2004.
9. D. Boneh, E.-J. Goh, and K. Nissim. Evaluating 2-DNF Formulas on Ciphertexts. In TCC 2005, pages 325–341, 2005.
10. C. Boyd and A. Maturia. Protocols for Authentication and Key Establishment. Springer-Verlag, 2003.
11. J. W. Byun, H. S. Rhee, H.-A. Park, and D. H. Lee. Off-Line Keyword Guessing Attacks on Recent Keyword Search Schemes over Encrypted Data. In Secure Data Management, LNCS 4165, pages 75–83. Springer, 2006.
12. Y. Dodis and A. Yampolskiy. A Verifiable Random Function with Short Proofs and Keys. In PKC 2005, LNCS 3386, pages 416–431. Springer, 2005.
13. F. Emekçi, D. Agrawal, A. E. Abbadi, and A. Gulbeden. Privacy Preserving Query Processing Using Third Parties. In ICDE 2006, page 27. IEEE Computer Society, 2006.
14. Centers for Medicare & Medicaid Services. The Health Insurance Portability and Accountability Act of 1996 (HIPAA). http://www.cms.hhs.gov/ hipaaGenInfo.
15. M. J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword Search and Oblivious Pseudorandom Functions. In TCC 2005, pages 303–324, 2005.
16. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. In EUROCRYPT 2004, LNCS 3027, pages 1–19. Springer, 2004.
17. O. Goldreich. Foundations of Cryptography, volume 1. Cambridge University Press, 2001.
18. O. Goldreich. Foundations of Cryptography, volume 2. Cambridge University Press, 2004.
19. O. Goldreich, S. Micali, and A. Wigderson. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC 1987, pages 218–229. ACM, 1987.
20. S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM J. Comput., 18(1):186–208, 1989.
21. C. Hazay and Y. Lindell. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. In TCC 2008, pages 155–175, 2008.
22. N. Jefferies, C. J. Mitchell, and M. Walker. A Proposed Architecture for Trusted Third Party Services. In Cryptography: Policy and Algorithms, LNCS 1029, pages 98–104. Springer, 1995.
23. L. Kissner and D. X. Song. Privacy-Preserving Set Operations. In CRYPTO 2005, LNCS 3621, pages 241–257. Springer, 2005.
24. Y. Lindell and B. Pinkas. Privacy Preserving Data Mining. J. Cryptology, 15(3):177–206, 2002.
25. S. Micali, M. O. Rabin, and S. P. Vadhan. Verifiable Random Functions. In FOCS 1999, pages 120–130, 1999.
26. E. Mykletun and G. Tsudik. On Security of Sovereign Joins. Cryptology ePrint Archive, Report 2006/380, 2006.
27. M. Naor, B. Pinkas, and R. Sumner. Privacy Preserving Auctions and Mechanism Design. In Electronic Commerce 1999, pages 129–139. ACM, 1999.
28. NYCLIX. New York Clinical Information Exchange. http://www.nyclix.org.
29. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In EUROCRYPT 99, LNCS 1592, pages 223–238. Springer, 1999.
30. I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In SIG-COMM 2001, pages 149–160, 2001.
31. M. Stonebraker, P. M. Aoki, W. Litwin, A. Pfeffer, A. Sah, J. Sidell, C. Staelin, and A. Yu. Mariposa: A Wide-Area Distributed Database System. VLDB J., 5(1):48–63, 1996.
32. J. Vaidya and C. Clifton. Privacy-Preserving Top-K Queries. In ICDE 2005, pages 545–546. IEEE Computer Society, 2005.