Keyword field-free conjunctive keyword searches on encrypted data and extension for dynamic groups
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.
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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Journal Article|
|Additional Information:||Paper presented in the 7th International Conference, CANS 2008, Hong-Kong, China, December 2-4, 2008|
|Divisions:||Current > QUT Faculties and Divisions > Science & Engineering Faculty|
|Deposited On:||22 Jul 2014 03:47|
|Last Modified:||22 Jul 2014 23:00|
Repository Staff Only: item control page