Page 264 - Towards Trustworthy Elections New Directions in Electronic Voting by Ed Gerck (auth.), David Chaum, Markus Jakobsson, Ronald L. Rivest, Peter Y. A. Ryan, Josh Benaloh, Miroslaw Kutylowski, Ben Adida ( (z-lib.org (1)
P. 264

S. Popoveniuc and B. Hosp
                          256
                              Related Work
                          8
                          Verifiable electronic voting has been introduced by David Chaum in 1981
                          [Cha81]. The first voter verifiable version used visual cryptography [CvdGRV07].
                          Peter Ryan introduced the candidate permutation idea and developed an im-
                          proved ballot, much more usable and implementable in a voting system called
                          Pret-A-Voter [CRS05]. An early stage of PunchScan was analyzed by John
                          Kelsey [JK07] who came up with an attack based on the fact that the voter
                          can see the ballot and then decide which page to keep (see Section 3.2).
                          Acknowledgments
                          We would like to thank David Chaum, Poorvi Vora, Rick Carback, Jeremy Robin
                          and Ben Adida, for the vibrant discussions and insightful comments.


                          References

                          [Cha]        Chaum, D.: Secret ballot receipts and transparent integrity - better
                                       and less-costly electronic voting at polling places,
                                       http://www.vreceipt.com/article.pdf
                          [Cha81]      Chaum, D.L.: Untraceable electronic mail, return address, and digital
                                       pseudonym. Communication of ACM (February 1981)
                          [CRS05]      Chaum, D., Ryan, P.Y.A., Schneider, S.: A practical voter-verifiable
                                       election scheme. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann,
                                       D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118–139. Springer,
                                       Heidelberg (2005)
                          [CvdGRV07]   Chaum, D., van de Graaf, J., Ryan, P.Y.A., Vora, P.L.: Secret ballot
                                       elections with unconditional integrity. Technical report, IACR Eprint
                                       (2007), http://eprint.iacr.org/ or
                                       http://www.seas.gwu.edu/ ~ poorvi/cgrv2007.pdf
                          [JK07]       Moran, T., Chaum, D., Kelsey, J., Regenscheid, A.: Hacking paper
                                       some random attacks on paper based e2e systems (2007),
                                       http://kathrin.dagstuhl.de/files/Materials/
                                       07/07311/07311.KelseyJohn.Slides.pdf

                          Appendix

                          A    Permutations

                          PunchScan requires two types of permutations to be generated:

                           – row permutations
                           – mark permutations

                          Row permutations refer to the permutations of the rows of the D table and mark
                          permutation refer to the order in which the positions are associated with marks
                          on the ballot and to D 2 and D 4 .
   259   260   261   262   263   264   265   266   267   268   269