Secrecy and independence for election schemes

No abstract is available for this paper.

• Publication year

  2015

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Computer Science, Economics

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction to Modern Cryptography

  2020cited by this paper
• Machine-Checked Proofs of Privacy for Electronic Voting Protocols

  2017cited by this paper
• A short introduction to secrecy and verifiability for elections

  2017cited by this paper
• Automated reasoning for equivalences in the applied pi calculus with barriers

  2016cited by this paper
• The cloudier side of cryptographic end-to-end verifiable voting: a security analysis of Helios

  2016cited by this paper
• BeleniosRF: A Non-interactive Receipt-Free Electronic Voting Scheme

  2016cited by this paper
• An attack against the Helios election system that violates eligibility

  2016cited by this paper
• Internet Voting with Helios ∗

  2016cited by this paper
• Constructing secret, verifiable auction schemes from election schemes

  2015cited by this paper
• NM-CPA Secure Encryption with Proofs of Plaintext Knowledge

  2015cited by this paper
• SoK: A Comprehensive Analysis of Game-Based Ballot Privacy Definitions

  2015cited by this paper
• Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ

  2015cited by this paper
• End-to-End Verifiable Elections in the Standard Model

  2015cited by this paper
• Ballot secrecy and ballot independence: definitions and relations

  2014cited by this paper
• Zero-knowledge proofs in theory and practice

  2014cited by this paper
• Hawk and Aucitas: e-Auction Schemes from the Helios and Civitas e-Voting Schemes

  2014cited by this paper
• Security Analysis of the Estonian Internet Voting System

  2014cited by this paper
• Ballot secrecy with malicious bulletin boards

  2014cited by this paper
• Truncating TLS Connections to Violate Beliefs in Web Applications

  2013cited by this paper
• Translating between equational theories for automated reasoning

  2013cited by this paper
• Ballot Secrecy and Ballot Independence Coincide

  2013cited by this paper
• Distributed ElGamal à la Pedersen: Application to Helios

  2013cited by this paper
• A generic construction for voting correctness at minimum cost - Application to Helios

  2013cited by this paper
• Cryptographic Voting - A Gentle Introduction

  2013cited by this paper
• A Fair and Robust Voting System by Broadcast

  2012cited by this paper
• Reduction of Equational Theories for Verification of Trace Equivalence: Re-encryption, Associativity and Commutativity

  2012cited by this paper
• Verification of security protocols with lists: From length one to unbounded length

  2012cited by this paper
• Attacking the Washington, D.C. Internet Voting System

  2012cited by this paper
• Applying Divertibility to Blind Ballot Copying in the Helios Internet Voting System

  2012cited by this paper
• How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios

  2012cited by this paper
• On Necessary and Sufficient Conditions for Private Ballot Submission

  2012cited by this paper
• Replay attacks that violate ballot secrecy in Helios

  2012cited by this paper
• A note on replay attacks that violate privacy in electronic voting schemes

  2011cited by this paper
• Formal verification of cryptographic protocols with automated reasoning

  2011cited by this paper
• Formal Analysis of Protocols Based on TPM State Registers

  2011cited by this paper
• Running Mixnet-Based Elections with Helios

  2011cited by this paper
• Adapting Helios for Provable Ballot Privacy

  2011cited by this paper
• Attacking and fixing Helios: An analysis of ballot secrecy

  2011cited by this paper
• A game-based definition of coercion resistance and its applications

  2010cited by this paper
• Receipt-Free K-out-of-L Voting Based on ElGamal Encryption

  2010cited by this paper
• Sigma Protocols and Efficient Zero-Knowledge1

  2010cited by this paper
• Security analysis of India's electronic voting machines

  2010cited by this paper
• Electronic Elections

  2010cited by this paper
• A generalization of Paillier’s public-key system with applications to electronic voting

  2010cited by this paper
• Universally Composable Incoercibility

  2010cited by this paper
• Anonymous voting by two-round public discussion

  2010cited by this paper
