Public key encryption with conjunctive keyword search and its extension to a multi-user system

  • Authors:
  • Yong Ho Hwang;Pil Joong Lee

  • Affiliations:
  • Department of Computer Science, Johns Hopkins University, Baltimore, MD;Department of Electronic and Electrical Engineering, POSTECH, Pohang, Korea

  • Venue:
  • Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of a public key encryption with conjunctive keyword search (PECK). The keyword searchable encryption enables a user to outsource his data to the storage of an untrusted server and to have the ability to selectively search his data without leaking information. The PECK scheme provides the document search containing each of several keywords over a public key setting. First, we construct an efficient PECK scheme whose security is proven over a decisional linear Diffie-Hellman assumption in the random oracle model. In comparison with previous schemes, our scheme has the shortest ciphertext size and private key size, and requires a comparable computation overhead. Second, we discuss problems related to the security proof of previous schemes and show they cannot guarantee complete security. Finally, we introduce a new concept called a multi-user PECK scheme, which can achieve an efficient computation and communication overhead and effectively manage the storage in a server for a number of users.