From Selective to Adaptive Security in Functional Encryption
© International Association for Cryptologic Research 2015. In a functional encryption (FE) scheme, the owner of the secret key can generate restricted decryption keys that allow users to learn specific functions of the encrypted messages and nothing else. In many known constructions of FE schemes, s...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Nature
2021
|
| Online Access: | https://hdl.handle.net/1721.1/137827 |
| _version_ | 1826200186179813376 |
|---|---|
| author | Ananth, Prabhanjan Brakerski, Zvika Segev, Gil Vaikuntanathan, Vinod |
| 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 Ananth, Prabhanjan Brakerski, Zvika Segev, Gil Vaikuntanathan, Vinod |
| author_sort | Ananth, Prabhanjan |
| collection | MIT |
| description | © International Association for Cryptologic Research 2015. In a functional encryption (FE) scheme, the owner of the secret key can generate restricted decryption keys that allow users to learn specific functions of the encrypted messages and nothing else. In many known constructions of FE schemes, security is guaranteed only for messages that are fixed ahead of time (i.e., before the adversary even interacts with the system). This so-called selective security is too restrictive for many realistic applications. Achieving adaptive security (also called full security), where security is guaranteed even for messages that are adaptively chosen at any point in time, seems significantly more challenging. The handful of known adaptively-secure schemes are based on specifically tailored techniques that rely on strong assumptions (such as obfuscation or multilinear maps assumptions) can be transformed into an adaptively-secure one without introducing any additional assumptions. We present a black-box transformation, for both public-key and private-key schemes, making novel use of hybrid encryption, a classical technique that was originally introduced for improving the efficiency of encryption schemes. We adapt the hybrid encryption approach to the setting of functional encryption via a technique for embedding a “hidden execution thread” in the decryption keys of the underlying scheme, which will only be activated within the proof of security of the resulting scheme. As an additional application of this technique, we show how to construct functional encryption schemes for arbitrary circuits starting from ones for shallow circuits (NC1 or even TC0). |
| first_indexed | 2024-09-23T11:32:29Z |
| format | Article |
| id | mit-1721.1/137827 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T11:32:29Z |
| publishDate | 2021 |
| publisher | Springer Nature |
| record_format | dspace |
| spelling | mit-1721.1/1378272023-04-20T19:17:01Z From Selective to Adaptive Security in Functional Encryption Ananth, Prabhanjan Brakerski, Zvika Segev, Gil Vaikuntanathan, Vinod Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory © International Association for Cryptologic Research 2015. In a functional encryption (FE) scheme, the owner of the secret key can generate restricted decryption keys that allow users to learn specific functions of the encrypted messages and nothing else. In many known constructions of FE schemes, security is guaranteed only for messages that are fixed ahead of time (i.e., before the adversary even interacts with the system). This so-called selective security is too restrictive for many realistic applications. Achieving adaptive security (also called full security), where security is guaranteed even for messages that are adaptively chosen at any point in time, seems significantly more challenging. The handful of known adaptively-secure schemes are based on specifically tailored techniques that rely on strong assumptions (such as obfuscation or multilinear maps assumptions) can be transformed into an adaptively-secure one without introducing any additional assumptions. We present a black-box transformation, for both public-key and private-key schemes, making novel use of hybrid encryption, a classical technique that was originally introduced for improving the efficiency of encryption schemes. We adapt the hybrid encryption approach to the setting of functional encryption via a technique for embedding a “hidden execution thread” in the decryption keys of the underlying scheme, which will only be activated within the proof of security of the resulting scheme. As an additional application of this technique, we show how to construct functional encryption schemes for arbitrary circuits starting from ones for shallow circuits (NC1 or even TC0). 2021-11-08T20:55:17Z 2021-11-08T20:55:17Z 2015 2019-07-09T16:21:55Z Article http://purl.org/eprint/type/ConferencePaper 0302-9743 1611-3349 https://hdl.handle.net/1721.1/137827 Ananth, Prabhanjan, Brakerski, Zvika, Segev, Gil and Vaikuntanathan, Vinod. 2015. "From Selective to Adaptive Security in Functional Encryption." en 10.1007/978-3-662-48000-7_32 Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Springer Nature Other repository |
| spellingShingle | Ananth, Prabhanjan Brakerski, Zvika Segev, Gil Vaikuntanathan, Vinod From Selective to Adaptive Security in Functional Encryption |
| title | From Selective to Adaptive Security in Functional Encryption |
| title_full | From Selective to Adaptive Security in Functional Encryption |
| title_fullStr | From Selective to Adaptive Security in Functional Encryption |
| title_full_unstemmed | From Selective to Adaptive Security in Functional Encryption |
| title_short | From Selective to Adaptive Security in Functional Encryption |
| title_sort | from selective to adaptive security in functional encryption |
| url | https://hdl.handle.net/1721.1/137827 |
| work_keys_str_mv | AT ananthprabhanjan fromselectivetoadaptivesecurityinfunctionalencryption AT brakerskizvika fromselectivetoadaptivesecurityinfunctionalencryption AT segevgil fromselectivetoadaptivesecurityinfunctionalencryption AT vaikuntanathanvinod fromselectivetoadaptivesecurityinfunctionalencryption |