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

N/ACitations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Wang, P., Wang, H., & Pieprzyk, J. (2008). Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5339 LNCS, pp. 178–195). https://doi.org/10.1007/978-3-540-89641-8_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free