Paper 2019/314
Optimal Bounded-Collusion Secure Functional Encryption
Prabhanjan Ananth and Vinod Vaikuntanathan
Abstract
We construct private-key and public-key functional encryption schemes secure against adversaries that corrupt an a-priori bounded number of users and obtain their functional keys, from minimal assumptions.
For a collusion bound of
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Bounded-Key Functional EncryptionCorrelated Garbling
- Contact author(s)
- prabhanjan va @ gmail com
- History
- 2019-03-21: revised
- 2019-03-21: received
- See all versions
- Short URL
- https://ia.cr/2019/314
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/314, author = {Prabhanjan Ananth and Vinod Vaikuntanathan}, title = {Optimal Bounded-Collusion Secure Functional Encryption}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/314}, year = {2019}, url = {https://eprint.iacr.org/2019/314} }