To Label, or Not To Label (in Generic Groups)
Mark Zhandry
Abstract
Generic groups are an important tool for analyzing the feasibility and in-feasibility of group-based cryptosystems. There are two distinct wide-spread versions of generic groups, Shoup's and Maurer's, the main difference being whether or not group elements are given explicit labels. The two models are often treated as equivalent. In this work, however, we demonstrate that the models are in fact quite different, and care is needed when stating generic group results:
-We show that numerous textbook constructions are not captured by Maurer, but are captured by Shoup. In the other direction, any construction captured by Maurer is captured by Shoup. -For constructions that exist in both models, we show that security is equivalent for "single stage" games, but Shoup security is strictly stronger than Maurer security for some "multi-stage" games. -The existing generic group un-instantiability results do not apply to Maurer. We fill this gap with a new un-instantiability result. -We explain how the known black box separations between generic groups and identity-based encryption do not fully apply to Shoup, and resolve this by providing such a separation. -We give a new un-instantiability result for the algebraic group model.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers7
- A Lower Bound on the Length of Signatures Based on Group Actions and Generic IsogeniesDan Boneh, Jiaxin Guan, Mark ZhandryEUROCRYPT 2023 · 14 citations
- Quantum Complexity for Discrete Logarithms and Related ProblemsMinki Hhan, Takashi Yamakawa, Aaram YunCRYPTO 2024 · 8 citations
- Fine-Grained Non-interactive Key-Exchange: Constructions and Lower BoundsAbtin Afshar, Geoffroy Couteau, Mohammad Mahmoody, Elahe SadeghiEUROCRYPT 2023 · 6 citations
- A New Approach to Generic Lower Bounds - Classical/Quantum MDL, Quantum Factoring, and MoreMinki HhanEUROCRYPT 2025 · 3 citations
- On the Impossibility of Round-Optimal Pairing-Free Blind Signatures in the ROMMarian Dietz, Julia Kastner, Stefano TessaroCRYPTO 2026 · 1 citation
Builds on7
- Optimal Broadcast Encryption from Pairings and LWEShweta Agrawal, Shota YamadaEUROCRYPT 2020 · 74 citations
- A Classification of Computational Assumptions in the Algebraic Group ModelBalthazar Bauer, Georg Fuchsbauer, Julian LossCRYPTO 2020 · 45 citations
- Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic LanguagesGeoffroy Couteau, Dominik HartmannCRYPTO 2020 · 34 citations
- Generic-Group Delay Functions Require Hidden-Order GroupsLior Rotem, Gil Segev, Ido ShahafEUROCRYPT 2020 · 28 citations
- Tight State-Restoration Soundness in the Algebraic Group ModelAshrujit Ghoshal, Stefano TessaroCRYPTO 2021 · 27 citations
Related papers
- Generic and Algebraic Computation Models: When AGM Proofs Transfer to the GGMJoseph Jaeger, Deep Inder MohanCRYPTO 2024 · 9 citations
- Fine-Grained Non-interactive Key Exchange, RevisitedBalthazar Bauer, Geoffroy Couteau, Elahe SadeghiCRYPTO 2024 · 1 citation
- Generic-Group Barriers for Function-Hiding and Multi-input Functional EncryptionMohammad Hajiabadi, Roman Langrehr, Mingyuan WangCRYPTO 2026
- On Instantiating the Algebraic Group Model from Falsifiable AssumptionsThomas Agrikola, Dennis Hofheinz, Julia KastnerEUROCRYPT 2020 · 16 citations
- The Structured Generic-Group ModelHenry Corrigan-Gibbs, Alexandra Henzinger, David J. WuEUROCRYPT 2026
