Secure similarity search

Hyun A. Park, Bum Han Kim, Dong Hoon Lee, Yon Dohn Chung, Justin Zhan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

26 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007
Pages598-604
Number of pages7
DOIs
Publication statusPublished - 2007 Dec 1
Event2007 IEEE International Conference on Granular Computing, GrC 2007 - San Jose, CA, United States
Duration: 2007 Nov 22007 Nov 4

Other

Other2007 IEEE International Conference on Granular Computing, GrC 2007
CountryUnited States
CitySan Jose, CA
Period07/11/207/11/4

Fingerprint

Similarity Search
Cryptography
Encryption
Privacy
Prototype
Requirements

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Theoretical Computer Science

Cite this

Park, H. A., Kim, B. H., Lee, D. H., Chung, Y. D., & Zhan, J. (2007). Secure similarity search. In Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007 (pp. 598-604). [4403170] https://doi.org/10.1109/GRC.2007.4403170

Secure similarity search. / Park, Hyun A.; Kim, Bum Han; Lee, Dong Hoon; Chung, Yon Dohn; Zhan, Justin.

Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. p. 598-604 4403170.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, HA, Kim, BH, Lee, DH, Chung, YD & Zhan, J 2007, Secure similarity search. in Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007., 4403170, pp. 598-604, 2007 IEEE International Conference on Granular Computing, GrC 2007, San Jose, CA, United States, 07/11/2. https://doi.org/10.1109/GRC.2007.4403170
Park HA, Kim BH, Lee DH, Chung YD, Zhan J. Secure similarity search. In Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. p. 598-604. 4403170 https://doi.org/10.1109/GRC.2007.4403170
Park, Hyun A. ; Kim, Bum Han ; Lee, Dong Hoon ; Chung, Yon Dohn ; Zhan, Justin. / Secure similarity search. Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007. 2007. pp. 598-604
@inproceedings{405a71612bf444359e1e82c9b7d3d990,
title = "Secure similarity search",
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.",
author = "Park, {Hyun A.} and Kim, {Bum Han} and Lee, {Dong Hoon} and Chung, {Yon Dohn} and Justin Zhan",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/GRC.2007.4403170",
language = "English",
isbn = "076953032X",
pages = "598--604",
booktitle = "Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007",

}

TY - GEN

T1 - Secure similarity search

AU - Park, Hyun A.

AU - Kim, Bum Han

AU - Lee, Dong Hoon

AU - Chung, Yon Dohn

AU - Zhan, Justin

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=46749089241&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=46749089241&partnerID=8YFLogxK

U2 - 10.1109/GRC.2007.4403170

DO - 10.1109/GRC.2007.4403170

M3 - Conference contribution

AN - SCOPUS:46749089241

SN - 076953032X

SN - 9780769530321

SP - 598

EP - 604

BT - Proceedings - 2007 IEEE International Conference on Granular Computing, GrC 2007

ER -