Fully distributed identity-based threshold signatures with identifiable aborts

Fully distributed identity-based threshold signatures with identifiable aborts
复制标题

DOI:
10.1007/s11704-022-2370-4
复制
发表时间:
2023-02
影响因子:
4.2
通讯作者:
Yan Jiang;Youwen Zhu;Jian Wang;Xingxin Li
Yan Jiang;Youwen Zhu;Jian Wang;Xingxin Li
中科院分区:
计算机科学3区
文献类型:
--
作者:
Yan Jiang;Youwen Zhu;Jian Wang;Xingxin Li

文献摘要

相似文献

基于身份的门限签名(IDTS)是一种保护身份和数据隐私的有效手段,它允许签名方在不需要重新构造签名密钥的情况下以签名者的身份对消息进行协作签名。然而,大多数IDTS方案依赖于可信密钥生成中心(KGC)。近年来,一些IDTS方案可以实现对KGC的无托管安全性,但它们都容易受到不诚实多数环境下的拒绝服务攻击,欺骗者可以在不提供任何反馈的情况下迫使协议中止。在这项工作中,我们提出了一个完全分散的IDTS计划,以抵御损坏的KGC和拒绝服务攻击。为此,我们设计了门限协议来实现分布式密钥生成、私钥提取和签名生成,该协议能够抵抗KGC和签名者之间的合谋,并提出了一种在密钥生成、私钥提取和签名生成过程中能够检测欺诈者身份的身份识别机制.最后,我们形式化地证明了该方案对选择消息攻击具有门限不可伪造性。实验结果表明,密钥生成和签名生成的计算时间均小于1 s,私钥提取时间约为3 s,在分布式环境下具有实用性。
Identity-based threshold signature (IDTS) is a forceful primitive to protect identity and data privacy, in which parties can collaboratively sign a given message as a signer without reconstructing a signing key. Nevertheless, most IDTS schemes rely on a trusted key generation center (KGC). Recently, some IDTS schemes can achieve escrow-free security against corrupted KGC, but all of them are vulnerable to denial-of-service attacks in the dishonest majority setting, where cheaters may force the protocol to abort without providing any feedback. In this work, we present a fully decentralized IDTS scheme to resist corrupted KGC and denial-of-service attacks. To this end, we design threshold protocols to achieve distributed key generation, private key extraction, and signing generation which can withstand the collusion between KGCs and signers, and then we propose an identification mechanism that can detect the identity of cheaters during key generation, private key extraction and signing generation. Finally, we formally prove that the proposed scheme is threshold unforgeability against chosen message attacks. The experimental results show that the computation time of both key generation and signing generation is <1 s, and private key extraction is about 3 s, which is practical in the distributed environment.