Generic-Group Delay Functions Require Hidden-Order Groups

Explore a presentation from Eurocrypt 2020 on the impossibility of generic-group delay functions without hidden-order groups. Delve into fundamental building blocks like iterated hashing and repeated squaring, and examine known-order cyclic groups. Discover the main contributions and follow the talk's outline, which covers generic groups, generic-group delay functions, and the impossibility result. Understand the simplified warmup, first step, and main challenge of handling equality queries in polynomial-based emulation. Analyze the attacker A's approach, correctness, and gain a broader perspective on the topic. Conclude with a summary of the key findings and implications for cryptographic research.