Data Anonymity in the FOO Voting Scheme

Electronic Notes in Theoretical Computer Science

Volumn 168, Issue SPEC. ISS., 2007, Pages 5-28

  Mauw, S ^a   Verschuren, J ^a   de Vink, E P ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

anonymity and privacy; attribution set; data anonymity; e voting; formal methods for security protocols

Indexed keywords

DATA REDUCTION; ELECTRONIC DATA INTERCHANGE; NETWORK PROTOCOLS; SECURITY OF DATA; SECURITY SYSTEMS;

DATA ANONYMITY; E-VOTING; ELECTRONIC VOTING PROTOCOL; SECURITY PROTOCOLS;

DATA PRIVACY;

EID: 33846571461     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.11.001     Document Type: Article

References (52)

1. Abadi, M. and C. Fournet, Mobile values, new names, and secure communication, in: Proc. POPL '01 (2001), pp. 104-115
2. Abadi M., and Fournet C. Private authentication. Theoretical Computer Science 322 (2004) 427-476
3. Adithia, M., "Probabilistic Analysis of Network Anonymity using PRISM," Master's thesis, Eindhoven University of Technology (2006)
4. Association for Automatic Identification and Mobility, RFID. org (2004). http://www.aimglobal.org/technologies/rfid/
5. Baeten J., and Weijland W. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990), Cambridge University Press
6. Benaloh, J. and D. Tuinstra, Receipt-free secret-ballot elections (extended abstract), in: Proc. STOC '94, Montreal (1994), pp. 544-553
7. Bergstra J., Ponse A., and Smolka S.A. Handbook of Process Algebra (2001), Elsevier
8. Blanchet, B., An efficient cryptographic protocol verifier based on Prolog rules., in: 14th Computer Security Foundations Workshop, Cape Breton, Nova Scotia (2001), pp. 82-96
9. Blanchet, B., M. Abadi and C. Fournet, Automated verification of selected equivalences for security protocols., in: 20th IEEE Symposium on Logic in Computer Science, Chicago (2005), pp. 331-340
10. Bodei, C., M. Buchholtz, P. Degano, F. Nielson and H. Nielson, Automatic validation of protocol narration, in: Proc. CSFW 2003, Pacific Grove (2003), pp. 126-140
11. Boyd, C., A new multiple key cipher and an improved voting scheme, in: Proc. Eurocrypt '89 (1989), pp. 617-625
12. Chaum D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24 (1981) 84-88
13. Chaum D. Security without identification: transaction systems to make big brother obsolete. Communications of the ACM 28 (1985) 1030-1044
14. Chaum, D., Elections with unconditionally secret ballots and disruption equivalent to breaking rsa, in: Proc. Eurocrypt '88 (1988), pp. 177-182
15. Chaum, D. and E. van Heyst, Group signatures, in: D. Davies, editor, Proc. EUROCRYPT '91 (1991), pp. 257-265
16. Clarke R. Introduction to dataveillance and information privacy, and definitions of terms (1999). http://www.anu.edu.au/people/Roger.Clarke/DV/Intro.html
17. Cramer, R., M. Franklin, B. Schoenmakers and M. Yung, Multi-autority secret-ballot elections with linear work., in: U. Maurer, editor, Proc. Eurocrypt '96 (1996), pp. 72-83
18. Cramer, R., R. Gennaro and B. Schoenmakers, A secure and optimally efficient multi-authority election scheme., in: W. Fumy, editor, Proc. Eurocrypt '97 (1997), pp. 103-118
19. Cranor L., and Cytron R. Sensus: A security-conscious electronic polling system for the internet. http://lorrie.cranor.org/pubs/hicss/hicss.html
20. Cranor, L. and R. Cytron., Design and implementation of a practical security-conscious electronic polling system, Technical Report WUCS-96-02, Dept. of Computer Science, Washington University (1996)
21. Desmedt, Y. and K. Kurosawa, How to break a practical mix and design a new one, in: B. Preneel, editor, Proc. Eurocrypt 2000 (2000), pp. 557-572
22. Díaz, C., S. Seys, J. Claessens and B. Preneel, Towards measuring anonymity, in: R. Dingledine and P. Syverson, editors, Proc. PET 2002 (2003), pp. 54-68
23. Fokkink W. Introduction to Process Algebra. Texts in Theoretical Computer Science, an EATCS Series (2000), Springer
24. Freedman, M. and R. Morris, Tarzan: a peer-to-peer anonymizing network layer., in: V. Atluri, editor, ACM Conference on Computer and Communications Security, 2002, pp. 193-206
25. Fujioka, A., T. Okamoto and K. Ohta, A practical secret voting scheme for large scale elections, in: J. Seberry and Y. Zheng, editors, Advances in Cryptology - AUSCRYPT'92 (1992), pp. 244-251
26. Goldschlag, D., M. Reed and P. Syverson, Hiding routing information, in: R. Anderson, editor, Proc. 1st International Workshop on Information Hiding (1996), pp. 137-150
27. Gray J., and Syverson P. A logical approach to multilevel security of probabilistic systems. Distributed Computing 11 (1998) 73-90
28. Herschberg M.A. Secure electronic voting over the world wide web (1997). http://theory.lcs.mit.edu/~cis/theses/herschberg/
29. Hirt, M. and K. Sako, Efficient receipt-free voting based on homomorphic encryption., in: B. Preneel, editor, Proc. Eurocrypt 2000 (2000), pp. 539-556
30. Hughes D., and Shmatikov V. Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security (2002) 3-36
31. ISO, Common Criteria-ISO/IEC/15408 (1999). http://csrc.nist.gov/cc/
32. Jakobsson, M., A practical mix, in: K. Nyberg, editor, Proc. Eurocrypt '98 (1998), pp. 448-461
33. J.Y. Halpern, K. O., Anonymity and information hiding in multiagent systems, in: Proceedings of the 16th IEEE Computer Security Foundations Workshop, 2003, pp. 75-88
34. Korkea-Aho, M., Anonymity and privacy in the electronic world (1999), seminar on Network Security, Helsinki University of Technology
35. Kremer, S. and M. Ryan, Analysis of an electronic voting protocol in the applied pi calculus, in: S. Sagiv, editor, Proc. ESOP 2005, 2005, pp. 186-200
36. Lipmaa H. Secure electronic voting protocols. In: Bidgoli H. (Ed). The Handbook of Information Security (2006)
37. Mauw, S., J. Verschuren and E. de Vink, A formalization of anonymity and onion routing, in: P. Samarati, P. Ryan, D. Gollmann and R. Molva, editors, ESORICS'04 (2004), pp. 109-124
38. Motwani R., and Raghavan P. Randomized algorithms (1995), Cambridge University Press
39. Nielsen, C., E. Andersen and H. Nielson, Static validation of a voting protocol, in: P. Degano and L. Viganó, editors, Proc. ARSPA 2005) (2005), pp. 115-134
40. Okamoto, T., Receipt-free electronic voting schemes for large scale elections, in: B. Christianson, B. Crispo, T. Lomas and M. Roe, editors, Proc. Security Protocols Workshop '97 (1998), pp. 25-35
41. Park, C., K. Itoh and K. Kurosawa, Efficient anonymous channel and all/nothing election scheme, in: T. Helleseth, editor, Proc. Eurocrypt '93 (1993), pp. 248-259
42. Pfitzmann A., and Köhntopp M. Anonymity, unobservability, and pseudonymity. In: Federrath H. (Ed). Designing Privacy Enhancing Technologies (2001) 1-9
43. Pfitzmann, B., Breaking an efficient anonymous channel, in: L. Guillou and J.-J. Quisquater, editors, Proc. Eurocrypt '94 (1995), pp. 332-340
44. Reiter M., and Rubin A. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security 1 (1998) 66-92
45. Rjaskova Z. Electronic voting schemes (2002). http://people.ksp.sk/~zuzka/elevote.pdf
46. Schneider, S. and A. Sidiropoulos, CSP and anonymity, in: Proc. ESORICS'96 (1996), pp. 198-218
47. Serjantov, A. and G. Danezis, Towards an information theoretic metric for anonymity, in: H. Federrath, editor, Proc. PET 2002 (2003), pp. 41-53
48. Shmatikov V. Probabilistic analysis of an anonymity system. Journal of Computer Security 12 (2004) 355-377
49. Steinbrecher, S. and S. Köpsell, Modelling unlinkability, in: R. Dingledine, editor, Proceedings of Privacy Enhancing Technologies workshop (PET 2003) (2003), pp. 32-47
50. Syverson, P., D. Goldschlag and M. Reed, Anonymous connections and onion routing, in: IEEE Symposium on Security and Privacy, Oakland, California, 1997, pp. 44-54
51. Syverson, P. and S. Stubblebine, Group principals and the formalization of anonymity, in: J. Wing, J. Woodcock and J. Davies, editors, Proc. FM'99 (1999), pp. 814-833
52. Syverson P., Tsudik G., Reed M., and Landwehr C. Towards an analysis of onion routing security. In: Federrath H. (Ed). Designing Privacy Enhancing Technologies (2001) 96-114