The desired security properties of electronic voting protocols include verifiability, accuracy, democracy and fairness. In this paper we use a static program analysis tool to validate these properties for one of the classical voting protocols under appropriate assumptions. The protocol is formalised in an extension of the LYSA process calculus with blinding signatures. The analysis, which is fu...

The Helios voting scheme is well studied including formal proofs for verifiability and ballot privacy, but it does not provide participation privacy (i.e. it reveals who participated in the election). Kulyk, Teague and Volkamer proposed an extension to Helios that is claimed to provide ballot privacy as well as participation privacy while providing stronger verifiability than Helios. However, t...

Most electronic voting schemes aim at providing verifiability: voters should trust the result without having to rely on some authorities. Actually, even a prominent voting system like Helios cannot fully achieve verifiability since a dishonest bulletin board may add ballots. This problem is called ballot stuffing. In this paper we give a definition of verifiability in the computational model to...

When reporting the news, journalists rely on the statements of stakeholders, experts, and officials. The attribution of such a statement is verifiable if its fidelity to the source can be confirmed or denied. In this paper, we develop a new NLP task: determining the verifiability of an attribution based on linguistic cues. We operationalize the notion of verifiability as a score between 0 and 1...

This paper presents an information-theoretic model of a voting system, consisting of (a) definitions of the desirable qualities of integrity, privacy and verifiability, and (b) quantitative measures of how close a system is to being perfect with respect to each of the qualities. It describes the well-known trade-off between integrity and privacy in this model, and defines a concept of weak priv...

Electronic democracy (e-democracy) is a necessity in this era of computers and information technology. Electronic election (e-election) is one of the most important applications of e-democracy, because of the importance of the voters’ privacy and the possibility of frauds. Electronic voting (e-voting) is the most significant part of e-election, which refers to the use of computers or computeris...

This study generates Watts’s (2003a) asymmetric verification concept of conservatism endogenously, using evolutionary biology as a foundation. A producer has diminishing marginal returns to output and is thus risk averse in gains. After production, the producer faces a stealer who seeks to expropriate the output. The producer, for fear of being perceived as weak, will never share his output wit...

VSS (verifiable secret sharing) is an important security protection tool in distributed systems. When VSS is employed in publicly verifiable applications, it needs to achieve public verifiability and be upgraded to PVSS (publicly verifiable secret sharing). Besides the two basic security properties, bindingness and hidingness, PVSS concentrates on public verifiability of validity all the operat...

We develop a model of strategic contractual incompleteness that identifies conditions under which principals might omit even costlessly verifiable terms. We then use experiments to test comparative statics predictions of the model. While it is well known that verifiability imperfections can limit complete contracting, researchers know less about how the degree of imperfection affects endogenous...

We discuss the use of POLYAS, an Internet voting system, in GI (German Society for Computer Scientists (Gesellschaft für Informatik e.V.)) elections before 2010, in 2010 and 2011, as well as in the future. We briefly describe how the system was extended in 2010 to provide partial verifiability and how the integrity of the GI election result was verified in the 2010 and 2011 elections. Informati...