Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SIAM Journal on Computing
Generating Hard Instances of the Short Basis Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
An Identity Based Encryption Scheme Based on Quadratic Residues
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Improved proxy re-encryption schemes with applications to secure distributed storage
ACM Transactions on Information and System Security (TISSEC)
Attribute-based encryption for fine-grained access control of encrypted data
Proceedings of the 13th ACM conference on Computer and communications security
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Proceedings of the forty-first annual ACM symposium on Theory of computing
On lattices, learning with errors, random linear codes, and cryptography
Journal of the ACM (JACM)
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the forty-second ACM symposium on Theory of computing
Worry-free encryption: functional encryption with public keys
Proceedings of the 17th ACM conference on Computer and communications security
From secrecy to soundness: efficient verification via secure computation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Fully secure functional encryption with general relations from the decisional linear assumption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Chosen-Ciphertext Security via Correlated Products
SIAM Journal on Computing
Functional encryption: definitions and challenges
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Efficient Fully Homomorphic Encryption from (Standard) LWE
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Securely Obfuscating Re-Encryption
Journal of Cryptology
New techniques for dual system encryption and fully secure HIBE with short ciphertexts
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Fuzzy identity-based encryption
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient lattice (H)IBE in the standard model
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Functional encryption for inner product predicates from learning with errors
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
How to delegate and verify in public: verifiable computation from attribute-based encryption
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Trapdoors for lattices: simpler, tighter, faster, smaller
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Functional encryption for threshold functions (or fuzzy IBE) from lattices
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Foundations of garbled circuits
Proceedings of the 2012 ACM conference on Computer and communications security
Attribute-Based functional encryption on lattices
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Witness encryption and its applications
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Reusable garbled circuits and succinct functional encryption
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
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. We present attribute-based encryption schemes for circuits of any arbitrary polynomial size, where the public parameters and the ciphertext grow linearly with the depth of the circuit. Our construction is secure under the standard learning with errors (LWE) assumption. Previous constructions of attribute-based encryption were for Boolean formulas, captured by the complexity class NC1. In the course of our construction, we present a new framework for constructing ABE schemes. As a by-product of our framework, we obtain ABE schemes for polynomial-size branching programs, corresponding to the complexity class LOGSPACE, under quantitatively better assumptions.