摘要
该文基于可验证秘密共享思想和对Zheng的签密方案的必要修改,首次构造了一种不需要可信中心的门限签密方案.它能同时达到门限签名和加密的双重目的,实现代价仅和门限签名相当,并具有非否认性质.该文对当前一些分布式密钥分配协议做了分析,并基于Naor的基本思想,重点利用签密方案设计了协议SC DKDS.与其它协议相比,该协议在减低实现成本等方面更为有效,因为它不需要认证信道、秘密信道及复杂的零知识证明等.该文还在RO(RandomOracle,随机预言)模型中给出了以上协议的安全性证明.
It is shown in this paper that a kind of new cryptographic primitive proposed by Zheng in 1997, Signcryption, may be applied to construct distributed cryptographic protocols. In fact, the protocols based on Signcryption have the following two properties： Each message exchanged between two participants can be transferred in short data packet, and messages that carry key materials are unforgeable and non-repudiatable without the involvement of a trusted key distribution center. Firstly, based on the modified signcryption scheme of Zheng and Verifiable Secret Sharing （VSS） idea, this paper gives a kind of threshold signcryption scheme without any trusted center for the first time. Furthermore, this scheme can gain its ends of both threshold signature and threshold encryption simultaneously and the costs is much cheaper. In addition, non-repudiation is also offered. Secondly, by analyzing recent distributed key generation protocols, especially Naor＇s idea, it put forward a new protocol mainly based on signcryption, called SC-DKDS. Compared with others, SC-DKDS does not need any additional costs, such as authentication channels, private channels or any complicated zero knowledge proofs. The security proofs of the protocols mentioned above are given in RO（Random Oracle） model.
出处
《计算机学报》
EI
CSCD
北大核心
2005年第9期1421-1430,共10页
Chinese Journal of Computers
基金
国家"九七三"重点基础研究发展规划项目基金(G1999035802)
国家自然科学基金(60253027)
国家杰出青年科学基金(60025205)资助
