Optimal Bounded-Collusion Secure Functional Encryption
We construct private-key and public-key functional encryption schemes in the bounded-key setting; that is, secure against adversaries that obtain an a-priori bounded number of functional keys (also known as the collusion bound). An important metric considered in the literature on bounded-key functio...
Main Authors: | Ananth, Prabhanjan, Vaikuntanathan, Vinod |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Book |
Language: | English |
Published: |
Springer International Publishing
2021
|
Online Access: | https://hdl.handle.net/1721.1/130062 |
Similar Items
-
From Selective to Adaptive Security in Functional Encryption
by: Ananth, Prabhanjan, et al.
Published: (2021) -
Bounded CCA2-Secure Non-Malleable Encryption
by: Pass, Rafael, et al.
Published: (2006) -
Indistinguishability Obfuscation from Functional Encryption
by: Bitansky, Nir, et al.
Published: (2021) -
Indistinguishability Obfuscation from Functional Encryption
by: Bitansky, Nir, et al.
Published: (2018) -
Optimized homomorphic encryption solution for secure genome-wide association studies
by: Blatt, Marcelo, et al.
Published: (2021)