Verifiable Elections That Scale for Free
Verifiable Elections That Scale for Free
复制标题
可免费扩展的可验证选举
DOI:
--
复制
发表时间:
2013
期刊:
影响因子:
--
通讯作者:
S. Meiklejohn
中科院分区:
文献类型:
--
作者:
Melissa Chase;Markulf Kohlweiss;Anna Lysyanskaya;S. Meiklejohn
In order to guarantee a fair and transparent voting process, electronic voting schemes must be verifiable. Most of the time, however, it is important that elections also be anonymous. The notion of a verifiable shuffle describes how to satisfy both properties at the same time: ballots are submitted to a public bulletin board in encrypted form, verifiably shuffled by several mix servers (thus guaranteeing anonymity), and then verifiably decrypted by an appropriate threshold decryption mechanism. To guarantee transparency, the intermediate shuffles and decryption results, together with proofs of their correctness, are posted on the bulletin board throughout this process.