Keyword Field-Free Conjunctive Keyword Searches on Encrypted Data and Extension for Dynamic Groups

  • Authors:
  • Peishun Wang;Huaxiong Wang;Josef Pieprzyk

  • Affiliations:
  • Center for Advanced Computing --- Algorithms and Cryptography, Department of Computing, Macquarie University, Australia NSW 2109;Center for Advanced Computing --- Algorithms and Cryptography, Department of Computing, Macquarie University, Australia NSW 2109 and Division of Mathematical Sciences, School of Physical and Mathe ...;Center for Advanced Computing --- Algorithms and Cryptography, Department of Computing, Macquarie University, Australia NSW 2109

  • Venue:
  • CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.