Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups


Autoria(s): Wang, Peishun; Wang, Huaxiong; Pieprzyk, Josef
Data(s)

2008

Resumo

We consider the following problem: a user stores encrypted documents on an untrusted server, and wishes to retrieve all documents containing some keywords without any loss of data confidentiality. Conjunctive keyword searches on encrypted data have been studied by numerous researchers over the past few years, and all existing schemes use keyword fields as compulsory information. This however is impractical for many applications. In this paper, we propose a scheme of keyword field-free conjunctive keyword searches on encrypted data, which affirmatively answers an open problem asked by Golle et al. at ACNS 2004. Furthermore, the proposed scheme is extended to the dynamic group setting. Security analysis of our constructions is given in the paper.

Identificador

http://eprints.qut.edu.au/74261/

Publicador

Springer

Relação

DOI:10.1007/978-3-540-89641-8_13

Wang, Peishun, Wang, Huaxiong, & Pieprzyk, Josef (2008) Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups. Lecture Notes in Computer Science : Cryptology and Network Security, 5339, pp. 178-195.

Fonte

Science & Engineering Faculty

Tipo

Journal Article