International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: On Time-Lock Cryptographic Assumptions in Abelian Hidden-Order Groups

Authors:
Aron van Baarsen , CWI, Cryptology Group, Amsterdam, The Netherlands
Marc Stevens , CWI, Cryptology Group, Amsterdam, The Netherlands
Download:
DOI: 10.1007/978-3-030-92075-3_13
Search ePrint
Search Google
Presentation: Slides
Conference: ASIACRYPT 2021
Abstract: In this paper we study cryptographic finite abelian groups of unknown order and hardness assumptions in these groups. Abelian groups necessitate multiple group generators, which may be chosen at random. We formalize this setting and hardness assumptions therein. Furthermore, we generalize the algebraic group model and strong algebraic group model from cyclic groups to arbitrary finite abelian groups of unknown order. Building on these formalizations, we present techniques to deal with this new setting, and prove new reductions. These results are relevant for class groups of imaginary quadratic number fields and time-lock cryptography build upon them.
Video from ASIACRYPT 2021
BibTeX
@inproceedings{asiacrypt-2021-31382,
  title={On Time-Lock Cryptographic Assumptions in Abelian Hidden-Order Groups},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-030-92075-3_13},
  author={Aron van Baarsen and Marc Stevens},
  year=2021
}