International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Interactively Secure Groups from Obfuscation

Authors:
Thomas Agrikola
Dennis Hofheinz
Download:
DOI: 10.1007/978-3-319-76581-5_12
Search ePrint
Search Google
Conference: PKC 2018
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.
BibTeX
@inproceedings{pkc-2018-28894,
  title={Interactively Secure Groups from Obfuscation},
  booktitle={Public-Key Cryptography – PKC 2018},
  series={Public-Key Cryptography – PKC 2018},
  publisher={Springer},
  volume={10770},
  pages={341-370},
  doi={10.1007/978-3-319-76581-5_12},
  author={Thomas Agrikola and Dennis Hofheinz},
  year=2018
}