### Functional Encryption with Bounded Collusions via Multi-Party Computation

Sergey Gorbunov, Vinod Vaikuntanathan, and Hoeteck Wee

##### Abstract

We construct a functional encryption scheme secure against an a priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions require only semantically secure public-key encryption schemes and pseudo-random generators computable by small-depth circuits (known to be implied by most concrete intractability assumptions). For certain special cases such as predicate encryption schemes with public index, the construction requires only semantically secure encryption schemes, which is clearly the minimal necessary assumption. Our constructions rely heavily on techniques from secure multiparty computation and randomized encodings. All our constructions are secure under a strong, adaptive simulation-based definition of functional encryption.

Available format(s)
Category
Foundations
Publication info
Published elsewhere. A preliminary version of this work appeared in Crypto 2012
Keywords
Functional EncryptionMulti-Party ComputationRandomized Encodings
Contact author(s)
vinodv @ cs toronto edu
History
Short URL
https://ia.cr/2012/521

CC BY

BibTeX

@misc{cryptoeprint:2012/521,
author = {Sergey Gorbunov and Vinod Vaikuntanathan and Hoeteck Wee},
title = {Functional Encryption with Bounded Collusions via Multi-Party Computation},
howpublished = {Cryptology ePrint Archive, Paper 2012/521},
year = {2012},
note = {\url{https://eprint.iacr.org/2012/521}},
url = {https://eprint.iacr.org/2012/521}
}

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