English
Related papers

Related papers: Towards Verifiable Remote Voting with Paper Assura…

200 papers

E-voting systems have emerged as a powerful technology for improving democracy by reducing election cost, increasing voter participation, and even allowing voters to directly verify the entire election procedure. Prior internet voting…

Electronic and remote voting has become a large field of research and brought forth a multiplicity of schemes, systems, cryptographic primitives as well as formal definitions and requirements for electronic elections. In this survey we try…

Computers and Society · Computer Science 2017-02-10 Alexander Schneider , Christian Meter , Philipp Hagemeister

We present a protocol that allows voters to phone in their votes. Our protocol makes it expensive for a candidate and a voter to cooperate to prove to the candidate who the voter voted for. When the electoral pool is large enough, the cost…

Cryptography and Security · Computer Science 2014-11-06 Manoj Gopalkrishnan

A secret ballot mechanism that enables voting in absence is proposed. It amends standard vote collection methods that use ballot box as anonymizer, adding the option for absent voters to vote by a proxy blinded to the content of the ballot…

Cryptography and Security · Computer Science 2018-12-31 Zuzana Haniková

Modern democracies face an existential crisis of waning public trust in election results. While End-to-End Verifiable (E2E-V) voting systems promise mathematically secure elections, their reliance on complex cryptography creates a ``black…

Cryptography and Security · Computer Science 2026-03-24 Alon Gat

We present a system for running auditable and verifiable elections in untrusted environments. Votes are anonymous since the order of candidates on a ballot sheet is random. Tellers see only the position of the candidate. Voters can check…

Cryptography and Security · Computer Science 2020-11-26 Kirill A. Korinsky

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 have polynomial complexity and require…

Cryptography and Security · Computer Science 2008-06-12 Anne Broadbent , Alain Tapp

To keep a system secure, all devices in the system need to be benign. To avoid malicious and/or compromised devices, network access control such as authentication using a credential and remote attestation based on trusted hardware has been…

Cryptography and Security · Computer Science 2020-08-24 Takayuki Sasaki , Yusuke Shimada

The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity…

Quantum Physics · Physics 2007-05-23 Shahar Dolev , Itamar Pitowsky , Boaz Tamir

As computer vision is prevalently used for mail-in ballot processing and counting, it becomes a point of centralized trust in postal voting. We propose DVote, a prototype system of postal voting that provides decentralized trust in computer…

Cryptography and Security · Computer Science 2022-02-21 Peichen Xie , Zihan Zheng , Xian Zhang , Shuo Chen

Simplified verifiable re-encryption mix-net (SVRM) is revised and a scheme for e-voting systems is developed based on it. The developed scheme enables e-voting systems to satisfy all essential requirements of elections. Namely, they satisfy…

Cryptography and Security · Computer Science 2015-12-18 Shinsuke Tamura , Hazim A. Haddad , Nazmul Islam , Kazi Md. Rokibul Alam

The November 2014 Australian State of Victoria election was the first statutory political election worldwide at State level which deployed an end-to-end verifiable electronic voting system in polling places. This was the first time blind…

Cryptography and Security · Computer Science 2015-04-28 Craig Burton , Chris Culnane , Steve Schneider

This paper proposes a simple voting protocol based on quantum blockchain. Besides being simple, our voting protocol is anonymous, binding, non-reusable, verifiable, eligible, fair and self-tallying. Our protocol is also realizable by the…

Quantum Physics · Physics 2018-11-14 Xin Sun , Quanlong Wang , Piotr Kulicki

Traditional cryptography is under huge threat along of the evolution of quantum information and computing. In this paper, we propose a new post-quantum voting scheme based on physical laws by using encrypted no-key protocol to transmit…

Cryptography and Security · Computer Science 2018-06-01 Hua Dong , Li Yang

In this paper we explore a method to create anonymous services on top of the STORK framework, to be used for electronic surveys or elections. The STORK project aims to realize a single electronic identification and authentication area…

Cryptography and Security · Computer Science 2016-11-29 Alessandro Preziosi , Diana Berbecaru

Anonymous voting is a voting method of hiding the link between a vote and a voter, the context of which ranges from governmental elections to decision making in small groups like councils or companies. In this paper, we propose a quantum…

Quantum Physics · Physics 2021-08-03 Qingle Wang , Chaohua Yu , Fei Gao , Haoyu Qi , Qiaoyan Wen

We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully automatic, it can handle an unbounded number of sessions of the…

Cryptography and Security · Computer Science 2008-02-26 Bruno Blanchet

The Web Bulletin Board (WBB) is a key component of verifiable election systems. It is used in the context of election verification to publish evidence of voting and tallying that voters and officials can check, and where challenges can be…

Cryptography and Security · Computer Science 2014-01-17 Chris Culnane , Steve Schneider

The Pret a Voter cryptographic voting system was designed to be flexible and to offer voters a familiar and easy voting experience. In this paper we present a case study of our efforts to adapt Pret a Voter to the idiosyncrasies of…

Cryptography and Security · Computer Science 2015-09-22 Chris Culnane , Peter Y. A. Ryan , Steve Schneider , Vanessa Teague

We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous…

Cryptography and Security · Computer Science 2010-11-25 Anne Broadbent , Stacey Jeffery , Alain Tapp