Attribute-Based Encryption for Circuits from Multilinear Maps

By Amit Sahai, Brent Waters. Annual International Cryptology Conference, 2012

340 citations recorded by the source corpus.

In this work, we provide the first construction of Attribute- Based Encryption (ABE) for general circuits. Our construction is based on the existence of multilinear maps. We prove selective security of our scheme in the standard model under the natural multilinear generalization of the BDDH assumption. Our scheme achieves both Key-Policy and Ciphertext-Policy variants of ABE. Our scheme and its proof of security directly translate to the recent multilinear map framework of Garg, Gentry, and Halevi.

Subfields: Artificial Intelligence, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/5ca7c75c46f27a7a363878cf5fc8c9aaacce826c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computational Theory and Mathematics

Citations in the corpus

Multi-Input Functional Encryption (2014, background): “) The past few years have seen steady progress toward constructing predicate encryption schemes [24, 19, 18, 20] and FE schemes [31, 23, 21, 20] with greater expressiveness and collusion resistance, culminating in the recent work of Garg et al.”
Reusable garbled circuits and succinct functional encryption (2013, methodology): “significantly improved with the works of Gorbunov, Vaikuntanathan and Wee [30], and Sahai and Waters [49], who construct attributebased encryption schemes for general functions, and are a building block for our results.”
GGHLite: More Efficient Multilinear Maps from Ideal Lattices (2014, methodology): “• KeyGen KeyGen(MSK = α, f): Identical to [12].”
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits (2013, methodology): “Prior solutions for (the weaker) primitives of ABE for circuits [16], [17] and single use functional encryption [33] achieved ciphertexts sizes and encryption times that were proportional to the maximum depth of the function to be evaluated.”
How to use indistinguishability obfuscation: deniable encryption, and more (2014, background): “We note that the implication that public-key encryption follows from indistinguishability obfuscation and one-way functions already follows from claims in the literature: Indistinguishability obfuscation implies Witness Encryption [12]; Witness Encryption and one-way functions imply publickey encryp”
Security and Privacy on Blockchain (2019, positive): “Since then, a number of extensions have been proposed to the baseline ABE, including ABE with multiple authorities to generate users’ private keys jointly [26, 52, 60], ABE schemes that support arbitrary predicates [40, 47].”