Achieving independence efficiently and securely

No abstract is available for this paper.

• Publication year

  1995

• Venue

  ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

• Publication date

  1995-08-20

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/224964.224979
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Secure Voting Using Partially Compatible Homomorphisms

  1994cited by this paper
• Verifiable Secret Sharing as Secure Computation

  1994cited by this paper
• Non-malleable cryptography

  1991cited by this paper
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

  1991cited by this paper
• Noninteractive Zero-Knowledge

  1990cited by this paper
• Multiple non-interactive zero knowledge proofs based on a single random string

  1990cited by this paper
• Randomization in Byzantine Agreement

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

  1987cited 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
• How to share a secret

  1979cited by this paper

• DeVoS: Deniable Yet Verifiable Vote Updating

  2024cites this paper
• Breaking and Fixing Vote Privacy of the Estonian E-Voting Protocol IVXV

  2022cites this paper
• Traceable Receipt-Free Encryption

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

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

  2019cites this paper
• Selene: Voting with Transparent Verifiability and Coercion-Mitigation

  2016cites this paper
• Secrecy and independence for election schemes

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

  2014cites this paper
• A generic construction for voting correctness at minimum cost - Application to Helios

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

  2013cites this paper
• Ballot Secrecy and Ballot Independence Coincide

  2013cites this paper
• Replay attacks that violate ballot secrecy in Helios

  2012cites this paper
• Broadcast and Verifiable Secret Sharing: New Security Models and Round Optimal Constructions

  2012cites this paper
• Attacking and fixing Helios: An analysis of ballot secrecy

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

  2011cites this paper
• Democracy Enhancing Technologies: Toward deployable and incoercible E2E elections

  2011cites this paper
• Adapting Helios for Provable Ballot Privacy

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

  2011cites this paper
• Generalized corruption models in secure multi-party computation

  2010cites this paper
• Adaptively Secure Broadcast

  2010cites this paper
• A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting

  2008cites this paper
• Advances in cryptographic voting systems

  2006cites this paper
• Simultaneous broadcast revisited

  2005cites this paper
• Verifiable Mixing (Shuffling) of ElGamal Pairs

  2004cites this paper
• New tools in cryptography: mutually independent commitments, tweakable block ciphers, and plaintext awareness via key registration

  2004cites this paper
• Round Efficiency of Multi-party Computation with a Dishonest Majority

  2003cites this paper
• On 2-Round Secure Multiparty Computation

  2002cites this paper
• Electronic jury voting protocols

  2002cites this paper
• A verifiable secret shuffle and its application to e-voting

  2001cites this paper
• Mutually Independent Commitments

  2001cites this paper
• A Secure and Optimally Efficient Multi-Authority Election Scheme ( 1 )

  2000cites this paper
• Analysis and Design of E-voting Protocol

  2000cites this paper
• Non-interactive and non-malleable commitment

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

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

  1996cites this paper
• Multi-Autority Secret-Ballot Elections with Linear Work.

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

  1995cites this paper