[Resource Topic] 2020/154: Combiners for Functional Encryption, Unconditionally

Welcome to the resource topic for 2020/154

Combiners for Functional Encryption, Unconditionally

Authors: Aayush Jain, Nathan Manohar, Amit Sahai


Functional encryption (FE) combiners allow one to combine many candidates for a functional encryption scheme, possibly based on different computational assumptions, into another functional encryption candidate with the guarantee that the resulting candidate is secure as long as at least one of the original candidates is secure. The fundamental question in this area is whether FE combiners exist. There have been a series of works (Ananth et. al. (CRYPTO '16), Ananth-Jain-Sahai (EUROCRYPT '17), Ananth et. al (TCC '19)) on constructing FE combiners from various assumptions. We give the first unconditional construction of combiners for functional encryption, resolving this question completely. Our construction immediately implies an unconditional universal functional encryption scheme, an FE scheme that is secure if such an FE scheme exists. Previously such results either relied on algebraic assumptions or required subexponential security assumptions.

ePrint: https://eprint.iacr.org/2020/154

Talk: https://www.youtube.com/watch?v=pa76GsIAdDM

Slides: https://iacr.org/submit/files/slides/2020/eurocrypt/ec2020/197/slides.pptx

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 .