Paper 2024/1954
A Complete Characterization of One-More Assumptions In the Algebraic Group Model
Abstract
One-more problems like One-More Discrete Logarithm (OMDL) and One-More Diffie--Hellman (OMDH) have found wide use in cryptography, due to their ability to naturally model security definitions for interactive primitives like blind signatures and oblivious PRF. Furthermore, a generalization of OMDH called Threshold OMDH (TOMDH) has proven useful for building threshold versions of interactive protocols. However, due to their complexity it is often unclear how hard such problems actually are, leading cryptographers to analyze them in idealized models like the Generic Group Model (GGM) and Algebraic Group Model (AGM). In this work we give a complete characterization of known group-based one-more problems in the AGM, using the
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- algebraic group modelone-morediffie-hellman
- Contact author(s)
-
januzelj @ oregonstate edu
xujiay @ oregonstate edu - History
- 2024-12-06: approved
- 2024-12-02: received
- See all versions
- Short URL
- https://ia.cr/2024/1954
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1954, author = {Jake Januzelli and Jiayu Xu}, title = {A Complete Characterization of One-More Assumptions In the Algebraic Group Model}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1954}, year = {2024}, url = {https://eprint.iacr.org/2024/1954} }