Verifiable Elections That Scale for Free

Verifiable Elections That Scale for Free
复制标题

可免费扩展的可验证选举

DOI:
--
复制
发表时间:
2013
期刊:
International Conference on Theory and Practice of Public Key Cryptography
影响因子:
--
通讯作者:
S. Meiklejohn
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.