Verifiable Internet voting solving secure platform problem

被引:0
作者
Kutylowski, Miroslaw [1 ]
Zagorski, Filip [1 ]
机构
[1] Wroclaw Univ Technol, Inst Math & Comp Sci, Wroclaw, Poland
来源
ADVANCES IN INFORMATION AND COMPUTER SECURITY, PROCEEDINGS | 2007年 / 4752卷
关键词
electronic voting; vote selling; coercion resistance; anonymity;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a voter verifiable Internet voting scheme which provides anonymity and eliminates the danger of vote selling even if the computer used by the voter cannot be fully trusted. The ballots cast remain anonymous - even the machine does not know the choice of the voter. It makes no sense to buy votes - the voter can cheat the buyer even if his machine cooperates with the buyer. Nevertheless, the voter can verity that his vote has been counted.
引用
收藏
页码:199 / +
页数:3
相关论文
共 17 条
  • [1] Andrew Neff C., 2001, P 8 ACM C COMP COMM, P116, DOI DOI 10.1145/501983.502000
  • [2] Chaum D, 2005, LECT NOTES COMPUT SC, V3679, P118
  • [3] CHAUM D, IEEE S P 04
  • [4] CHAUM D, 2005, WORKSH FRONT EL EL
  • [5] UNTRACEABLE ELECTRONIC MAIL, RETURN ADDRESSES, AND DIGITAL PSEUDONYMS
    CHAUM, DL
    [J]. COMMUNICATIONS OF THE ACM, 1981, 24 (02) : 84 - 88
  • [6] Furukawa J., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P368
  • [7] Golle P, 2005, LECT NOTES COMPUT SC, V3424, P51
  • [8] Golle P, 2004, LECT NOTES COMPUT SC, V2964, P163
  • [9] HIRTH M, 2005, WORKSH FRONT EL EL
  • [10] Jakobsson M, 2002, USENIX ASSOCIATION PROCEEDINGS OF THE 11TH USENIX SECURITY SYMPOSIUM, P339