A viewable e-voting scheme for environments with conflict of interest

CNS(2013)

引用 5|浏览6
暂无评分
摘要
In this paper, we propose a distributed, verifiable, and viewable e-voting scheme. Our scheme mimics the real life voting environments such as multiple political parties with conflict of interest, and meets typical demands in such environments. Meanwhile, the computation is distributed among all voters and the entire voting process is transparent to all as well. A voter can not only verify his own vote, but also view all other individual votes, and consequently the vote total for each candidate. In particular, our scheme observes both anonymity and accountability, while managing fairness. Our analysis and experiment show that the scheme scales in polynomial.
更多
查看译文
关键词
anonymity,fairness,polynomial,accountability,transparency,secret sharing,commitment scheme,polynomials,government data processing,viewable e-voting scheme,fairness management,e-voting
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要