摘要
群组用户试图在开放式网络上进行安全通信时,需运行一个会议密钥协议来支持一个共同的会议密钥K.本文中,利用基于MDS码(Maximum Distance Code,极大最小距离可分码)的秘密共享方案作为基本构件,提出了一个新颖高效、可证明安全的广播信道下会议密钥协商协议.该协议在广义的Diffie-Hellman Problem(DHP)困难假设下,被动攻击者得不到任何有关诚实参与者协商出的会议密钥的信息;且无论存在多少恶意参与者,诚实参与者一定能够协商出一共同的会议密钥.
When a group of people want to communicate securely over an open network, they need to run a conference-key establishment protocol to establish a common conference key K such that all their communication thereafter are encrypted with the key K. By using the secret sharing scheme based on the MDS code as the basic component in this paper, we propose a new provably secure conference-key agreement protocol under the broadcast channel. In the protocol, a passive adversary gets no information about the conference-key established by the honest participants under the assumption of general Diffie-Hellman problem; and the honest participants can agree on a common conference-key no matter how many participants are malicious.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2004年第4期642-644,共3页
Acta Electronica Sinica
基金
国家自然科学基金(No.60073052)
关键词
MDS码
秘密共享
广播信道
会议密钥协商
数字签名
MDS code
secret sharing
broadcast channel
conference-key agreement
digital sigature