International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Secure Similarity Search

Authors:
Hyun-A Park
Bum Han Kim
Dong Hoon Lee
Yon Dohn Chung
Justin Zhan
Download:
URL: http://eprint.iacr.org/2007/312
Search ePrint
Search Google
Abstract: 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.
BibTeX
@misc{eprint-2007-13592,
  title={Secure Similarity Search},
  booktitle={IACR Eprint archive},
  keywords={applications / similarity search on encrypted data},
  url={http://eprint.iacr.org/2007/312},
  note={ kokokzi@cist.korea.ac.kr 13737 received 11 Aug 2007},
  author={Hyun-A Park and Bum Han Kim and Dong Hoon Lee and Yon Dohn Chung and Justin Zhan},
  year=2007
}