• Electing a University President Using Open-Audit Voting: Analysis of Real-World Use of Helios

  2009cited by this paper
• Verifying privacy-type properties of electronic voting protocols

  2009cited by this paper
• Coercion Resistant End-to-end Voting

  2009cited by this paper
• Simplified Submission of Inputs to Protocols

  2008cited by this paper
• Automatic Verification of Privacy Properties in the Applied pi Calculus

  2008cited by this paper
• Helios: Web-based Open-Audit Voting

  2008cited by this paper
• Studying the Nedap/Groenendaal ES3B Voting Computer: A Computer Security Perspective

  2007cited by this paper
• The Australian ballot: Not the secret ballot

  2006cited by this paper
• Ballot Casting Assurance

  2006cited by this paper
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures

  2006cited by this paper
• Receipt-Free Universally-Verifiable Voting with Everlasting Privacy

  2006cited by this paper
• Electronic Voting: Starting Over?

  2005cited by this paper
• Coercion-resistant electronic elections

  2005cited by this paper
• Efficient Maximal Privacy in Boardroom Voting and Anonymous Broadcast

  2004cited by this paper
• Electronic jury voting protocols

  2002cited by this paper
• Arithmetic, first-order logic, and counting quantifiers

  2002cited by this paper
• Self-tallying Elections and Perfect Ballot Secrecy

  2002cited by this paper
• A Protocol to Achieve Independence in Constant Rounds

  2000cited by this paper
• Efficient Receipt-Free Voting Based on Homomorphic Encryption

  2000cited by this paper
• Nonmalleable Cryptography

  2000cited by this paper
• A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic

  1999cited by this paper
• Non-malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization

  1999cited by this paper
• Relations among Notions of Security for Public-Key Encryption Schemes

  1998cited by this paper
• On the Security of ElGamal Based Encryption

  1998cited by this paper
• A secure and optimally efficient multi-authority election scheme

  1997cited by this paper
• A concrete security treatment of symmetric encryption

  1997cited by this paper
• Multi-Autority Secret-Ballot Elections with Linear Work

  1996cited by this paper
• Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme

  1996cited by this paper
• Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth

  1995cited by this paper
• Achieving independence efficiently and securely

  1995cited by this paper
• Receipt-free secret-ballot elections (extended abstract)

  1994cited by this paper
• Secure Voting Using Partially Compatible Homomorphisms

  1994cited by this paper
• Breaking Efficient Anonymous Channel

  1994cited by this paper
• Random oracles are practical: a paradigm for designing efficient protocols

  1993cited by this paper
• Wallet Databases with Observers

  1992cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• How to Break the Direct RSA-Implementation of Mixes

  1990cited by this paper
• Verifiable secret-ballot elections

  1987cited by this paper
• Achieving independence in logarithmic number of rounds

  1987cited by this paper
• AMERICAN CONVENTION ON HUMAN RIGHTS

  1986cited by this paper
• Distributing the power of a government to enhance the privacy of voters

  1986cited by this paper
• How to Prove Yourself: Practical Solutions to Identification and Signature Problems

  1986cited by this paper
• Demonstrating Possession of a Discrete Logarithm Without Revealing It

  1986cited by this paper
• Verifiable secret sharing and achieving simultaneity in the presence of faults

  1985cited by this paper
• A robust and verifiable cryptographically secure election scheme

  1985cited by this paper
• Untraceable electronic mail, return addresses, and digital pseudonyms

  1981cited by this paper

• Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios

  2021cites this paper
• Secret, verifiable auctions from elections

  2018cites this paper
• A short introduction to secrecy and verifiability for elections

  2017cites this paper
• Exploiting re-voting in the Helios election system

  2016cites this paper
• An attack against the Helios election system that violates eligibility

  2016cites this paper
• An attack against the Helios election system that exploits re-voting

  2016cites this paper
• Election Verifiability: Cryptographic Definitions and an Analysis of Helios and JCJ

  2015influential citation
• Constructing secret, verifiable auction schemes from election schemes

  2015cites this paper