Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

  • Jonathan Katz
  • Amit Sahai
  • Brent Waters
Conference paper

DOI: 10.1007/978-3-540-78967-3_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4965)
Cite this paper as:
Katz J., Sahai A., Waters B. (2008) Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. In: Smart N. (eds) Advances in Cryptology – EUROCRYPT 2008. EUROCRYPT 2008. Lecture Notes in Computer Science, vol 4965. Springer, Berlin, Heidelberg

Abstract

Predicate encryption is a new paradigm generalizing, among other things, identity-based encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used to decrypt a ciphertext associated with attribute I if and only if f(I) = 1. Constructions of such schemes are currently known for relatively few classes of predicates.

We construct such a scheme for predicates corresponding to the evaluation of inner products over Open image in new window (for some large integer N). This, in turn, enables constructions in which predicates correspond to the evaluation of disjunctions, polynomials, CNF/DNF formulae, or threshold predicates (among others). Besides serving as a significant step forward in the theory of predicate encryption, our results lead to a number of applications that are interesting in their own right.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jonathan Katz
    • 1
  • Amit Sahai
    • 2
  • Brent Waters
    • 3
  1. 1.University of Maryland 
  2. 2.UCLA 
  3. 3.SRI International 

Personalised recommendations