Ballot Secrecy and Ballot Independence Coincide

No abstract is available for this paper.

• Publication year

  2013

• Venue

  European Symposium on Research in Computer Security

• Publication date

  2013-09-09

• Fields of study

  Computer Science, Political Science

• Identifiers
  DOI 10.1007/978-3-642-40203-6_26
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for 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
• Malleable Proof Systems and Applications

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

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

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

  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
• Verifying privacy-type properties of electronic voting protocols

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

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

  2008cited by this paper
• Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus

  2008cited by this paper
• Coercion-resistance and receipt-freeness in electronic voting

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

  2005cited by this paper
• Electronic jury voting protocols

  2002cited by this paper
• Nonmalleable Cryptography

  2000cited 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
• Achieving independence efficiently and securely

  1995cited by this paper
• Wallet Databases with Observers

  1992cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• A Threshold Cryptosystem without a Trusted Party (Extended Abstract)

  1991cited by this paper
• Public-key cryptosystems provably secure against chosen ciphertext attacks

  1990cited by this paper
• Efficient Identification and Signatures for Smart Cards (Abstract)

  1989cited by this paper
• An Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations

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

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

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

  1985cited by this paper

• End-to-end verifiable cumulative voting without tallying authorities

  2022cites this paper
• Cast-as-Intended: A Formal Definition and Case Studies

  2021cites this paper
• Analysis of the traditional voting system and transition to the online voting system in the republic of Iraq

  2021cites this paper
• Ballot secrecy: Security definition, sufficient conditions, and analysis of Helios

  2021cites this paper
• Protecting the Privacy of Voters: New Definitions of Ballot Secrecy for E-Voting

  2020cites this paper
• Private Votes on Untrusted Platforms: Models, Attacks and Provable Scheme

  2019cites this paper
• Non-malleable encryption with proofs of plaintext knowledge and applications to voting

  2019cites this paper
• E2E Verifiable Electronic Voting System for Shareholders

  2019cites this paper
• Secret, verifiable auctions from elections

  2018cites this paper
• A foundation for secret, verifiable elections

  2018cites this paper
• Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker

  2018cites this paper
• Authentication with weaker trust assumptions for voting systems

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

  2017cites this paper
• Extending the Helios internet voting scheme towards new election settings

  2017cites this paper
• Zero knowledge protocols and applications

  2017cites this paper
• VOTOR: conceptually simple remote voting against tiny tyrants

  2016cites this paper
• Secrecy and independence for election schemes

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

  2015cites this paper
• Constructing secret, verifiable auction schemes from election schemes

  2015cites this paper
• Efficiency Evaluation of Cryptographic Protocols for Boardroom Voting

  2015cites this paper
• Computational Election Verifiability: Definitions and an Analysis of Helios and JCJ

  2015cites this paper
• Formal verification of e-voting: solutions and challenges

  2015cites this paper
• Advances in Information and Computer Security

  2015influential citation
• NM-CPA Secure Encryption with Proofs of Plaintext Knowledge

  2015cites this paper
• Ballot secrecy with malicious bulletin boards

  2014cites this paper
• Ballot secrecy and ballot independence: definitions and relations

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

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

  2014influential citation
• Electronic voting with fully distributed trust and maximized flexibility regarding ballot design

  2014cites this paper
• Formal Verification of Voting and Auction Protocols : From Privacy to Fairness and Verifiability

  2013cites this paper
• Cryptographic Voting - A Gentle Introduction

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

  2013cites this paper
• E-Voting Mobile Application System

  year unknowncites this paper