Practicing Ballot Secrecy : Postal Voting and the Witness Requirement at the 2019 Finnish Elections

Electoral rights belong to the core of citizenship in democratic nation-states. Voting, then, represents an actualization of the relationship between the citizen and the political community. For citizens living outside the country in which they are eligible to vote, voting signifies a rare institutional connection to the country of origin. The aim of this article is to explore the introduction of the postal vote, a new form of voting for external voters at Finnish elections, from the grassroots perspective. The study focuses on how a central policy concern, safeguarding ballot secrecy, was resolved in the policy implementation by the witness requirement, and how the individual voters subsequently applied it. According to the voters’ accounts of the act of voting, the adopted method for underlining the importance of ballot secrecy in the Finnish overseas postal voting system, for many voters, makes little sense. While they effectively practice ballot secrecy, many fail to demonstrate this to the witnesses they were supposed to convince. Conversely, for these voters, the witness requirement merely works to break the secondary secrecy of elections, namely the secrecy of their participation itself. The empirical material for the article comprises policy documents and thematic text material (interviews, written responses) from 31 Finnish citizens living outside Finland. The article contributes to the scholarly debates on voting as a social, institutional and material practice. It further provides policy-relevant knowledge about grassroots implementation to various electoral administrations many of which, at the time of writing, face pressure to reform their repertoire of voting methods to function better in exceptional circumstances, such as a pandemic.Peer reviewe

What proof do we prefer? Variants of verifiability in voting

In this paper, we discuss one particular feature of Internet voting, verifiability, against the background of scientific literature and experiments in the Netherlands. In order to conceptually clarify what verifiability is about, we distinguish classical verifiability from constructive veriability in both individual and universal verification. In classical individual verifiability, a proof that a vote has been counted can be given without revealing the vote. In constructive individual verifiability, a proof is only accepted if the witness (i.e. the vote) can be reconstructed. Analogous concepts are de- fined for universal veriability of the tally. The RIES system used in the Netherlands establishes constructive individual verifiability and constructive universal verifiability, whereas many advanced cryptographic systems described in the scientific literature establish classical individual verifiability and classical universal verifiability. If systems with a particular kind of verifiability continue to be used successfully in practice, this may influence the way in which people are involved in elections, and their image of democracy. Thus, the choice for a particular kind of verifiability in an experiment may have political consequences. We recommend making a well-informed democratic choice for the way in which both individual and universal verifiability should be realised in Internet voting, in order to avoid these unconscious political side-effects of the technology used. The safest choice in this respect, which maintains most properties of current elections, is classical individual verifiability combined with constructive universal verifiability. We would like to encourage discussion about the feasibility of this direction in scientific research

Witness Hiding Proofs and Applications

Witness hiding is a basic requirement for most cryptology protocols. The concept was proposed by Feige and Shamir several years ago. This thesis concentrates on witness hiding protocols and its applications.The possibility to divert a witness hiding protocol parallelly had been an open problem for some time. The parallel divertibility is not only of theoretical significance but also a crucial point for the security of some applications, for example, electronic cash, digital signatures, etc. It is proved, in this thesis, that with limited computational power, it is impossible to divert a witness hiding protocol parallelly to two independent verifiers with large probability.The thesis explores the applications of witness hiding protocols in anonymous credentials, election schemes, and group signatures. In an anonymous credential system, one user may have many pseudonyms. The credentials issued on one of a user's pseudonyms can be transferred to other pseudonyms by the user without revealing the links between pseudonyms. Election, as a practical model, is formally defined. Two election schemes are proposed and discussed. Especially the voting scheme is parallelized with electronic cash system so that some new tool can be introduced. Group signature is a kind of digital signature for a group of people such that only members of the group can sign messages on behalf of the group and without revealing which member has signed. But the signer can be identified by either an authority or a certain number of group members who hold some kind of auxiliary information. The new group signature schemes, based on witness hiding proofs, have several advantages, compared with the original scheme proposed by Chaum and Heijst. The most important improvement is that the signers can be identified by a majority of group members, which had been a open problem in the literature. In this thesis, some theoretical results about bounds of secret keys and auxiliary information have been proved

Democracy From Afar: States Show Progress on Military and Overseas Voting

Gives an overview of reforms in state laws to provide military and overseas voters enough time to vote, electronic transmission of unvoted ballots, elimination of notarization or witness requirements, and expanded use of federal write-in absentee ballots

Study of consensus protocols and improvement of the Federated Byzantine Agreement (FBA) algorithm

At a present time, it has been proven that blockchain technology has influenced to a great extent the way of human interaction in a digital world. The operation of the blockchain systems allows the peers to implement digital transactions in a Peer to Peer (P2P) network in a direct way without the need of third parties. Each blockchain determines different rules for the record of the transactions in the ledger. The transactions are inserted in blocks and each one, in turn, is appended to the chain (ledger) based on different consensus algorithms. Once blocks have been inserted in the chain, the consensus has been reached and the blocks with corresponding transactions are considered immutable. This thesis analyses the main features of the blockchain and how the consensus can be achieved through the different kinds of consensus algorithms. In addition, a detailed reference for Stellar and Federated Byzantine Agreement (FBA) consensus protocols is made in order to explain these algorithms, their limitations as well as their improvement. The development of a reputation mechanism is necessary to the improvement of above algorithms

A Cut Principle for Information Flow

We view a distributed system as a graph of active locations with unidirectional channels between them, through which they pass messages. In this context, the graph structure of a system constrains the propagation of information through it. Suppose a set of channels is a cut set between an information source and a potential sink. We prove that, if there is no disclosure from the source to the cut set, then there can be no disclosure to the sink. We introduce a new formalization of partial disclosure, called *blur operators*, and show that the same cut property is preserved for disclosure to within a blur operator. This cut-blur property also implies a compositional principle, which ensures limited disclosure for a class of systems that differ only beyond the cut.Comment: 31 page