Anonymous Veto Protocol Based on Bilinear Pairings
Jiao Xiao-peng · Jisuanji gongcheng · 2011
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.