Generic and Algebraic Computation Models: When AGM Proofs Transfer to the GGM
Joseph Jaeger, Deep Inder Mohan
Abstract
The Fuchsbauer, Kiltz, and Loss (CRYPTO 2018) claim that (some) hardness results in the algebraic group model imply the same hardness results in the generic group model was recently called into question by Katz, Zhang, and Zhou (ASIACRYPT 2022). The latter gave an interpretation of the claim under which it is incorrect. We give an alternate interpretation under which it is correct, using natural frameworks for capturing generic and algebraic models for arbitrary algebraic structures. Most algebraic analyses in the literature can be captured by our frameworks, making the claim correct for them.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 188f26f9-885a-4d3a-a5fa-1fcea2a267aeCited by top-tier papers1
Ask how each one uses itRelated papers
- To Label, or Not To Label (in Generic Groups)Mark ZhandryCRYPTO 2022 · 50 citations
- On Instantiating the Algebraic Group Model from Falsifiable AssumptionsThomas Agrikola, Dennis Hofheinz, Julia KastnerEUROCRYPT 2020 · 16 citations
- A New Approach to Generic Lower Bounds - Classical/Quantum MDL, Quantum Factoring, and MoreMinki HhanEUROCRYPT 2025 · 3 citations
- A Classification of Computational Assumptions in the Algebraic Group ModelBalthazar Bauer, Georg Fuchsbauer, Julian LossCRYPTO 2020 · 45 citations
- On the Existence of Algebraically Natural ProofsPrerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi et al.FOCS 2020 · 5 citations
