Paper 2007/312
Secure Similarity Search
Hyun-A Park, Bum Han Kim, Dong Hoon Lee, Yon Dohn Chung, and Justin Zhan
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.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- similarity search on encrypted data
- Contact author(s)
- kokokzi @ cist korea ac kr
- History
- 2007-08-16: received
- Short URL
- https://ia.cr/2007/312
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2007/312,
author = {Hyun-A Park and Bum Han Kim and Dong Hoon Lee and Yon Dohn Chung and Justin Zhan},
title = {Secure Similarity Search},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/312},
year = {2007},
url = {https://eprint.iacr.org/2007/312}
}
