English
Related papers

Related papers: Natural Strategic Abilities in Voting Protocols

200 papers

Despite numerous countermeasures proposed by practitioners and researchers, remote control-flow alteration of programs with memory-safety vulnerabilities continues to be a realistic threat. Guaranteeing that complex software is completely…

Cryptography and Security · Computer Science 2017-02-20 Martín Ochoa , Sebastian Banescu , Cynthia Disenfeld , Gilles Barthe , Vijay Ganesh

The question of how people vote strategically under uncertainty has attracted much attention in several disciplines. Theoretical decision models have been proposed which vary in their assumptions on the sophistication of the voters and on…

Computer Science and Game Theory · Computer Science 2018-05-22 Roy Fairstein , Adam Lauz , Kobi Gal , Reshef Meir

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

Voting is the aggregation of individual preferences in order to select a winning alternative. Selection of a winner is accomplished via a voting rule, e.g., rank-order voting, majority rule, plurality rule, approval voting. Which voting…

Theoretical Economics · Economics 2020-05-18 Anne Carlstein

We study the computational complexity of strategic behaviour in primary elections. Unlike direct voting systems, primaries introduce a multi-stage process in which voters first influence intra-party nominees before a general election…

Computer Science and Game Theory · Computer Science 2026-02-12 Colin Cleveland , Bart de Keijzer , Maria Polukarov

We propose a protocol for verifiable remote voting with paper assurance. It is intended to augment existing postal voting procedures, allowing a ballot to be electronically constructed, printed on paper, then returned in the post. It allows…

Cryptography and Security · Computer Science 2021-11-10 Eleanor McMurtry , Xavier Boyen , Chris Culnane , Kristian Gjøsteen , Thomas Haines , Vanessa Teague

We investigate a model of sequential decision-making where a single alternative is chosen at each round. We focus on two objectives -- utilitarian welfare (Util) and egalitarian welfare (Egal) -- and consider the computational complexity of…

Computer Science and Game Theory · Computer Science 2024-12-23 Edith Elkind , Tzeh Yuan Neoh , Nicholas Teh

We propose an e-voting protocol that seems to allow citizens to verify that their vote has been accurately taken into account while preserving its secrecy, without requiring the use of a complex process. The main idea is to give each voter…

Computers and Society · Computer Science 2008-08-19 Frederic Connes

It is well known that no reasonable voting rule is strategyproof. Moreover, the common Plurality rule is particularly prone to strategic behavior of the voters and empirical studies show that people often vote strategically in practice.…

Computer Science and Game Theory · Computer Science 2014-04-22 Reshef Meir , Omer Lev , Jeffrey S. Rosenschein

Cryptographic protocols aim at securing communications over insecure networks such as the Internet, where dishonest users may listen to communications and interfere with them. A secure communication has a different meaning depending on the…

Cryptography and Security · Computer Science 2016-11-10 Stéphanie Delaune , Lucca Hirschi

We focus on the following natural question: is it possible to influence the outcome of a voting process through the strategic provision of information to voters who update their beliefs rationally? We investigate whether it is…

Computer Science and Game Theory · Computer Science 2019-09-24 Matteo Castiglioni , Andrea Celli , Nicola Gatti

Security protocols are used in many of our daily-life applications, and our privacy largely depends on their design. Formal verification techniques have proved their usefulness to analyse these protocols, but they become so complex that…

Cryptography and Security · Computer Science 2014-10-21 Myrto Arapinis , Vincent Cheval , Stéphanie Delaune

The increasing adoption of Reinforcement Learning in safety-critical systems domains such as autonomous vehicles, health, and aviation raises the need for ensuring their safety. Existing safety mechanisms such as adversarial training,…

Machine Learning · Computer Science 2021-11-11 Paulina Stevia Nouwou Mindom , Amin Nikanjam , Foutse Khomh , John Mullins

Online voting enables individuals to participate in elections remotely, offering greater efficiency and accessibility in both governmental and organizational settings. As this method gains popularity, ensuring the security of online voting…

Cryptography and Security · Computer Science 2025-09-22 Anastasiia Belousova , Francesco Marchiori , Mauro Conti

Security is critical for everything relying on modern digital systems. Because almost all digital interactions are governed by the Internet and cryptographic protocols, these protocols must serve as reliable mechanisms that guarantee core…

Cryptography and Security · Computer Science 2026-05-29 Leonard Tudorache , Ivan Kurtev , Mark van den Brand

Coercion resistance is an important and one of the most intricate security requirements of electronic voting protocols. Several definitions of coercion resistance have been proposed in the literature, including definitions based on symbolic…

Cryptography and Security · Computer Science 2016-11-18 Ralf Kuesters , Tomasz Truderung

The issues of both system security and safety can be dissected integrally from the perspective of behavioral \emph{appropriateness}. That is, a system is secure or safe can be judged by whether the behavior of certain agent(s) is…

Cryptography and Security · Computer Science 2024-03-26 Cheng Wang , Hao Tang , Hangyu Zhu , Junhan Zheng , Changjun Jiang

Election control considers the problem of an adversary who attempts to tamper with a voting process, in order to either ensure that their favored candidate wins (constructive control) or another candidate loses (destructive control). As…

Multiagent Systems · Computer Science 2017-11-27 Bryan Wilder , Yevgeniy Vorobeychik

Current electronic voting systems require an anonymous channel during the voting phase to prevent coercion. Typically, low-latency anonymization-networks like Tor are used for this purpose. In this paper we devise a monitoring attack that…

Cryptography and Security · Computer Science 2017-02-10 Christian Meter , Alexander Schneider , Philipp Hagemeister , Martin Mauve

People who are involved with political campaigns face increased digital security threats from well-funded, sophisticated attackers, especially nation-states. Improving political campaign security is a vital part of protecting democracy. To…

Computers and Society · Computer Science 2021-06-02 Sunny Consolvo , Patrick Gage Kelley , Tara Matthews , Kurt Thomas , Lee Dunn , Elie Bursztein