Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
We construct the first (key-policy) attribute-based encryption (ABE) system with short secret
keys: the size of keys in our system depends only on the depth of the policy circuit, not its size…
keys: the size of keys in our system depends only on the depth of the policy circuit, not its size…
Graph-induced multilinear maps from lattices
Graded multilinear encodings have found extensive applications in cryptography ranging from
non-interactive key exchange protocols, to broadcast and attribute-based encryption, and …
non-interactive key exchange protocols, to broadcast and attribute-based encryption, and …
Can a public blockchain keep a secret?
Blockchains are gaining traction and acceptance, not just for cryptocurrencies, but increasingly
as an architecture for distributed computing. In this work we seek solutions that allow a …
as an architecture for distributed computing. In this work we seek solutions that allow a …
How to compress (reusable) garbled circuits
A fundamental question about (reusable) circuit garbling schemes is: how small can the
garbled circuit be? Our main result is a reusable garbling scheme which produces garbled …
garbled circuit be? Our main result is a reusable garbling scheme which produces garbled …
Cryptanalyses of candidate branching program obfuscators
… , Gentry, Halevi, Raykova, Sahai and Waters (GGHRSW) using the GGH13 graded encoding,
and its variant using the GGH15 graded encoding as specified by Gentry, Gorbunov and …
and its variant using the GGH15 graded encoding as specified by Gentry, Gorbunov and …
[PDF][PDF] Graded multilinear maps from lattices
Graded multilinear encodings have found extensive applications in cryptography ranging from
non-interactive key exchange protocols, to broadcast and attribute-based encryption, and …
non-interactive key exchange protocols, to broadcast and attribute-based encryption, and …
Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based
… Using similar techniques, we show how to compile a recent attribute-based encryption
scheme for circuits by Gorbunov et al. into an attribute-based FHE scheme that permits data …
scheme for circuits by Gorbunov et al. into an attribute-based FHE scheme that permits data …
Candidate multilinear maps from ideal lattices
We describe plausible lattice-based constructions with properties that approximate the
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …
sought-after multilinear maps in hard-discrete-logarithm groups, and show an example …
Attribute-based encryption for circuits from multilinear maps
… directly translate to the recent multilinear map framework of Garg, Gentry, and Halevi. …
Concurrent to and independent of our work Gorbunov, Vaikuntanathan, and Wee [GVW13] achieve …
Concurrent to and independent of our work Gorbunov, Vaikuntanathan, and Wee [GVW13] achieve …
Functional encryption without obfuscation
Previously known functional encryption (FE) schemes for general circuits relied on
indistinguishability obfuscation, which in turn either relies on an exponential number of assumptions (…
indistinguishability obfuscation, which in turn either relies on an exponential number of assumptions (…