Secure index search for groups

Hyun A. Park, Jin Wook Byun, Dong Hoon Lee

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

13 Citations (Scopus)

Abstract

A secure index search protocol makes it possible to search for the index of encrypted documents using specified keywords even without decrypting them. An untrusted server storing the documents learns nothing more than the search result about the documents without revealing the keyword. Secure index search protocols in the literature only consider a search process between a single-user and a server. However, in real organizations such as government offices or enterprises with many departments, a group search occurs more often. In this paper, we study natural extension of previous results, i.e., secure index search between a server and group members, where a file may be shared by a group or a person with a server. The difficulty in designing such a group setting arises from dynamic group, where each member of the group may join to or leave from the group. To resolve this difficulty efficiently, we propose novel secure index search protocols without reencryption of the old encrypted documents when group keys are updated.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsS. Katsikas, J. Lopez, G. Pernul
Pages128-140
Number of pages13
Volume3592
Publication statusPublished - 2005
EventSecond International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2005 - Copenhagen, Denmark
Duration: 2005 Aug 222005 Aug 26

Other

OtherSecond International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2005
CountryDenmark
CityCopenhagen
Period05/8/2205/8/26

Fingerprint

Servers
Network protocols
Industry

Keywords

  • Database
  • Hierarchical group
  • Index search
  • Keyword
  • Privacy

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Park, H. A., Byun, J. W., & Lee, D. H. (2005). Secure index search for groups. In S. Katsikas, J. Lopez, & G. Pernul (Eds.), Lecture Notes in Computer Science (Vol. 3592, pp. 128-140)

Secure index search for groups. / Park, Hyun A.; Byun, Jin Wook; Lee, Dong Hoon.

Lecture Notes in Computer Science. ed. / S. Katsikas; J. Lopez; G. Pernul. Vol. 3592 2005. p. 128-140.

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

Park, HA, Byun, JW & Lee, DH 2005, Secure index search for groups. in S Katsikas, J Lopez & G Pernul (eds), Lecture Notes in Computer Science. vol. 3592, pp. 128-140, Second International Conference on Trust, Privacy and Security in Digital Business, TrustBus 2005, Copenhagen, Denmark, 05/8/22.
Park HA, Byun JW, Lee DH. Secure index search for groups. In Katsikas S, Lopez J, Pernul G, editors, Lecture Notes in Computer Science. Vol. 3592. 2005. p. 128-140
Park, Hyun A. ; Byun, Jin Wook ; Lee, Dong Hoon. / Secure index search for groups. Lecture Notes in Computer Science. editor / S. Katsikas ; J. Lopez ; G. Pernul. Vol. 3592 2005. pp. 128-140
@inproceedings{bb37c8eb04b64567988088d0d9b19130,
title = "Secure index search for groups",
abstract = "A secure index search protocol makes it possible to search for the index of encrypted documents using specified keywords even without decrypting them. An untrusted server storing the documents learns nothing more than the search result about the documents without revealing the keyword. Secure index search protocols in the literature only consider a search process between a single-user and a server. However, in real organizations such as government offices or enterprises with many departments, a group search occurs more often. In this paper, we study natural extension of previous results, i.e., secure index search between a server and group members, where a file may be shared by a group or a person with a server. The difficulty in designing such a group setting arises from dynamic group, where each member of the group may join to or leave from the group. To resolve this difficulty efficiently, we propose novel secure index search protocols without reencryption of the old encrypted documents when group keys are updated.",
keywords = "Database, Hierarchical group, Index search, Keyword, Privacy",
author = "Park, {Hyun A.} and Byun, {Jin Wook} and Lee, {Dong Hoon}",
year = "2005",
language = "English",
volume = "3592",
pages = "128--140",
editor = "S. Katsikas and J. Lopez and G. Pernul",
booktitle = "Lecture Notes in Computer Science",

}

TY - GEN

T1 - Secure index search for groups

AU - Park, Hyun A.

AU - Byun, Jin Wook

AU - Lee, Dong Hoon

PY - 2005

Y1 - 2005

N2 - A secure index search protocol makes it possible to search for the index of encrypted documents using specified keywords even without decrypting them. An untrusted server storing the documents learns nothing more than the search result about the documents without revealing the keyword. Secure index search protocols in the literature only consider a search process between a single-user and a server. However, in real organizations such as government offices or enterprises with many departments, a group search occurs more often. In this paper, we study natural extension of previous results, i.e., secure index search between a server and group members, where a file may be shared by a group or a person with a server. The difficulty in designing such a group setting arises from dynamic group, where each member of the group may join to or leave from the group. To resolve this difficulty efficiently, we propose novel secure index search protocols without reencryption of the old encrypted documents when group keys are updated.

AB - A secure index search protocol makes it possible to search for the index of encrypted documents using specified keywords even without decrypting them. An untrusted server storing the documents learns nothing more than the search result about the documents without revealing the keyword. Secure index search protocols in the literature only consider a search process between a single-user and a server. However, in real organizations such as government offices or enterprises with many departments, a group search occurs more often. In this paper, we study natural extension of previous results, i.e., secure index search between a server and group members, where a file may be shared by a group or a person with a server. The difficulty in designing such a group setting arises from dynamic group, where each member of the group may join to or leave from the group. To resolve this difficulty efficiently, we propose novel secure index search protocols without reencryption of the old encrypted documents when group keys are updated.

KW - Database

KW - Hierarchical group

KW - Index search

KW - Keyword

KW - Privacy

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

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

M3 - Conference contribution

VL - 3592

SP - 128

EP - 140

BT - Lecture Notes in Computer Science

A2 - Katsikas, S.

A2 - Lopez, J.

A2 - Pernul, G.

ER -