z-logo
open-access-imgOpen Access
Multiuser private queries over encrypted databases
Author(s) -
Yanjiang Yang,
Feng Bao,
Xuhua Ding,
Robert H. Deng
Publication year - 2009
Publication title -
international journal of applied cryptography
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 15
eISSN - 1753-0571
pISSN - 1753-0563
DOI - 10.1504/ijact.2009.028029
Subject(s) - computer science , encryption , database , information retrieval , computer security
Searchable encryption schemes allow users to perform keyword-based searches on an encrypted database. Almost all existing such schemes only consider the scenario where a single user acts as both the data owner and the querier. However, most databases in practice do not just serve one user; instead, they support search and write operations by multiple users. In this paper, we systematically study searchable encryption in a practical multiuser setting. Our results include a set of security notions for multiuser searchable encryption as well as a construction which is provably secure under the newly introduced security notions. We also discuss how to improve query efficiency.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom