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. Our constructions extend naturally to arithmetic circuits with arbitrary fan-in gates thereby further redu...
Main Authors: | Boneh, Dan (Author), Gentry, Craig (Author), Gorbunov, Sergey (Contributor), Halevi, Shai (Author), Nikolaenko, Valeria (Author), Segev, Gil (Author), Vaikuntanathan, Vinod (Contributor), Vinayagamurthy, Dhinakaran (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2014-10-20T17:06:56Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Reusable garbled circuits and succinct functional encryption
by: Goldwasser, Shafi, et al.
Published: (2014) -
Minutiae Matching with Privacy Protection Based on the Combination of Garbled Circuit and Homomorphic Encryption
by: Mengxing Li, et al.
Published: (2014-01-01) -
Efficient Fully Homomorphic Encryption from (Standard) LWE
by: Brakerski, Zvika, et al.
Published: (2018) -
Logsum using Garbled Circuits.
by: José Portêlo, et al.
Published: (2015-01-01) -
Attribute-Based Encryption for Circuits
by: Gorbunov, Sergey, et al.
Published: (2017)