Title
Secure Similarity Joins Using Fully Homomorphic Encryption
Abstract
Similarity joins are important database operations that can identify pairs of roughly similar records. Due to their many applications (e.g., duplicate elimination and plagiarism detection), a number of algorithms have been created to enhance similarity joins, especially in terms of performance. However, in some cases, the privacy of the data being joined also becomes an important aspect to consider, as leaking sensitive information can result in grave consequences for individuals, enterprises and governmental organizations. We propose a protocol for secure execution of similarity joins that is based on fully homomorphic cryptosystems, which are resistant to a number of attacks and provide flexibility to calculate the similarity between encrypted records. We also consider the adaptation of filter techniques to improve the efficiency of the protocol by reducing the number of record pairs that are compared. In addition, we exploit modern hardware to parallelize the solution and evaluate the performance of the proposal using real datasets.
Year
DOI
Venue
2017
10.1145/3151759.3151788
19TH INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES (IIWAS2017)
Keywords
Field
DocType
Similarity Joins, Fully Homomorphic Encryption, Security, Privacy
Homomorphic encryption,Data mining,Joins,Plagiarism detection,Computer science,Cryptosystem,Encryption,Exploit,Information sensitivity
Conference
Citations 
PageRank 
References 
0
0.34
19
Authors
5
Name
Order
Citations
PageRank
Mateus S. H. Cruz110.69
Toshiyuki Amagasa242178.46
Chiemi Watanabe313323.21
Wenjie Lu4142.68
Hiroyuki Kitagawa51031148.79