2013 · 399 citations · 19 references
ComputingComputer ScienceMathematicsAlgorithmsCryptographyTheory Of ComputationAttribute-based EncryptionBoolean AlgebraCircuit ComplexityInformation-theoretic SecurityKeysNc Complexity ClassPolynomial-size Circuits
In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an l-bit public index pind and a message m, and a secret key is associated with a Boolean predicate P. The secret key allows to decrypt the ciphertext and learn m iff P(pind) = 1. Moreover, the scheme should be secure against collusions of users, namely, given secret keys for polynomially many predicates, an adversary learns nothing about the message if none of the secret keys can individually decrypt the ciphertext.
19
Fully homomorphic encryption using ideal lattices
Craig Gentry · 2009 · 6.6K citations
Attribute-based encryption for fine-grained access control of encrypted data
Vipul Goyal, Omkant Pandey, Amit Sahai et al. · 2006 · 5K citations
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · Journal of the ACM · 2009 · 2.2K citations
Efficient Fully Homomorphic Encryption from (Standard) LWE
Zvika Brakerski, Vinod Vaikuntanathan · 2011 · 1.5K citations
Public-key cryptosystems from the worst-case shortest vector problem
Chris Peikert · 2009 · 804 citations