Welcome to the resource topic for 2012/521
Title:
Functional Encryption with Bounded Collusions via Multi-Party Computation
Authors: Sergey Gorbunov, Vinod Vaikuntanathan, 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.
ePrint: https://eprint.iacr.org/2012/521
Talk: https://www.youtube.com/watch?v=CYL2CEjnpWA
Slides: https://iacr.org/cryptodb/archive/2012/CRYPTO/presentation/3-1-Gorbunov.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .