Secure Similarity Search

One of the most substantial ways to protect users' sensitive information is encryption. This paper is about the keyword index search system on encrypted documents. It has been thought that the search with errors over encrypted data is impossible because 1 bit difference over plaintexts may reduce to enormous bits difference over cyphertexts. We propose a novel idea to deal with the search with errors over encrypted data. We develop two similarity search schemes, implement the prototypes and provide substantial analysis. We define security requirements for the similarity search over encrypted data. The first scheme can achieve perfect privacy in similarity search but the second scheme is more efficient.

[1]  Dong Hoon Lee,et al.  Secure Similarity Search , 2007, 2007 IEEE International Conference on Granular Computing (GRC 2007).

[2]  Josep Domingo-Ferrer,et al.  A Provably Secure Additive and Multiplicative Privacy Homomorphism , 2002, ISC.

[3]  Hakan Hacigümüs,et al.  Efficient Execution of Aggregation Queries over Encrypted Relational Databases , 2004, DASFAA.

[4]  Horst Bunke,et al.  On Median Graphs: Properties, Algorithms, and Applications , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Dawn Song,et al.  Anonymous Multi-Attribute Encryption with Range Query and Conditional Decryption∗ , 2006 .

[6]  Gene Tsudik,et al.  Aggregation Queries in the Database-As-a-Service Model , 2006, DBSec.

[7]  Dong Hoon Lee,et al.  Secure Index Search for Groups , 2005, TrustBus.

[8]  Dawn Xiaodong Song,et al.  Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[9]  Christian Grothoff,et al.  Efficient Sharing of Encrypted Data , 2002, ACISP.

[10]  Hakan Hacigümüs,et al.  Executing SQL over encrypted data in the database-service-provider model , 2002, SIGMOD '02.

[11]  Brent Waters,et al.  Conjunctive, Subset, and Range Queries on Encrypted Data , 2007, TCC.

[12]  Lawrence B. Holder,et al.  Structural Pattern Recognition in Graphs , 2003 .

[13]  Ricardo A. Baeza-Yates,et al.  Matchsimile: a Flexible Approximate Matching Tool for Searching Proper Name , 2003, J. Assoc. Inf. Sci. Technol..

[14]  Stanley B. Zdonik,et al.  Fast, Secure Encryption for Indexing in a Column-Oriented DBMS , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[15]  Kaoru Kurosawa,et al.  Oblivious keyword search , 2004, J. Complex..

[16]  Mikhail J. Atallah,et al.  Secure Biometric Authentication for Weak Computational Devices , 2005, Financial Cryptography.

[17]  Atsuhiro Takasu.  An approximate multi-word matching algorithm for robust document retrieval , 2006, CIKM '06.

[18]  Michael Mitzenmacher,et al.  Privacy Preserving Keyword Searches on Remote Encrypted Data , 2005, ACNS.

[19]  Radu Sion,et al.  Conjunctive Keyword Search on Encrypted Data with Completeness and Computational Privacy , 2005, IACR Cryptol. ePrint Arch..

[20]  Tanja Lange,et al.  Searchable encryption revisited , 2006, CRYPTO 2006.

[21]  Rafail Ostrovsky,et al.  Public Key Encryption with Keyword Search , 2004, EUROCRYPT.

[22]  Gonzalo Navarro,et al.  A guided tour to approximate string matching , 2001, CSUR.

[23]  Brent Waters,et al.  Building an Encrypted and Searchable Audit Log , 2004, NDSS.

[24]  Gonzalo Navarro,et al.  Faster Approximate String Matching , 1999, Algorithmica.

[25]  Hakan Hacigümüs,et al.  Query Optimization in Encrypted Database Systems , 2005, DASFAA.

[26]  Dong Hoon Lee,et al.  Efficient Conjunctive Keyword Search on Encrypted Data Storage System , 2006, EuroPKI.

[27]  Ricardo A. Baeza-Yates,et al.  Text-Retrieval: Theory and Practice , 1992, IFIP Congress.

[28]  A. Rizzi,et al.  Automatic Image Classification by a Granular Computing Approach , 2006, 2006 16th IEEE Signal Processing Society Workshop on Machine Learning for Signal Processing.

[29]  J. Ferrer.  A new privacy homomorphism and applications , 1996 .

[30]  Moni Naor,et al.  Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..

[31]  George Karypis,et al.  Frequent Substructure-Based Approaches for Classifying Chemical Compounds , 2005, IEEE Trans. Knowl. Data Eng..

[32]  Graham Cormode,et al.  The string edit distance matching problem with moves , 2002, SODA '02.

[33]  Gultekin Özsoyoglu,et al.  Anti-Tamper Databases: Querying Encrypted Databases , 2003, DBSec.

[34]  Mihir Bellare,et al.  Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions , 2005, Journal of Cryptology.

[35]  Lucas Ballard,et al.  Achieving Efficient Conjunctive Keyword Searches over Encrypted Data , 2005, ICICS.