Private record matching using differential privacy

Advances in Database Technology - EDBT 2010 - 13th International Conference on Extending Database Technology, Proceedings

Volumn , Issue , 2010, Pages 123-134

  Inan, Ali ^a   Kantarcioglu, Murat ^a   Ghinita, Gabriel ^b   Bertino, Elisa ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Differential privacy; Privacy; Record matching; Security

Indexed keywords

ALTERNATIVE DESIGNS; DATA INDEXING STRUCTURES; DATA SETS; DISTANCE BASED MATCHING; DISTANCE FUNCTIONS; K-ANONYMITY; K-D TREE; NEW MODEL; REAL-WORLD; SANITIZATION; SECURE MULTI-PARTY COMPUTATION; STATISTICAL QUERIES; SUB-SETS;

COST REDUCTION; DATABASE SYSTEMS; TECHNOLOGY;

TREES (MATHEMATICS);

EID: 77952279809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739059     Document Type: Conference Paper

References (25)

1. R. Agrawal, D. Asonov, M. Kantarcioglu, and Y. Li. Sovereign joins. In ICDE '06, page 26, 2006.
2. R. Agrawal, A. Evfimievski, and R.Srikant. Information sharing across private databases. In Proceedings of ACM SIGMOD 2003.
3. R. Agrawal and R. Srikant. Privacy preserving data mining. Proceedings of ACM SIGMOD, pages 439-450, 2000.
4. A. Al-Lawati, D. Lee, and P. McDaniel. Blocking-aware private record linkage. In Proceedings of IQIS 2005, Baltimore, Maryland, 2005.
5. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. SIGMOD Rec., 19(2):322-331, 1990.
6. T. Churces and P. Christen. Some methods for blindfolded record linkage. Medical Informatics and Decision Making, 4(9), 2004.
7. C. Clifton, M. Kantarcioǧlu, X. Lin, J. Vaidya, and M. Zhu. Tools for privacy preserving distributed data mining. SIGKDD Explorations, 4(2):28-34, Jan. 2003.
8. C. Dwork. Differential privacy. In ICALP (2), pages 1-12, 2006.
9. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In TCC, pages 265-284, 2006.
10. M. G. Elfeky, A. K. Elmagarmid, and V. S. Verykios. TAILOR: A record linkage tool box. In ICDE '02, pages 17-28, 2002.
11. A. Elmagarmid, G. Panagiotis, and S. Verykios. Duplicate record detection: A survey. IEEE TKDE, 19(1), 2007.
12. F. Emekci, D. Agrawal, A. El Abbadi, and A. Gulbeden. Privacy preserving query processing using third parties. In Proceedings of ICDE 2006, Atlanta, GA, 2006.
13. M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Eurocrypt 2004, May 2-6 2004.
14. O. Goldreich. The Foundations of Cryptography, volume 2, chapter General Cryptographic Protocols. Cambridge University Press, 2004.
15. B. A. Huberman, M. Franklin, and T. Hogg. Enhancing privacy and trust in electronic communities. In Proceedings of the First ACM Conference on Electronic Commerce (EC99), pages 78-86, 1999.
16. A. Inan, M. Kantarcioglu, E. Bertino, and M. Scannapieco. A hybrid approach to private record linkage. In ICDE '08, pages 496-505, 2008.
17. M. Kantarcioglu, W. Jiang, Y. Liu, and B. Malin. A cryptographic approach to securely share and query genomic sequences. IEEE Transactions on information technology in biomedicine, To appear.
18. L. Kissner and D. Song. Privacy-preserving set operations. In Advances in Cryptology - CRYPTO 2005, 2005.
19. K. LeFevre, D. J. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE '06, pages 25-35, 2006.
20. N. Li, T. Li, and S. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In Proc. of ICDE 2007, pages 106-115.
21. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. ICDE 2006, page 24, 2006.
22. M. Scannapieco, I. Figotin, E. Bertino, and A. Elmagarmid. Privacy preserving schema and data matching. In SIGMOD, page 653, 2007.
23. L. Sweeney. k-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems, 10:557-570, 2002.
24. J. Vaidya and C. Clifton. Secure set intersection cardinality with application to association rule mining. Journal of Computer Security, 13(4), Nov. 2005.
25. X. Xiao and Y. Tao. Output perturbation with query relaxation. PVLDB, 1(1):857-869, 2008.