Conjunctive keywords searchable encryption with efficient pairing, constant ciphertext and short trapdoor

  • Authors:
  • Zhenhua Chen;Chunying Wu;Daoshun Wang;Shundong Li

  • Affiliations:
  • School of Computer Science, Shaanxi Normal University, Xi'an, China;School of Computer Science, Shaanxi Normal University, Xi'an, China;Department of Computer Science and Technology, Tsinghua University, China;School of Computer Science, Shaanxi Normal University, Xi'an, China

  • Venue:
  • PAISI'12 Proceedings of the 2012 Pacific Asia conference on Intelligence and Security Informatics
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

A conjunctive keyword searchable encryption scheme makes it possible to retrieve several keywords in encrypted data at one time. In this paper, we present a conjunctive keyword searchable encryption with constant pairing, short ciphertext and trapdoor in the standard model. We also propose two concrete constructions and give their security analysis. The first scheme is constructed in composite order groups model and the second scheme is implemented in prime order groups model. Under assumed standard model, our proposed schemes achieve higher computation efficiency and shorter ciphertext/trapdoor, which have flexible applications in multiple keywords search and filter such as email filtering, firewall and copyright protection.