Paper 2026/644
Ordered Multi-Signatures from the DL Assumption
Abstract
Ordered multi-signatures allow multiple signers to sign a common message sequentially, and anyone to verify the signing order of signers with a public-key list. Recently, Baum et al. (PKC 2025) proposed an ordered multi-signature scheme over a pairing-free group by modifying the multi-signature scheme MuSig2 by Nick et al. (CRYPTO 2021). The security of their ordered multi-signature scheme was proven under the algebraic one-more discrete logarithm (AOMDL) assumption in the random oracle model (ROM). The AOMDL assumption is stronger than the discrete logarithm (DL) assumption. To strengthen the assurance of security, it is desirable either to prove their scheme under the DL assumption or give a construction whose security is proven under the DL assumption. In this paper, we give an ordered multi-signature scheme from linear hash function families. Our scheme is obtained by generalizing Baum et al.’s scheme via linear hash function families. The security of our scheme is proven under the algebraic one-more preimage resistance (AOMPR) property of a linear hash function in the ROM. There is a linear hash function whose AOMPR property can be proven under the DL assumption. Thus, by using this linear hash function, we obtain the first DL- based ordered multi-signature scheme.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Ordered multi-signaturesDL assumption
- Contact author(s)
-
hara-keisuke @ ist osaka-u ac jp
keisuke @ comp isct ac jp
m tezuka @ nsc nagoya-cu ac jp - History
- 2026-04-04: approved
- 2026-04-02: received
- See all versions
- Short URL
- https://ia.cr/2026/644
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/644,
author = {Keisuke Hara and Keisuke Tanaka and Masayuki Tezuka},
title = {Ordered Multi-Signatures from the {DL} Assumption},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/644},
year = {2026},
url = {https://eprint.iacr.org/2026/644}
}
