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: | , , , , , , , |
|---|---|
| Other Authors: | |
| 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 |
| _version_ | 1826214760417329152 |
|---|---|
| author | Boneh, Dan Gentry, Craig Gorbunov, Sergey Halevi, Shai Nikolaenko, Valeria Segev, Gil Vaikuntanathan, Vinod Vinayagamurthy, Dhinakaran |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Boneh, Dan Gentry, Craig Gorbunov, Sergey Halevi, Shai Nikolaenko, Valeria Segev, Gil Vaikuntanathan, Vinod Vinayagamurthy, Dhinakaran |
| author_sort | Boneh, Dan |
| collection | MIT |
| description | 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 reducing the circuit depth. Building on this ABE system we obtain the first reusable circuit garbling scheme that produces garbled circuits whose size is the same as the original circuit plus an additive poly(λ,d) bits, where λ is the security parameter and d is the circuit depth. All previous constructions incurred a multiplicative poly(λ) blowup.
We construct our ABE using a new mechanism we call fully key-homomorphic encryption, a public-key system that lets anyone translate a ciphertext encrypted under a public-key x into a ciphertext encrypted under the public-key (f(x),f) of the same plaintext, for any efficiently computable f. We show that this mechanism gives an ABE with short keys. Security of our construction relies on the subexponential hardness of the learning with errors problem.
We also present a second (key-policy) ABE, using multilinear maps, with short ciphertexts: an encryption to an attribute vector x is the size of x plus poly(λ,d) additional bits. This gives a reusable circuit garbling scheme where the garbled input is short. |
| first_indexed | 2024-09-23T16:10:43Z |
| format | Article |
| id | mit-1721.1/90992 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T16:10:43Z |
| publishDate | 2014 |
| publisher | Springer-Verlag |
| record_format | dspace |
| spelling | mit-1721.1/909922022-09-29T18:45:17Z Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits Boneh, Dan Gentry, Craig Gorbunov, Sergey Halevi, Shai Nikolaenko, Valeria Segev, Gil Vaikuntanathan, Vinod Vinayagamurthy, Dhinakaran Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Gorbunov, Sergey Vaikuntanathan, Vinod 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 reducing the circuit depth. Building on this ABE system we obtain the first reusable circuit garbling scheme that produces garbled circuits whose size is the same as the original circuit plus an additive poly(λ,d) bits, where λ is the security parameter and d is the circuit depth. All previous constructions incurred a multiplicative poly(λ) blowup. We construct our ABE using a new mechanism we call fully key-homomorphic encryption, a public-key system that lets anyone translate a ciphertext encrypted under a public-key x into a ciphertext encrypted under the public-key (f(x),f) of the same plaintext, for any efficiently computable f. We show that this mechanism gives an ABE with short keys. Security of our construction relies on the subexponential hardness of the learning with errors problem. We also present a second (key-policy) ABE, using multilinear maps, with short ciphertexts: an encryption to an attribute vector x is the size of x plus poly(λ,d) additional bits. This gives a reusable circuit garbling scheme where the garbled input is short. United States. Defense Advanced Research Projects Agency (Grant FA8750-11-2-0225) Alfred P. Sloan Foundation (Sloan Research Fellowship) 2014-10-20T17:06:56Z 2014-10-20T17:06:56Z 2014 Article http://purl.org/eprint/type/ConferencePaper 978-3-642-55219-9 978-3-642-55220-5 0302-9743 1611-3349 http://hdl.handle.net/1721.1/90992 Boneh, Dan, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, and Dhinakaran Vinayagamurthy. “Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits.” Lecture Notes in Computer Science (2014): 533–556. https://orcid.org/0000-0002-2666-0045 en_US http://dx.doi.org/10.1007/978-3-642-55220-5_30 Advances in Cryptology – EUROCRYPT 2014 Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Springer-Verlag Other repository |
| spellingShingle | Boneh, Dan Gentry, Craig Gorbunov, Sergey Halevi, Shai Nikolaenko, Valeria Segev, Gil Vaikuntanathan, Vinod Vinayagamurthy, Dhinakaran Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits |
| title | Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits |
| title_full | Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits |
| title_fullStr | Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits |
| title_full_unstemmed | Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits |
| title_short | Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits |
| title_sort | fully key homomorphic encryption arithmetic circuit abe and compact garbled circuits |
| url | http://hdl.handle.net/1721.1/90992 https://orcid.org/0000-0002-2666-0045 |
| work_keys_str_mv | AT bonehdan fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits AT gentrycraig fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits AT gorbunovsergey fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits AT halevishai fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits AT nikolaenkovaleria fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits AT segevgil fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits AT vaikuntanathanvinod fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits AT vinayagamurthydhinakaran fullykeyhomomorphicencryptionarithmeticcircuitabeandcompactgarbledcircuits |