Privacy-preserving data linkage protocols

Authors:
Christine M. O'Keefe;Ming Yung;Lifang Gu;Rohan Baxter
Affiliations:
CSIRO ICT Centre, Canberra, AUSTRALIA;CSIRO ICT Centre, Canberra, AUSTRALIA;CSIRO ICT Centre, Canberra, AUSTRALIA;Australian Taxation Office, Canberra, AUSTRALIA
Venue:
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Year:
2004

Citing 6
Cited 9

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)
The Decision Diffie-Hellman Problem

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Information sharing across private databases

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Privacy-Preserving Set Union

ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Improving the Use, Analysis and Integration of Patient Health Data

Advanced Web and NetworkTechnologies, and Applications
Geocode Matching and Privacy Preservation

Privacy, Security, and Trust in KDD
Practical issues on privacy-preserving health data mining

PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
Protecting Privacy Against Record Linkage Disclosure: A Bounded Swapping Approach for Numeric Data

Information Systems Research
A probabilistic geocoding system utilising a parcel based address file

Data Mining
A taxonomy of privacy-preserving record linkage techniques

Information Systems
An efficient two-party protocol for approximate matching in private record linkage

AusDM '11 Proceedings of the Ninth Australasian Data Mining Conference - Volume 121
An iterative two-party protocol for scalable privacy-preserving record linkage

AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address the problem of data linkage and data extraction across database tables of sensitive information about individuals, in an environment of constraints on organisations' ability to share data and a need to protect individuals' privacy and confidentiality. We propose several privacy-preserving data linkage and data extraction protocols. Our first protocol enables data linkage across separate database tables, without requiring any identifying information to be revealed to any party outside the originating data source. Our second protocol enables the extraction of a cohort of individuals' data from a data source, without revealing the membership of any individual in that cohort to the data source. We describe a variation of the first protocol which enables data sources to generate common pseudonyms without revealing any identifying information to any party, and show how the protocols are applicable for any number of data sources.