Paper 2018/010 Original: eprint.iacr.org/2018/010 ↗
Interactively Secure Groups from Obfuscation
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
- Preprint.
- History
- 2018-03-20: last updated
- 2018-01-03: published
- Short URL
- https://ia.cr/2018/010
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2018/010}
}