A robust (k, n) + 1 threshold proxy signature scheme based on factoring
A robust (k, n) + 1 threshold proxy signature scheme based on factoring
复制标题
DOI：
10.1016/j.amc.2004.04.104
复制
发表时间：
2005-07
期刊：
影响因子：
--
通讯作者：
Rongxing Lu;Z. Cao;Haojin Zhu
中科院分区：
文献类型：
--
作者：
Rongxing Lu;Z. Cao;Haojin Zhu
代理签名是一个活跃的密码学研究领域。由于曼波等人。 1996年引入了代理签名的概念，许多代理签名方案被提出。然而，大多数先前提出的方案都是基于离散对数问题。在本文中，我们提出一种基于因式分解的新的鲁棒（k，n）+1门限代理签名方案。在该方案中，生成有效的代理签名不仅需要n个代理签名者中的任意k个或更多成员，而且还需要一个可信经销商来合作签署消息。据我们所知，这是第一个基于因子分解的(k,n)+1门限代理签名方案。
Proxy signature is an active cryptographic research area. Since Mambo et al. introduced the concept of proxy signature in 1996, many proxy signature schemes have been proposed. However, most of these previously proposed schemes are based on discrete logarithm problems. In this paper, we would like to propose a new robust (k,n)+1 threshold proxy signature scheme based on factoring. In this scheme, generating a valid proxy signature needs not only any k or more members in n proxy signers but also a trusted dealer to cooperatively sign a message. To our best knowledge, this is the first (k,n)+1 threshold proxy signature scheme based on factoring.