Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Multidimensional access methods
ACM Computing Surveys (CSUR)
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the foundations of the universal relation model
ACM Transactions on Database Systems (TODS)
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Tools for privacy preserving distributed data mining
ACM SIGKDD Explorations Newsletter
Properties of Embedding Methods for Similarity Searching in Metric Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Record Linkage in Large Data Sets
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Secure and private sequence comparisons
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Blocking-aware private record linkage
Proceedings of the 2nd international workshop on Information quality in information systems
Distributed privacy preserving information sharing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Privacy Preserving Query Processing Using Third Parties
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Record linkage: similarity measures and algorithms
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
On honesty in sovereign information sharing
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
An Approach to Evaluate Data Trustworthiness Based on Data Provenance
SDM '08 Proceedings of the 5th VLDB workshop on Secure Data Management
The VLDB Journal — The International Journal on Very Large Data Bases
The Challenge of Assuring Data Trustworthiness
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Privacy-Preserving Computation and Verification of Aggregate Queries on Outsourced Databases
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Formal anonymity models for efficient privacy-preserving joins
Data & Knowledge Engineering
Private record matching using differential privacy
Proceedings of the 13th International Conference on Extending Database Technology
Privacy-preserving matching of spatial datasets with protection against background knowledge
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Privacy-preserving record linkage
PSD'10 Proceedings of the 2010 international conference on Privacy in statistical databases
A privacy preserving efficient protocol for semantic similarity join using long string attributes
Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Privacy preserving group linkage
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Instance-based 'one-to-some' assignment of similarity measures to attributes
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part I
Efficient Privacy Preserving Protocols for Similarity Join
Transactions on Data Privacy
Information fusion in data privacy: A survey
Information Fusion
Fake injection strategies for private phonetic matching
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Reference table based k-anonymous private blocking
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Efficient and Practical Approach for Private Record Linkage
Journal of Data and Information Quality (JDIQ)
Frequent grams based embedding for privacy preserving record linkage
Proceedings of the 21st ACM international conference on Information and knowledge management
Pad and Chaff: secure approximate string matching in private record linkage
Proceedings of the 14th International Conference on Information Integration and Web-based Applications & Services
Efficient privacy-aware record integration
Proceedings of the 16th International Conference on Extending Database Technology
LinkIT: privacy preserving record linkage and integration via transformations
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
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
Efficient two-party private blocking based on sorted nearest neighborhood clustering
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
An iterative two-party protocol for scalable privacy-preserving record linkage
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Mining frequent patterns with differential privacy
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need is often in contrast with privacy requirements concerning the data stored by the sources. In this paper, we propose a protocol for record matching that preserves privacy both at the data level and at the schema level. Specifically, if two sources need to identify their common data, by running the protocol they can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. The protocol uses a third party, and maps records into a vector space in order to preserve their privacy. Experimental results show the efficiency of the matching protocol in terms of precision and recall as well as the good computational performance.