一种简单的无收据电子投票系统  

A Simple Receipt-Freeness Electronic Voting Sheme

作　　者：徐杰[1] 仲红[1] 耿波[1] 李锡娟[1] 闫娜娜[1] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室,安徽合肥230039

出　　处：《计算机技术与发展》2008年第9期155-158,共4页Computer Technology and Development

基　　金：国家自然科学基金(60773114);安徽省自然科学基金(070412051);安徽高校省级重点自然科学研究项目(KJ2007A43)

摘　　要：在现有的电子投票系统中,无收据行(receipt-freeness)与可验证性(verifiability)是电子投票协议中一对十分重要而又矛盾的属性。无收据性要求任何人不能得到或生成能证明选票内容的证据,其往往以牺牲可验证性为代价;可验证性提供给对选票及选举结果的验证,提供给投票人与选票的某种联系,这又经常被用来作为证明选票的收据。选择常用的Mix-net模式,利用TRR和1-out-of-L加密证据,re-encryption ELGamal同时实现无收据型与实现可验证性,避免了在投票人与管理机构有特殊的信道假设,减少了系统的通信代价。Receipt- freeness and verifiability are two important but imcompatible attributions in electronie voting wstem. Receipt- freeness requires anyone must neither obtain nor be able to construct a receipt which can prove the content of his vote. Verifiability not only permits the voter to verify that the vote has been counted correctly, but also gives voter to verify that the election tally actually represents the sum of the votes east. But both are sacrificed to achieve the other as conditions. In this paper, choose Mix - net scheme and use TRR to achieve receipt - frecnas. Though 1 - out - of - L enerypt proof and re - eneryption ELGamal achieve verifiability. It makes the as- sumption that a physically untappable means of communication between the mixing center and the voters not necessay anymore, reduce the communication cost.

关 键 词：电子投票 无收据性 可验证性 TRR 1-OUt—of—L加密证据 再加密 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]