蔡永泉, 王亚丽. 基于椭圆曲线的会议密钥协商协议[J]. 北京工业大学学报, 2007, 33(8): 870-873.
    引用本文: 蔡永泉, 王亚丽. 基于椭圆曲线的会议密钥协商协议[J]. 北京工业大学学报, 2007, 33(8): 870-873.
    CAI Yong-quan, WANG Ya-li. Conference Key Agreement Protocol Based on Elliptic Curve[J]. Journal of Beijing University of Technology, 2007, 33(8): 870-873.
    Citation: CAI Yong-quan, WANG Ya-li. Conference Key Agreement Protocol Based on Elliptic Curve[J]. Journal of Beijing University of Technology, 2007, 33(8): 870-873.

    基于椭圆曲线的会议密钥协商协议

    Conference Key Agreement Protocol Based on Elliptic Curve

    • 摘要: 为了提高错误容忍的会议密钥协商协议的执行效率,利用椭圆曲线数字签名算法与椭圆曲线Diffie- Hellman密钥交换协议,提出了一种认证广播信道下前向安全的会议密钥协商协议,并分析了该协议的安全性与执行效率.在椭圆曲线离散对数问题难解的假设下,该协议中被动攻击者得不到诚实参与者协商出的会议密钥的任何信息,且无论存在多少恶意参与者,诚实参与者都能协商出一个共同的会议密钥.与现有方案相比,在相同安全强度下,该协议具有通讯量更小、计算效率更高等特点.

       

      Abstract: To improve the implementation efficiency of conference key agreement protocol with fault toler- ance,this paper presents a conference key agreement protocol with forward secrecy by using Elliptic Curve Digital Signature Algorithm and elliptic curve Diffie-Hellman key exchange protocol.Based on the intractability of the Elliptic Curve Discrete Logarithm Problem,honest participants can agree on a common conference key no matter how many malicious participants are,and passive adversaries get no information about the conference key established by honest participants.Compared with the existing schemes at the same security level,the proposed scheme requires much less computation and communication cost.

       

    /

    返回文章
    返回