Efficient Encrypted Keyword Search for Multi-user Data Sharing

Aggelos Kiayias; Ozgur Oksuz; Alexander Russell; Qiang Tang; Bing Wang

doi:10.1007/978-3-319-45744-4_9

Efficient Encrypted Keyword Search for Multi-user Data Sharing

Aggelos Kiayias, Ozgur Oksuz, Alexander Russell, Qiang Tang, Bing Wang

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we provide a secure and efficient encrypted keyword search scheme for multi-user data sharing. Specifically, a data owner outsources a set of encrypted files to an untrusted server, shares it with a set of users, and a user is allowed to search keywords in a subset of files that he is authorized to access. In the proposed scheme, (a) each user has a constant size secret key, (b) each user generates a constant size trapdoor for a keyword without getting any help from any party (e.g., data owner), independent of the number of files that he is authorized to search, and (c) for the keyword ciphertexts of a file, the network bandwidth usage (from the data owner to the server) and storage overhead at the server do not depend on the number of users that are authorized to access the file. We show that our scheme has data privacy and trapdoor privacy. While several recent studies are on secure keyword search for data sharing, we show that they either suffer from scalability issues or lack user privacy.

Original language	English
Title of host publication	Computer Security -- ESORICS 2016
Subtitle of host publication	21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I
Editors	Ioannis Askoxylakis, Sotiris Ioannidis, Sokratis Katsikas, Catherine Meadows
Place of Publication	Cham
Publisher	Springer
Pages	173-195
Number of pages	23
ISBN (Electronic)	978-3-319-45744-4
ISBN (Print)	978-3-319-45743-7
DOIs	https://doi.org/10.1007/978-3-319-45744-4_9
Publication status	E-pub ahead of print - 15 Sept 2016
Event	21st European Symposium on Research in Computer Security - Crete, Greece Duration: 26 Sept 2016 → 30 Sept 2016 http://www.ics.forth.gr/esorics2016/ https://www.ics.forth.gr/esorics2016/

Publication series

Name	Lecture Notes in Computer Science (LNCS)
Publisher	Springer International Publishing
Volume	9878
ISSN (Print)	0302-9743

Conference

Conference	21st European Symposium on Research in Computer Security
Abbreviated title	ESORICS 2016
Country/Territory	Greece
City	Crete
Period	26/09/16 → 30/09/16
Internet address	http://www.ics.forth.gr/esorics2016/ https://www.ics.forth.gr/esorics2016/

Access to Document

10.1007/978-3-319-45744-4_9

sedsAccepted author manuscript, 1.19 MB

http://link.springer.com/chapter/10.1007%2F978-3-319-45744-4_9

Cite this

Kiayias, A., Oksuz, O., Russell, A., Tang, Q., & Wang, B. (2016). Efficient Encrypted Keyword Search for Multi-user Data Sharing. In I. Askoxylakis, S. Ioannidis, S. Katsikas, & C. Meadows (Eds.), Computer Security -- ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I (pp. 173-195). (Lecture Notes in Computer Science (LNCS); Vol. 9878). Springer. Advance online publication. https://doi.org/10.1007/978-3-319-45744-4_9

Kiayias, Aggelos ; Oksuz, Ozgur ; Russell, Alexander et al. / Efficient Encrypted Keyword Search for Multi-user Data Sharing. Computer Security -- ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I. editor / Ioannis Askoxylakis ; Sotiris Ioannidis ; Sokratis Katsikas ; Catherine Meadows. Cham : Springer, 2016. pp. 173-195 (Lecture Notes in Computer Science (LNCS)).

@inproceedings{009c1f4eb3124d79b014956d4bfd4445,

title = "Efficient Encrypted Keyword Search for Multi-user Data Sharing",

abstract = "In this paper, we provide a secure and efficient encrypted keyword search scheme for multi-user data sharing. Specifically, a data owner outsources a set of encrypted files to an untrusted server, shares it with a set of users, and a user is allowed to search keywords in a subset of files that he is authorized to access. In the proposed scheme, (a) each user has a constant size secret key, (b) each user generates a constant size trapdoor for a keyword without getting any help from any party (e.g., data owner), independent of the number of files that he is authorized to search, and (c) for the keyword ciphertexts of a file, the network bandwidth usage (from the data owner to the server) and storage overhead at the server do not depend on the number of users that are authorized to access the file. We show that our scheme has data privacy and trapdoor privacy. While several recent studies are on secure keyword search for data sharing, we show that they either suffer from scalability issues or lack user privacy.",

author = "Aggelos Kiayias and Ozgur Oksuz and Alexander Russell and Qiang Tang and Bing Wang",

year = "2016",

month = sep,

day = "15",

doi = "10.1007/978-3-319-45744-4\_9",

language = "English",

isbn = "978-3-319-45743-7",

series = "Lecture Notes in Computer Science (LNCS)",

publisher = "Springer",

pages = "173--195",

editor = "Ioannis Askoxylakis and Sotiris Ioannidis and Sokratis Katsikas and Catherine Meadows",

booktitle = "Computer Security -- ESORICS 2016",

address = "United Kingdom",

note = "21st European Symposium on Research in Computer Security, ESORICS 2016 ; Conference date: 26-09-2016 Through 30-09-2016",

url = "http://www.ics.forth.gr/esorics2016/, https://www.ics.forth.gr/esorics2016/",

}

