Privacy-preserving data linkage protocols

WPES'04: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society

Volumn , Issue , 2004, Pages 94-102

  O'Keefe, Christine M ^a   Yung, Ming ^a   Gu, Lifang ^a   Baxter, Rohan ^b  

^a CSIRO   (Australia)

^b Australian Taxation Office Canberra   (Australia)

Author keywords

Confidentiality; Data Extraction; Data Linkage; Privacy

Indexed keywords

DATA PRIVACY; DATA REDUCTION; DATABASE SYSTEMS; IDENTIFICATION (CONTROL SYSTEMS); INFORMATION ANALYSIS; INFORMATION DISSEMINATION; PUBLIC KEY CRYPTOGRAPHY;

CONFIDENTIALITY; DATA EXTRACTION; DATA LINKAGE; DATA SOURCES; DATABASE TABLES;

NETWORK PROTOCOLS;

EID: 20444470394     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1029179.1029203     Document Type: Conference Paper

References (15)

1. R. Agrawal, A. Evfimievski, and R. Srikant. Information sharing across private databases. In SIGMOD 2003, pages 86-97. ACM, 2003.
2. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM Conference on Computer and Communications Security, pages 62-73, 1993.
3. D. Boneh. The decision Diffie-Hellman problem. Lecture Notes in Computer Science, 1423:48-63, 1998.
4. F. Borst, F. Allaert, and C. Quantin. The Swiss solution for anonymously chaining patient files. In Proc. of MEDINFO 2001, 2001.
5. T. Churches and P. Christen. Blind data linkage using n-gram similarity comparisons. In Proc. of PAKDD'04, pages 121-126, Sydney, Australia, May 26-28 2004.
6. L. Dusserre, C. Quantin, and H. Bouzelat. A one way public key cryptosystem for the linkage of nominal files in epidemiological studies. International Journal of Medical Informatics, 8:644-647, 1995.
7. M. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. Preprint, 2004.
8. C. Kelman, A. Bass, and C. Holman. Research use of linked health data - a best practice protocol. Australian and New Zealand Journal of Public Health, 26:251-255, 2002.
9. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 448-457. Society for Industrial and Applied Mathematics, 2001.
10. G. Navarro. A guided tour to approximate string matching. ACM Computing Survey, 33(1):31-88, 2001.
11. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - EUROCRYPT '99, pages 223-238, 1999.
12. K. Pommerening, M. Miller, I. Schidtmann, and J. Michaelis. Pseudonyms for cancer registries. Methods of Information in Medicine, 35:112-121, 1996.
13. C. Quantin, H. Bouzelat, F. Allaert, A. Benhamiche, J. Faivre, and L. Dussere. How to ensure data security of an epidemiological follow-up: quality assessment of an anonymous record linkage procedure. International Journal of Medical Informatics, 49:117-122, 1998.
14. RSA Laboratories. PKCS#1: RSA cryptography standard. 2002.
15. V. Shoup. A proposal for an ISO standard for public key encryption. Available at http://www.shoup.net/papers, 2001.