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, Gentry, Craig, Gorbunov, Sergey, Halevi, Shai, Nikolaenko, Valeria, Segev, Gil, Vaikuntanathan, Vinod, Vinayagamurthy, Dhinakaran |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Springer-Verlag
2014
|
Online Access: | http://hdl.handle.net/1721.1/90992 https://orcid.org/0000-0002-2666-0045 |
Similar Items
-
Reusable garbled circuits and succinct functional encryption
by: Goldwasser, Shafi, et al.
Published: (2014) -
Multikey Fully Homomorphic Encryption and Applications
by: López-Alt, Adriana, et al.
Published: (2021) -
Multikey Fully Homomorphic Encryption and Applications
by: López-Alt, Adriana, et al.
Published: (2021) -
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)