| 基于双线性对的匿名否决协议 |
| |
| 引用本文： | 付少锋,李龙海,焦晓鹏. 基于双线性对的匿名否决协议[J]. 计算机工程, 2011, 37(22): 105-106 |
| |
| 作者姓名： | 付少锋 李龙海 焦晓鹏 |
| |
| 作者单位： | 西安电子科技大学计算机学院,西安,710071 |
| |
| 基金项目： | 国家自然科学基金资助项目，中央高校基本科研业务费基金资助项目 |
| |
| 摘 要： | 提出一种基于双线性对的匿名否决协议，会话密钥建立后可在多次投票中被重复利用，每次投票仅需1轮广播，具有最优的轮效率。在多次运行的情况下，该协议的每轮平均计算和通信复杂度低于已知协议。在决策双线性Diffie-Hellman判断问题假设和随机预言模型下证明了该协议的健壮性和匿名性。
|
| 关 键 词： | 电子投票 匿名否决 双线性对 零知识证明 |
| 收稿时间： | 2011-06-10 |
Anonymous Veto Protocol Based on Bilinear Pairings |
| |
| FU Shao-feng,LI Long-hai,JIAO Xiao-peng. Anonymous Veto Protocol Based on Bilinear Pairings[J]. Computer Engineering, 2011, 37(22): 105-106 |
| |
| Authors: | FU Shao-feng LI Long-hai JIAO Xiao-peng |
| |
| Affiliation: | (School of Computer Science and Technology,Xidian University,Xi’an 710071,China) |
| |
| Abstract: | This paper presents an anonymous veto protocol based on bilinear pairings.The session keys established in the setup phase can be used repeatedly over multiple runs.So it requires only 1 round of broadcast in every voting and is optimal in terms of round efficiency.When the protocol runs several times,it involves less computational load and bandwidth usage in every round on average than all the other available designs.The robustness and anonymity are proved under the Decision Bilinear Diffie-Hellman（DBDH） and random oracle assumptions. |
| |
| Keywords: | electronic voting anonymous veto bilinear pairings zero knowledge proof |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
