Cryptology ePrint Archive: Report 2018/010

Interactively Secure Groups from Obfuscation

Thomas Agrikola and Dennis Hofheinz

Abstract: 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.

Category / Keywords: foundations / indistinguishability obfuscation, Uber assumption

Original Publication (with major differences): IACR-PKC-2018

Date: received 2 Jan 2018, last revised 20 Mar 2018

Contact author: thomas agrikola at kit edu, dennis hofheinz@kit edu

Available format(s): PDF | BibTeX Citation

Version: 20180320:121037 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]