[Resource Topic] 2018/010: Interactively Secure Groups from Obfuscation

Welcome to the resource topic for 2018/010

Interactively Secure Groups from Obfuscation

Authors: Thomas Agrikola, Dennis Hofheinz


We construct a mathematical group in which an interactive variant of the very general Uber assumption holds. Our construction uses probabilistic indistinguishability obfuscation, fully homomorphic encryption, and a pairing-friendly group in which a mild and standard computational assumption holds. While our construction is not practical, it constitutes a feasibility result that shows that under a strong but generic, and a mild assumption, groups exist in which very general computational assumptions hold. We believe that this grants additional credibility to the Uber assumption.

ePrint: https://eprint.iacr.org/2018/010

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 .