In this paper we consider the problem of distributed leader election in unoriented Abelian Cayley graphs of degree 4. This family of graphs, denoted by C G 4, include bidimensional tori of arbitrary size and chordal rings with one arbitrary chord. We present an algorithm which assumes that the only structural knowledge available to the nodes is “I am in an Abelian Cayley Graph of degree 4”. The...

Palamidessi has shown that the π-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi’s methods, we deduce that there is no encoding satisfying certain conditions from MA into CCS. We also sh...

While electronic elections promise the possibility of convenient, efficient and secure facilities for recording and tallying votes, recent studies have highlighted inadequacies in implemented systems. These inadequacies provide additional motivation for applying formal methods to the validation of electronic voting protocols. In this paper we report on some of our recent efforts in using the ap...

This paper outlines the preliminary findings of the empirical stage of the research to establish the reasons that in 2003 some English local authorities decided to trial e-voting and others did not. The key findings demonstrate that central and local governments have different agendas and there is little momentum from central government to increase the number of pilot schemes. The central gover...

Recently, remote voting systems have gained popularity and have been used for government elections and referendums in the United Kingdom, Estonia and Switzerland as well as municipal elections in Canada and party primary elections in the United States and France. Current remote voting schemes assume either the voter’s personal computer is trusted or the voter is not physically coerced. In this ...

Coercion-resistance is the most effective property to fight coercive attacks in Internet elections. This notion was introduced by Juels, Catalano, and Jakobsson (JCJ) at WPES 2005 together with a voting protocol that satisfies such a stringent security requirement. Unfortunately, their scheme has a quadratic complexity (the overhead for tallying authorities is quadratic in the number of votes) ...