Efficient Anonymous Channel and All/Nothing Election Scheme
Efficient Anonymous Channel and All/Nothing Election Scheme
复制标题
DOI：
10.1007/3-540-48285-7_21
复制
发表时间：
1994-01
期刊：
影响因子：
--
通讯作者：
Choonsik Park;Kazutomo Itoh;K. Kurosawa
中科院分区：
文献类型：
--
作者：
Choonsik Park;Kazutomo Itoh;K. Kurosawa
本文的贡献是双重的。首先，我们提出了一个有效的计算安全的匿名信道，它没有密文长度扩展的问题。长度与MIX（控制中心）的数量无关。它提高了Chaum基于MIX网的自动选举方案的效率。其次，我们展示了一个满足公平性的选举方案。也就是说，如果某张选票被打乱，没有人能获得关于所有其他选票的任何信息。每个投票者发送O（nk）位，使得公平性的概率为1 − 2−k，其中是密文的位长。
The contribution of this paper are twofold. First, we present an efficient computationally secure anonymous channel which has no problem of ciphertext length expansion. The length is irrelevant to the number of MIXes ( control centers ). It improves the efficiency of Chaum’s election scheme based on the MIX net automatically. Second, we show an election scheme which satisfies fairness. That is, if some vote is disrupted, no one obtains any information about all the other votes. Each voter sendsO(nk)bits so that the probability of the fairness is 1 − 2−k, wherenis the bit length of the ciphertext.