Paper 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.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
A major revision of an IACR publication in PKC 2018
Keywords
indistinguishability obfuscationUber assumption
Contact author(s)
thomas agrikola @ kit edu
dennis hofheinz @ kit edu
History
2018-03-20: revised
2018-01-03: received
See all versions
Short URL
https://ia.cr/2018/010
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2018/010,
      author = {Thomas Agrikola and Dennis Hofheinz},
      title = {Interactively Secure Groups from Obfuscation},
      howpublished = {Cryptology ePrint Archive, Paper 2018/010},
      year = {2018},
      note = {\url{https://eprint.iacr.org/2018/010}},
      url = {https://eprint.iacr.org/2018/010}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.