Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions

Johannes Blömer; Gennadij Liske

Paper 2014/511

Constructing CCA-secure predicate encapsulation schemes from CPA-secure schemes and universal one-way hash functions

Johannes Blömer and Gennadij Liske

Abstract

We present a new transformation of chosen-plaintext secure predicate encryption schemes with public index into chosen-ciphertext secure schemes. Our construction requires only a universal one-way hash function and is selectively secure in the standard model. The transformation is not generic but can be applied to various existing schemes constructed from bilinear groups. Using common structural properties of these schemes we provide an efficient and simple transformation without overhead in form of one-time signatures or message authentication codes as required in the known generic transformations.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint. MINOR revision.
Keywords: predicate key encapsulation mechanism chosen-ciphertext security predicate encryption with public index bilinear groups universal one-way hash function
Contact author(s): gennadij liske @ upb de
History: 2014-06-30: received
Short URL: https://ia.cr/2014/511
License: CC BY

BibTeX

@misc{cryptoeprint:2014/511,
      author = {Johannes Blömer and Gennadij Liske},
      title = {Constructing {CCA}-secure predicate encapsulation schemes from {CPA}-secure schemes and universal one-way hash functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/511},
      year = {2014},
      url = {https://eprint.iacr.org/2014/511}
}