International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: An Analysis of the Algebraic Group Model

Authors:
Cong Zhang , Zhejiang University
Hong-Sheng Zhou , Virginia Commonwealth University
Jonathan Katz , University of Maryland, College Park
Download:
Search ePrint
Search Google
Conference: ASIACRYPT 2022
Abstract: The algebraic group model (AGM), formalized by Fuchsbauer, Kiltz, and Loss, has recently received significant attention. One of the appealing properties of the AGM is that it is viewed as being (strictly) weaker than the generic group model (GGM), in the sense that hardness results for algebraic algorithms imply hardness results for generic algorithms, and generic reductions in the AGM (namely, between the algebraic formulations of two problems) imply generic reductions in the~GGM. We highlight that as the GGM and AGM are currently formalized, this is not true: hardness in the AGM may not imply hardness in the GGM, and a generic reduction in the AGM may not imply a similar reduction in the~GGM.
BibTeX
@inproceedings{asiacrypt-2022-32659,
  title={An Analysis of the Algebraic Group Model},
  publisher={Springer-Verlag},
  author={Cong Zhang and Hong-Sheng Zhou and Jonathan Katz},
  year=2022
}