Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices

被引:19
|
作者
Damgard, Ivan [1 ,2 ]
Orlandi, Claudio [1 ,2 ]
Takahashi, Akira [1 ,2 ]
Tibouchi, Mehdi [3 ]
机构
[1] Aarhus Univ, Dept Comp Sci, Aarhus, Denmark
[2] Aarhus Univ, DIGIT, Aarhus, Denmark
[3] NTT Corp, Tokyo, Japan
基金
欧洲研究理事会;
关键词
Threshold signatures; n-out-of-n distributed signatures; Multi-signatures; Lattice-based cryptography; Fiat-Shamir with aborts; Trapdoor commitments; SECURE; IDENTIFICATION;
D O I
10.1007/s00145-022-09425-3
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Although they have been studied for a long time, distributed signature protocols have garnered renewed interest in recent years in view of novel applications to topics like blockchains. Most recent works have focused on distributed versions of ECDSA or variants of Schnorr signatures; however, and in particular, little attention has been given to constructions based on post-quantum secure assumptions like the hardness of lattice problems. A few lattice-based threshold signature and multi-signature schemes have been proposed in the literature, but they either rely on hash-and-sign lattice signatures (which tend to be comparatively inefficient), use expensive generic transformations, or only come with incomplete security proofs. In this paper, we construct several lattice-based distributed signing protocols with low round complexity following the Fiat-Shamir with Aborts (FSwA) paradigm of Lyubashevsky (Asiacrypt 2009). Our protocols can be seen as distributed variants of the fast Dilithium-G signature scheme and the full security proof can be made assuming the hardness of module SIS and LWE problems. A key step to achieving security (unexplained in some earlier papers) is to prevent the leakage that can occur when parties abort after their first message-which can inevitably happen in the Fiat-Shamir with Aborts setting. We manage to do so using homomorphic commitments. Exploiting the similarities between FSwA and Schnorr-style signatures, our approach makes the most of observations from recent advancements in the discrete log setting, such as Drijvers et al.'s seminal work on two-round multi-signatures (S&P 2019). In particular, we observe that the use of commitment not only resolves the subtle issue with aborts, but also makes it possible to realize secure two-roundn-out-of-ndistributed signing and multi-signature in the plain public key model, by equipping the commitment with a trapdoor feature. The construction of suitable trapdoor commitment from lattices is a side contribution of this paper.
引用
收藏
页数:56
相关论文
共 27 条
  • [1] Two-Round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattices
    Ivan Damgård
    Claudio Orlandi
    Akira Takahashi
    Mehdi Tibouchi
    Journal of Cryptology, 2022, 35
  • [2] Two-Round Multi-Signatures from Okamoto Signatures
    Lee, Kwangsu
    Kim, Hyoseung
    MATHEMATICS, 2023, 11 (14)
  • [3] On the Security of Two-Round Multi-Signatures
    Drijvers, Manu
    Edalatnejad, Kasra
    Ford, Bryan
    Kiltz, Eike
    Loss, Julian
    Neven, Gregory
    Stepanovs, Igors
    2019 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2019), 2019, : 1084 - 1101
  • [4] Two-Round Trip Schnorr Multi-signatures via Delinearized Witnesses
    Alper, Handan Kilinc
    Burdges, Jeffrey
    ADVANCES IN CRYPTOLOGY (CRYPTO 2021), PT I, 2021, 12825 : 157 - 188
  • [5] MuSig2: Simple Two-Round Schnorr Multi-signatures
    Nick, Jonas
    Ruffing, Tim
    Seurin, Yannick
    ADVANCES IN CRYPTOLOGY (CRYPTO 2021), PT I, 2021, 12825 : 189 - 221
  • [6] Toothpicks: More Efficient Fork-Free Two-Round Multi-signatures
    Pan, Jiaxin
    Wagner, Benedikt
    ADVANCES IN CRYPTOLOGY, PT I, EUROCRYPT 2024, 2024, 14651 : 460 - 489
  • [7] Chopsticks: Fork-Free Two-Round Multi-signatures from Non-interactive Assumptions
    Pan, Jiaxin
    Wagner, Benedikt
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT V, 2023, 14008 : 597 - 627
  • [8] Chipmunk: Better Synchronized Multi-Signatures from Lattices
    Fleischhacker, Nils
    Herold, Gottfried
    Simkin, Mark
    Zhang, Zhenfei
    PROCEEDINGS OF THE 2023 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2023, 2023, : 386 - 400
  • [9] Two-Round PAKE from Approximate SPH and Instantiations from Lattices
    Zhang, Jiang
    Yu, Yu
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2017, PT III, 2017, 10626 : 37 - 67
  • [10] Two-Round Password-Based Authenticated Key Exchange from Lattices
    Yin, Anqi
    Guo, Yuanbo
    Song, Yuanming
    Qu, Tongzhou
    Fang, Chen
    WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2020, 2020