Kiayias, A, Oksuz, O, Russell, A, Tang, Q & Wang, B 2016, Efficient Encrypted Keyword Search for Multi-user Data Sharing. in I Askoxylakis, S Ioannidis, S Katsikas & C Meadows (eds), Computer Security -- ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I. Lecture Notes in Computer Science (LNCS), vol. 9878, Springer, Cham, pp. 173-195, 21st European Symposium on Research in Computer Security, Crete, Greece, 26/09/16. https://doi.org/10.1007/978-3-319-45744-4_9

Efficient Encrypted Keyword Search for Multi-user Data Sharing. / Kiayias, Aggelos; Oksuz, Ozgur; Russell, Alexander et al.
Computer Security -- ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I. ed. / Ioannis Askoxylakis; Sotiris Ioannidis; Sokratis Katsikas; Catherine Meadows. Cham: Springer, 2016. p. 173-195 (Lecture Notes in Computer Science (LNCS); Vol. 9878).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Efficient Encrypted Keyword Search for Multi-user Data Sharing

AU - Kiayias, Aggelos

AU - Oksuz, Ozgur

AU - Russell, Alexander

AU - Tang, Qiang

AU - Wang, Bing

PY - 2016/9/15

Y1 - 2016/9/15

N2 - In this paper, we provide a secure and efficient encrypted keyword search scheme for multi-user data sharing. Specifically, a data owner outsources a set of encrypted files to an untrusted server, shares it with a set of users, and a user is allowed to search keywords in a subset of files that he is authorized to access. In the proposed scheme, (a) each user has a constant size secret key, (b) each user generates a constant size trapdoor for a keyword without getting any help from any party (e.g., data owner), independent of the number of files that he is authorized to search, and (c) for the keyword ciphertexts of a file, the network bandwidth usage (from the data owner to the server) and storage overhead at the server do not depend on the number of users that are authorized to access the file. We show that our scheme has data privacy and trapdoor privacy. While several recent studies are on secure keyword search for data sharing, we show that they either suffer from scalability issues or lack user privacy.

AB - In this paper, we provide a secure and efficient encrypted keyword search scheme for multi-user data sharing. Specifically, a data owner outsources a set of encrypted files to an untrusted server, shares it with a set of users, and a user is allowed to search keywords in a subset of files that he is authorized to access. In the proposed scheme, (a) each user has a constant size secret key, (b) each user generates a constant size trapdoor for a keyword without getting any help from any party (e.g., data owner), independent of the number of files that he is authorized to search, and (c) for the keyword ciphertexts of a file, the network bandwidth usage (from the data owner to the server) and storage overhead at the server do not depend on the number of users that are authorized to access the file. We show that our scheme has data privacy and trapdoor privacy. While several recent studies are on secure keyword search for data sharing, we show that they either suffer from scalability issues or lack user privacy.

U2 - 10.1007/978-3-319-45744-4_9

DO - 10.1007/978-3-319-45744-4_9

M3 - Conference contribution

SN - 978-3-319-45743-7

T3 - Lecture Notes in Computer Science (LNCS)

SP - 173

EP - 195

BT - Computer Security -- ESORICS 2016

A2 - Askoxylakis, Ioannis

A2 - Ioannidis, Sotiris

A2 - Katsikas, Sokratis

A2 - Meadows, Catherine

PB - Springer

CY - Cham

T2 - 21st European Symposium on Research in Computer Security

Y2 - 26 September 2016 through 30 September 2016

ER -

Kiayias A, Oksuz O, Russell A, Tang Q, Wang B. Efficient Encrypted Keyword Search for Multi-user Data Sharing. In Askoxylakis I, Ioannidis S, Katsikas S, Meadows C, editors, Computer Security -- ESORICS 2016: 21st European Symposium on Research in Computer Security, Heraklion, Greece, September 26-30, 2016, Proceedings, Part I. Cham: Springer. 2016. p. 173-195. (Lecture Notes in Computer Science (LNCS)). Epub 2016 Sept 15. doi: 10.1007/978-3-319-45744-4_9

Efficient Encrypted Keyword Search for Multi-user Data Sharing

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this