Cryptology ePrint Archive: Report 2010/492
Eﬃcient Fully Secure Predicate Encryption for Conjunctions, Disjunctions and k-CNF/DNF formulae
Angelo De Caro and Vincenzo Iovino and Giuseppe Persiano
Abstract: Predicate encryption is an important cryptographic primitive that has found wide applications as it allows for fine-grained key management. In a predicate encryption scheme for a class C of predicates, the owner of the master secret key can derive a secret key Sk_P for any predicate P in C. Similarly, when encrypting plaintext M , the sender can specify an attribute vector x for the ciphertext Ct. Then, key Sk_P can decrypt all ciphertexts Ct with attribute vector x such
that P(x) = 1.
In this paper, we give fully secure implementations Conjunctions, Disjunctions and k-CNF/DNF predicates that guarantee the security of the plaintext and of the attribute. Our constructions for Disjunctions and Conjunctions are linear in the number of variables. Previous fully secure constructions for Disjunction required time exponential in the number of variables while for Conjunctions the best previous construction was quadratic in the number of variables.
Category / Keywords: functional encryption, full security, pairing-based cryptography.
Date: received 17 Sep 2010, last revised 7 Mar 2012
Contact author: iovino at dia unisa it
Available format(s): PDF | BibTeX Citation
Version: 20120307:082348 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]