A Hybrid Approach to Private Record Matching

@article{Inan2012AHA,
  title={A Hybrid Approach to Private Record Matching},
  author={Ali Inan and Murat Kantarcioglu and Gabriel Ghinita and Elisa Bertino},
  journal={IEEE Transactions on Dependable and Secure Computing},
  year={2012},
  volume={9},
  pages={684-698}
}
Real-world entities are not always represented by the same set of features in different data sets. Therefore, matching records of the same real-world entity distributed across these data sets is a challenging task. If the data sets contain private information, the problem becomes even more difficult. Existing solutions to this problem generally follow two approaches: sanitization techniques and cryptographic techniques. We propose a hybrid technique that combines these two approaches and… Expand
Secure Logical Schema and Decomposition Algorithm for Proactive Context Dependent Attribute Based Access Control
TLDR
This work defines a proactive decomposition algorithm according to the attribute based policy rules and builds a secure logical schema in which relations are decomposed into several ones in order to inhibit joins or inferences that may violate predefined privacy constraints. Expand
Evaluation and Criteria of Privacy Preserving Data Mining Techniques
Big Data refers to the massive amount of data which is impossible to manage and use efficiently using traditional tools and techniques. Big Data is currently one of the fastest growing field in theExpand
PraDa: Privacy-preserving Data-Deduplication-as-a-Service
TLDR
This paper designs two efficient privacy-preserving data-deduplication methods for the DCaS paradigm, and analyzes the robustness of the two methods against the attacks that exploit the auxiliary frequency distribution and the knowledge of the encoding algorithms. Expand
A survey of privacy preserving data integration
  • V. Shelake, N. Shekokar
  • Computer Science
  • 2017 International Conference on Electrical, Electronics, Communication, Computer, and Optimization Techniques (ICEECCOT)
  • 2017
TLDR
This survey provides the various challenges, review of existing work and research directions for privacy preserving data integration, and some of them compromise accuracy while maintaining privacy of integrated data. Expand
Privacy Preserving Intersection of Neighbor Sets Exploiting Cross Checking Capability in a Peer to Peer Social Network Service
TLDR
A Bloom filter based approach to compute the intersection of neighbors between two nodes in SNSes that can get a near perfect intersection with mostly zero or one false common neighbors and can successfully hide the neighbor information from attackers. Expand
Privacy Preserving Intersection of Neighbor Sets Exploiting Cross Checking Capability in a Peer to Peer Social Network Service
TLDR
A Bloom filter based approach to compute the intersection of neighbors between two nodes in SNSes that can get a near perfect intersection with mostly zero or one false common neighbors and can successfully hide the neighbor information from attackers. Expand
A Review of Differential Privacy in Individual Data Release
TLDR
This paper explains the key aspects of basic concepts and implementation mechanisms related to differential privacy, the existing research results are concluded, and shortcomings of existing methods and suggested directions for future research are presented. Expand
Secure Massive Data Storage With Consistency And Route Control On The Cloud
TLDR
In this research work, a new efficient technique is proposed which indicates the effectiveness, flexibility of the storage and retrieval process by a generic framework which fills the gap between the security needs and challenges. Expand
Distance Computation between Two Private Preference Functions
TLDR
This work provides protocols that solve the problem: two parties have each a private function, for example one that outputs the party’s preferences on a set of alternatives; they wish to compute the distance between their functions without any of the parties revealing its function to the other. Expand
Extensive medical data storage with prominent symmetric algorithms on cloud - A protected framework
TLDR
A new efficient technique is proposed which indicates the effectiveness, flexibility of the storage and retrieval process by a generic framework which fills the gap between the security needs and challenges. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 37 REFERENCES
A Hybrid Approach to Private Record Linkage
TLDR
This paper proposes a method that combines these two approaches and enables users to trade off between privacy, accuracy and cost and yields much more accurate matching results compared to sanitization techniques, even when the data sets are perturbed extensively. Expand
Private record matching using differential privacy
TLDR
Experiments conducted on the real-world Census-income dataset show that, although the proposed methods provide strong privacy, their effectiveness in reducing matching cost is not far from that of k-anonymity based counterparts. Expand
Privacy preserving schema and data matching
TLDR
A protocol for record matching that preserves privacy both at the data level and at the schema level is proposed, and by running the protocol two sources can compute the matching of their datasets without sharing their data in clear and only sharing the result of the matching. Expand
Privacy preserving record linkage approaches
TLDR
This work proposes a certain methodology for preserving the privacy of various record linkage approaches, implements, examines and compares four pairs of privacy preserving record linkage methods and protocols and presents also a blocking scheme as an extension to the privacy preserve record linkage methodology. Expand
Privacy Preserving Query Processing Using Third Parties
TLDR
A new query processing technique using third parties in a peer-to-peer system that is able to answer queries without revealing any useful information to the data sources or to the third parties is proposed. Expand
Privacy Preserving Data Mining
TLDR
This work considers a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information, and proposes a protocol that is considerably more efficient than generic solutions and demands both very few rounds of communication and reasonable bandwidth. Expand
Formal anonymity models for efficient privacy-preserving joins
TLDR
An extended version of the protocol is introduced in which data holders append k-anonymous features of their consumers to their encrypted submissions, which facilitate a more efficient join computation, while providing a formal guarantee that each record is linkable to no less than k individuals in the union of all organizations' consumers. Expand
Efficient Private Matching and Set Intersection
TLDR
This work considers the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain, and presents protocols, based on the use of homomorphic encryption and balanced hashing, for both semi-honest and malicious environments. Expand
Privacy-Preserving Set Operations
TLDR
By building a framework of multiset operations, employing the mathematical properties of polynomials, this work designs efficient, secure, and composable methods to enable privacy-preserving computation of the union, intersection, and element reduction operations. Expand
Incognito: efficient full-domain K-anonymity
TLDR
A set of algorithms for producing minimal full-domain generalizations are introduced, and it is shown that these algorithms perform up to an order of magnitude faster than previous algorithms on two real-life databases. Expand
...
1
2
3
4
...