TY - GEN
T1 - Practical distributed signatures in the standard model
AU - Wang, Yujue
AU - Wong, Duncan S.
AU - Wu, Qianhong
AU - Chow, Sherman S. M.
AU - Qin, Bo
AU - Liu, Jianwei
PY - 2014
Y1 - 2014
N2 - A distributed signature scheme allows participants in a qualified set to jointly generate a signature which cannot be forged even when all the unqualified participants collude together. In this paper, we propose an efficient scheme for any monotone access structure and show its unforgeability and robustness under the computational Diffie-Hellman (CDH) assumption in the standard model. For 112-bit security, its secret key shares and signature fragments are as short as 255 bits and 510 bits, which are shorter than existing schemes assuming random oracle. We then propose two extensions. The first one allows new participants to dynamically join the system without any help from the dealer. The second one supports a type of multipartite access structures, where the participant set is divided into multiple disjoint groups, and each group is bounded so that a distributed signature cannot be generated unless a pre-defined number of participants from multiple groups work together. © 2014 Springer International Publishing.
AB - A distributed signature scheme allows participants in a qualified set to jointly generate a signature which cannot be forged even when all the unqualified participants collude together. In this paper, we propose an efficient scheme for any monotone access structure and show its unforgeability and robustness under the computational Diffie-Hellman (CDH) assumption in the standard model. For 112-bit security, its secret key shares and signature fragments are as short as 255 bits and 510 bits, which are shorter than existing schemes assuming random oracle. We then propose two extensions. The first one allows new participants to dynamically join the system without any help from the dealer. The second one supports a type of multipartite access structures, where the participant set is divided into multiple disjoint groups, and each group is bounded so that a distributed signature cannot be generated unless a pre-defined number of participants from multiple groups work together. © 2014 Springer International Publishing.
KW - Distributed signature
KW - monotone span program
KW - multipartite access structure
KW - secret sharing
KW - standard model
KW - threshold signature
UR - https://www.scopus.com/pages/publications/84901283018
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84901283018&origin=recordpage
U2 - 10.1007/978-3-319-04852-9_16
DO - 10.1007/978-3-319-04852-9_16
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783319048512
VL - 8366 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 307
EP - 326
BT - Topics in Cryptology, CT-RSA 2014
PB - Springer Verlag
T2 - 2014 Conference on Cryptographer's Track at the RSA, CT-RSA 2014
Y2 - 25 February 2014 through 28 February 2014
ER -