.png){kind=icon}
.png){kind=icon}
Return
Efficient Lattice-Based Threshold Signatures With Functional Interchangeability
.png){kind=icon}
PRE
AI
DOI：10.1109/TIFS.2023.3293408.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A threshold signature scheme distributes the ability to generate signatures through distributed key generation and signing protocols. A threshold signature scheme should be functionally interchangeable, meaning that a signature produced by a threshold scheme should be verifiable by the same algorithm used for non-threshold signatures. To resist future attacks from quantum adversaries, lattice-based threshold signatures are desirable. However, the performance of existing lattice-based threshold signing protocols is still far from practical. This paper presents the first lattice-based t-out-of-n threshold signature scheme with functional interchangeability that has been implemented. To build an t-out-of-n access structure for arbitrary t <= n, we first present a novel t-out-of-n version of the SPDZ MPC protocol. We avoid using the MPC protocol to evaluate hash operations for high concrete efficiency. Moreover, we design an efficient distributed rejection sampling protocol. Consequently, the online phase of our distributed signing protocol takes only 0.5 seconds in the two-party setting and 7.3 seconds in the 12-party setting according to our implementation. As a byproduct, our scheme also presents a periodic key refreshment mechanism and offers proactive security.
Keywords:
Threshold signatures
lattice-based signatures
rejection sampling
Journal
IF:
8
Papers:
5.2K
Citations:
2.3W