Efficient Fully Secure (Hierarchical) Predicate Encryption for Conjunctions, Disjunctions and K-CNF/DNF Formulae

Download Now Free registration required

Executive Summary

Predicate encryption is an important cryptographic primitive that has been recently studied and that has found wide applications as it allows for fine-grained key management. Roughly speaking, in a predicate encryption scheme for predicate Q the owner of the master secret key Msk can derive secret key SkQ, for any predicate Q for a specified class of predicates. In encrypting plaintext M, the sender can specify an attribute vector ~x and the resulting ciphertext Ct can be decrypted only by using keys SkQ such that Q(~x) = 1.

  • Format: PDF
  • Size: 144.4 KB