Functional Encryption with Bounded Collusions via Multi-party Computation
- Sergey GorbunovAffiliated withUniversity of Toronto
- , Vinod VaikuntanathanAffiliated withUniversity of Toronto
- , Hoeteck WeeAffiliated withGeorge Washington University
We construct functional encryption schemes for polynomial-time computable functions secure against an a-priori bounded polynomial number of collusions. Our constructions require only semantically secure public-key encryption schemes and pseudorandom 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.
Along the way, we show a “bootstrapping theorem” that builds a q-query functional encryption scheme for arbitrary functions starting from a q-query functional encryption scheme for bounded-degree functions. All our constructions rely heavily on techniques from secure multi-party computation and randomized encodings.
Our constructions are secure under a strong simulation-based definition of functional encryption.
- Functional Encryption with Bounded Collusions via Multi-party Computation
- Book Title
- Advances in Cryptology – CRYPTO 2012
- Book Subtitle
- 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings
- pp 162-179
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- International Association for Cryptologic Research 2012
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 16. Department of Computer Science, University of Calgary
- 17. Department of Computer Science, University of Boston
- Author Affiliations
- 18. University of Toronto, Toronto, Canada
- 19. George Washington University, Washington, DC, USA
To view the rest of this content please follow the download PDF link above.