Paper 2017/343
Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups
Essam Ghadafi and Jens Groth
Abstract
We study non-interactive computational intractability assumptions in prime-order cyclic groups. We focus on the broad class of computational assumptions, which we call target assumptions, where the adversary's goal is to compute a concrete group element and investigate the structure of this class.
Our analysis identifies two families of intractability assumptions, the
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Non-Interactive AssumptionsComputational AssumptionsTarget AssumptionsPrime-Order GroupsBilinear Groups.
- Contact author(s)
-
Essam Ghadafi @ gmail com
j groth @ ucl ac uk - History
- 2017-04-21: received
- Short URL
- https://ia.cr/2017/343
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/343, author = {Essam Ghadafi and Jens Groth}, title = {Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/343}, year = {2017}, url = {https://eprint.iacr.org/2017/343} }