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.

Key words: electronic voting, anonymous veto, bilinear pairings, zero knowledge proof

摘要： 提出一种基于双线性对的匿名否决协议，会话密钥建立后可在多次投票中被重复利用，每次投票仅需1轮广播，具有最优的轮效率。在多次运行的情况下，该协议的每轮平均计算和通信复杂度低于已知协议。在决策双线性Diffie-Hellman判断问题假设和随机预言模型下证明了该协议的健壮性和匿名性。

关键词: 电子投票, 匿名否决, 双线性对, 零知识证明

CLC Number: 

• TN918