Practical Governmental Voting with Unconditional Integrity and Privacy

  title={Practical Governmental Voting with Unconditional Integrity and Privacy},
  author={Nan Yang and Jeremy Clark},
  booktitle={Financial Cryptography Workshops},
Throughout the years, many cryptographically verifiable voting systems have been proposed with a whole spectrum of features and security assumptions. Where the voter casts an in-person (and possibly paper) ballot and leaves, as is common in a governmental election, the majority of the proposals fall in the category of providing unconditional integrity and computational privacy. A minority of papers have looked at the inverse scenario: everlasting privacy with computational integrity. However as… 
Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs
This work builds upon Moran and Naor’s solution—and its extensions, applications and generalisations—to present a scheme which is additively homomorphic, efficient to verify, and rests upon well studied assumptions.
Towards everlasting privacy and efficient coercion resistance in remote electronic voting
A first version of an e-voting scheme that achieves end-to-end verifiability, everlasting privacy and efficient coercion resistance in the JCJ setting is proposed, and a new primitive called publicly auditable conditional blind signature is proposed.
Fixing the Achilles Heel of E-Voting: The Bulletin Board
This work presents novel attacks on the e-voting protocols Belenios, Civitas, and Helios that violate some of their central security claims under realistic system assumptions and proposes a BB protocol that satisfies final-agreement under weak, realistic trust assumptions and provides a machine-checked proof thereof.
Cronus: Everlasting Privacy with Audit and Cast
This work presents a new online voting scheme with everlasting privacy and cast-as-intended verifiability, and provides measures for avoiding coercion by allowing any party to create fake proofs for the content of any vote.
Transparent Voting Platform Based on Permissioned Blockchain
A broad comparison between ongoing voting systems has been studied by analyzing their structure and the drawbacks that should consider in future to improve the whole election process from keeping the privacy of the voter, casting a vote with the possibility to check if it was counted correctly to publishing the results.
Financial Cryptography and Data Security: FC 2018 International Workshops, BITCOIN, VOTING, and WTSC, Nieuwpoort, Curaçao, March 2, 2018, Revised Selected Papers
Three smart contracts are presented that allow a briber to fairly exchange bribes to miners who pursue a mining strategy benefiting the briber by understanding the extent to which smart contracts can impact the incentive mechanisms involved in Nakamoto-style consensus protocols.
The Agile Way
This chapter gives an overview of the concept of enterprise agility and how this gives organizations more flexibility. This includes an in-depth evaluation of modern enterprises and a few case


Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols
Split-ballot voting: Everlasting privacy with distributed trust
A new voting protocol with several desirable security properties, including “everlasting privacy”, that can be performed by humans without computers and formally proves the security of the protocol in the universal composability framework, based on number-theoretic assumptions.
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free
On Some Incompatible Properties of Voting Schemes
It is shown that a voting system that wants to publish the final list of the voters who actually voted, and to compute the number of times each candidate has been chosen, cannot achieve universal verifiability of the tally (UV) and unconditional privacy of the votes (UP) simultaneously.
Self-tallying Elections and Perfect Ballot Secrecy
This work introduces a new election paradigm with strong voter privacy as its primary objective, and presents a novel voting scheme which is the first system that is dispute-free, self-tallying and supports perfect ballot secrecy.
Verifiable Internet Elections with Everlasting Privacy and Minimal Trust
A new cryptographic Internet voting protocol based on a set membership proof and a proof of knowledge of the representation of a committed value that offers a solution to the everlasting privacy problem.
Three Voting Protocols: ThreeBallot, VAV, and Twin
Three new paper-based voting methods with interesting security properties are presented, including Floating Receipts, which is well-tuned to the security requirements of ThreeBallot-like schemes, and protocols for achieving them are examined.
Coercion-Resistant Internet Voting with Everlasting Privacy
The cryptographic voting protocol presented in this paper offers public verifiability, everlasting privacy, and coercion-resistance simultaneously. Voters are authenticated anonymously based on
Improving Helios with Everlasting Privacy Towards the Public
Improvements on the Helios voting protocol are proposed such that the audit data published by the authority provides everlasting privacy, as opposed to the computational privacy provided currently.
Bare-Handed Electronic Voting with Pre-processing
This paper proposes a scheme where the voter votes bare-handedly, and still maintains his privacy even with respect to the voting booth, and shows that such extended schemes enjoy the same unforgeability guarantee as that of Chaum and Neff.