摘要
基于离散对数问题提出一个具有门限共享解签密的数字签密方案,该方案是Jung等提出的签密方案和Shamir门限方案的结合。在该方案中,发送者利用其秘密密钥产生消息签名的密文并送给特定的接收组,接收组中的n个接收者中任意t个可以对签密的消息解签密,而t-1个或更少的接收者不能对签密的消息解签密。该方案与Hsu和Wu提出的具有门限共享验证的认证加密方案相比,签名加密效率更高,可以检测恶意的接收组成员。
A new signcryption scheme with threshold shared unsigncryption based on discrete logarithm is proposed,which is the integration of Jung et al.'s signcryption scheme and Shamir secret sharing scheme.In this scheme ,the sender generates the ciphertext of signature for a message by using his own secret key and transmits the ciphertext to a specified group of receivers in such a way that any t of n receivers can unsigncrypt the message and any t-1or fewer receivers can not unsigncrypt the message.As compared to Hsu and Wu ’s authenticated encryption scheme with(t,n)shared verification,the proposed scheme has the following advantages:it is more efficient for signature generation and encryption;it can detect malicious verifiers cheating others.
出处
《苏州科技学院学报（自然科学版）》
CAS
2003年第2期6-10,共5页
Journal of Suzhou University of Science and Technology （Natural Science Edition）
基金
国家重点基础研究发展规划项目(97-3项目)(G1999035804)。
关键词
数字签密
离散对数
秘密分享
signcryption
discrete logarithm
secret sharing
