### Functional Encryption: New Perspectives and Lower Bounds

Shweta Agrawal, Sergey Gorbunov, Vinod Vaikuntanathan, and Hoeteck Wee

##### Abstract

Functional encryption is an emerging paradigm for public-key encryption that enables fine-grained control of access to encrypted data. In this work, we present new perspectives on security definitions for functional encryption, as well as new lower bounds on what can be achieved. Our main contributions are as follows: * We show a lower bound for functional encryption that satisfies a weak (non-adaptive) simulation-based security notion, via pseudo-random functions. This is the first lower bound that exploits unbounded collusions in an essential way. * We put forth and discuss a simulation-based notion of security for functional encryption, with an unbounded simulator (called USIM). We show that this notion interpolates indistinguishability and simulation-based security notions, and has strong correlations to results and barriers in the zero-knowledge and multi-party computation literature.

Available format(s)
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Functional EncryptionSimulation-based DefinitionsPseudorandom Functions
Contact author(s)
vinodv @ cs toronto edu
History
2012-10-01: last of 3 revisions
See all versions
Short URL
https://ia.cr/2012/468

CC BY

BibTeX

@misc{cryptoeprint:2012/468,
author = {Shweta Agrawal and Sergey Gorbunov and Vinod Vaikuntanathan and Hoeteck Wee},
title = {Functional Encryption: New Perspectives and Lower Bounds},
howpublished = {Cryptology ePrint Archive, Paper 2012/468},
year = {2012},
note = {\url{https://eprint.iacr.org/2012/468}},
url = {https://eprint.iacr.org/2012/468}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.