Cryptology ePrint Archive: Report 2012/521

Functional Encryption with Bounded Collusions via Multi-Party Computation

Sergey Gorbunov and 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.

Category / Keywords: foundations / Functional Encryption, Multi-Party Computation, Randomized Encodings

Publication Info: A preliminary version of this work appeared in Crypto 2012

Date: received 5 Sep 2012

Contact author: vinodv at cs toronto edu

Available format(s): PDF | BibTeX Citation

Version: 20120906:175714 (All versions of this report)

Short URL: ia.cr/2012/521

Discussion forum: Show discussion | Start new discussion