基于ECDLP的高效承诺方案  

Efficient commitment scheme based on ECDLP

作　　者：赖欣[1] 喻秀英[1] 何大可[1] 

机构地区：[1]西南交通大学信息安全与国家网格计算实验室,成都610031

出　　处：《计算机工程与应用》2008年第3期136-138,共3页Computer Engineering and Applications

基　　金：国家部委科技重点实验室基金

摘　　要：承诺方案不仅是许多密码协议中的核心部分,同时也被直接使用于远程电子投票、电子选举、电子拍卖等场合。提出一个基于椭圆曲线离散对数困难问题的承诺方案,该方案不需要在参与方之间进行信息交互,并通过执行一轮承诺阶段和公开承诺阶段就可以实现发送方对某一消息的承诺。对该方案进行详尽地分析,指出基于椭圆曲线离散对数困难问题该方案具有消息隐藏性和消息绑定性,且在执行效率和通信带宽上具有优势。Commitment scheme is not only the fundamental primitive in cryptographic protocols but also be used directly in the remote electronic votingx,electronic voting,and electronic auction occasions.In this paper,based on the elliptic curve discrete logarithm problem a commitment scheme is proposed.In this scheme the information exchange among participants is not needed.Through the implementation of commitments phase and a decommitment phase a commitment of message can be achieved from the sender.A detailed security analysis of the scheme is given.Based on elliptic curve discrete logarithm problem the scheme is hiding and binding,also has the advantage in efficiency and communication bandwidth.

关 键 词：密码协议 承诺方案 椭圆曲线离散对数问题 隐藏性 绑定性 

分 类 号：TN918.2[电子电信—通信与信息系统]