Welcome to the resource topic for 2021/1184
Title:
On Time-Lock Cryptographic Assumptions in Abelian Hidden-Order Groups
Authors: Aron van Baarsen, Marc Stevens
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.
ePrint: https://eprint.iacr.org/2021/1184
Talk: https://www.youtube.com/watch?v=Gn227in6Gac
Slides: https://iacr.org/submit/files/slides/2021/asiacrypt/asiacrypt2021/149/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .