摘要
提出了具有(k,l)门限验证的(t,n)门限签名方案,它用于团体间的签名与验证,不需要分配中心(SDC)。在该方案中,签名团体中的任意t个参与者能代表团体对消息签名,而验证团体中的任意k个参与者能代表团体验证该签名。这里不需要SDC为两个团体中的所有参与者分配公钥和私钥,因此实际应用中,在通信和计算复杂性方面所提出的方案比先前的方案更加的实用、有效。
In this paper,we shall propose a (t,n) threshold signature with(k,l) threshold-shared verification to be used in a group-oriented cryptosystem without a Shared Distribution Center(SDC).In this scheme,any t participants can represent a group (signing group) to sign a message,and any k participants can represent another another group (verifying group) to verify the signature.We need no SDC to distribute the public and private keys to all the participants in the two groups.Hence,this scheme is more practical in real-world application and more efficient than its predecessors in terms of communication and computationa; complexity as well as storage.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第16期130-134,共5页
Computer Engineering and Applications
基金
国家高技术研究发展计划(863) (the National High- Tech Research and Development Plan of China under Grant No.2003AA4Z1070)
甘肃省自然科学基金(the Natural Science Foundation of Gansu Province of China under Grant No.ZS021-A25-018-G)
关键词
密码系统
数字签名
椭圆曲线
秘密共享
门限密码系统
crytosystem
digital signatures
elliptic curves
secret sharing
threshold cryptosystem