Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products Export

@incollection{citeulike:2719457, 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 SK f 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 (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.}, author = {Katz, Jonathan and Sahai, Amit and Waters, Brent}, citeulike-article-id = {2719457}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-78967-3_9}, doi = {10.1007/978-3-540-78967-3_9}, journal = {Advances in Cryptology – EUROCRYPT 2008}, keywords = {pairings, predicate}, pages = {146--162}, posted-at = {2008-04-25 21:51:38}, priority = {2}, title = {Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products}, url = {http://dx.doi.org/10.1007/978-3-540-78967-3_9}, year = {2008} }

TY - CHAP ID - citeulike:2719457 L3 - citeulike-article-id:2719457 N2 - 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 SK f 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 (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. JF - Advances in Cryptology – EUROCRYPT 2008 EP - 162 TI - Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products SP - 146 KW - pairings KW - predicate AU - Katz, Jonathan AU - Sahai, Amit AU - Waters, Brent PY - 2008/// UR - http://dx.doi.org/10.1007/978-3-540-78967-3_9 ER -