Towards a Classification of Non-Interactive Computational Assumptions in Cyclic Groups

Explore a comprehensive analysis of non-interactive computational assumptions in cyclic groups through this 27-minute conference talk presented at Asiacrypt 2017. Delve into the paper by Essam Ghadafi and Jens Groth, which introduces two families of assumptions and examines non-interactive computation assumptions in cyclic groups. Investigate variant polynomials, simplifying techniques, and hierarchies, including the Generalized Target Hierarchy. Gain insights into the relationship between different assumptions and their classification. Conclude with a discussion on target assumptions and valuable advice for researchers in the field of cryptography.

Introduction
Assumptions
Two families of assumptions
Non interactive computation assumptions
Cyclic groups
Variant polynomials
Examples
Simplifying
Hierarchy
Generalized
Target Hierarchy
Relationship
Classification
Advice
Target assumptions