Efficient conjunctive keyword search on encrypted data storage system

Jin Wook Byun, Dong Hoon Lee, Jong In Lim

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

48 Citations (Scopus)

Abstract

We study conjunctive keyword search scheme allowing for remote search of data containing each of several keywords on encrypted data storage system. A data supplier first uploads encrypted data on a storage system, and then a user of the storage system searches data containing keywords over encrypted data hence insider (such as an administrator of the storage system) and outsider attackers do not learn anything else about the data. Recently, Golle et al. first suggested conjunctive keyword search scheme, but the communication and storage costs linearly depend on the number of stored data in the database, hence it is not really suitable for a large scale database. In this paper, we propose an efficient conjunctive keyword search scheme over encrypted data in aspects of communication and storage costs. Concretely, we reduce the storage cost of a user and the communication cost between a user and a data supplier to the constant amounts. We formally define security model for a conjunctive keyword search scheme and prove that the proposed scheme is secure under the decisional bilinear Diffie-Hellman (DBDH) assumption in the random oracle model.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages184-196
Number of pages13
Volume4043 LNCS
Publication statusPublished - 2006 Jul 27
EventThird European PKI Workshop, Public Key Infrastructure - Theory and Practice, EuroPKI 2006 - Turin, Italy
Duration: 2006 Jun 192006 Jun 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4043 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherThird European PKI Workshop, Public Key Infrastructure - Theory and Practice, EuroPKI 2006
CountryItaly
CityTurin
Period06/6/1906/6/20

Fingerprint

Keyword Search
Information Storage and Retrieval
Data Storage
Storage System
Information Systems
Data storage equipment
Costs and Cost Analysis
Communication
Costs
Databases
Administrative Personnel
Security Model
Random Oracle Model
Diffie-Hellman
Communication Cost
Linearly

Keywords

  • Conjunctive keyword search over encrypted data
  • Database security and privacy

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Byun, J. W., Lee, D. H., & Lim, J. I. (2006). Efficient conjunctive keyword search on encrypted data storage system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4043 LNCS, pp. 184-196). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4043 LNCS).

Efficient conjunctive keyword search on encrypted data storage system. / Byun, Jin Wook; Lee, Dong Hoon; Lim, Jong In.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4043 LNCS 2006. p. 184-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4043 LNCS).

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

Byun, JW, Lee, DH & Lim, JI 2006, Efficient conjunctive keyword search on encrypted data storage system. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4043 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4043 LNCS, pp. 184-196, Third European PKI Workshop, Public Key Infrastructure - Theory and Practice, EuroPKI 2006, Turin, Italy, 06/6/19.
Byun JW, Lee DH, Lim JI. Efficient conjunctive keyword search on encrypted data storage system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4043 LNCS. 2006. p. 184-196. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Byun, Jin Wook ; Lee, Dong Hoon ; Lim, Jong In. / Efficient conjunctive keyword search on encrypted data storage system. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4043 LNCS 2006. pp. 184-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9a054ee4b60e415cab955d67a4644f11,
title = "Efficient conjunctive keyword search on encrypted data storage system",
abstract = "We study conjunctive keyword search scheme allowing for remote search of data containing each of several keywords on encrypted data storage system. A data supplier first uploads encrypted data on a storage system, and then a user of the storage system searches data containing keywords over encrypted data hence insider (such as an administrator of the storage system) and outsider attackers do not learn anything else about the data. Recently, Golle et al. first suggested conjunctive keyword search scheme, but the communication and storage costs linearly depend on the number of stored data in the database, hence it is not really suitable for a large scale database. In this paper, we propose an efficient conjunctive keyword search scheme over encrypted data in aspects of communication and storage costs. Concretely, we reduce the storage cost of a user and the communication cost between a user and a data supplier to the constant amounts. We formally define security model for a conjunctive keyword search scheme and prove that the proposed scheme is secure under the decisional bilinear Diffie-Hellman (DBDH) assumption in the random oracle model.",
keywords = "Conjunctive keyword search over encrypted data, Database security and privacy",
author = "Byun, {Jin Wook} and Lee, {Dong Hoon} and Lim, {Jong In}",
year = "2006",
month = "7",
day = "27",
language = "English",
isbn = "3540351515",
volume = "4043 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "184--196",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Efficient conjunctive keyword search on encrypted data storage system

AU - Byun, Jin Wook

AU - Lee, Dong Hoon

AU - Lim, Jong In

PY - 2006/7/27

Y1 - 2006/7/27

N2 - We study conjunctive keyword search scheme allowing for remote search of data containing each of several keywords on encrypted data storage system. A data supplier first uploads encrypted data on a storage system, and then a user of the storage system searches data containing keywords over encrypted data hence insider (such as an administrator of the storage system) and outsider attackers do not learn anything else about the data. Recently, Golle et al. first suggested conjunctive keyword search scheme, but the communication and storage costs linearly depend on the number of stored data in the database, hence it is not really suitable for a large scale database. In this paper, we propose an efficient conjunctive keyword search scheme over encrypted data in aspects of communication and storage costs. Concretely, we reduce the storage cost of a user and the communication cost between a user and a data supplier to the constant amounts. We formally define security model for a conjunctive keyword search scheme and prove that the proposed scheme is secure under the decisional bilinear Diffie-Hellman (DBDH) assumption in the random oracle model.

AB - We study conjunctive keyword search scheme allowing for remote search of data containing each of several keywords on encrypted data storage system. A data supplier first uploads encrypted data on a storage system, and then a user of the storage system searches data containing keywords over encrypted data hence insider (such as an administrator of the storage system) and outsider attackers do not learn anything else about the data. Recently, Golle et al. first suggested conjunctive keyword search scheme, but the communication and storage costs linearly depend on the number of stored data in the database, hence it is not really suitable for a large scale database. In this paper, we propose an efficient conjunctive keyword search scheme over encrypted data in aspects of communication and storage costs. Concretely, we reduce the storage cost of a user and the communication cost between a user and a data supplier to the constant amounts. We formally define security model for a conjunctive keyword search scheme and prove that the proposed scheme is secure under the decisional bilinear Diffie-Hellman (DBDH) assumption in the random oracle model.

KW - Conjunctive keyword search over encrypted data

KW - Database security and privacy

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

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

M3 - Conference contribution

SN - 3540351515

SN - 9783540351511

VL - 4043 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 184

EP - 196

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -