• A Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networks 

      Gjøsteen, Kristian; Gritti, Clementine Jeanne Pierrette; Boyd, Colin Alexander; Haines, Thomas Edmund (Peer reviewed; Journal article, 2019)
      A Blind Coupon Mechanism (BCM) allows spreading of alerts quietly and quickly over unreliable networks. The BCM primitive ensures that alerts are efficiently broadcast while the nature of these signals are securely hidden. ...
    • Cronus: Everlasting Privacy with Audit and Cast 

      Haines, Thomas Edmund (Journal article; Peer reviewed, 2019)
      We present a new online voting scheme with everlasting privacy and cast-as-intended verifiability. We follow the so called “audit-and-cast” paradigm where the voter audits the ballot before casting it. To mitigate the ...
    • How not to prove your election outcome 

      Haines, Thomas Edmund; Lewis, Sarah Jamie; Teague, Vanessa (Peer reviewed; Journal article, 2020)
      The Scytl/SwissPost e-voting solution was intended to provide complete verifiability for Swiss government elections. We show failures in both individual verifiability and universal verifiability (as defined in Swiss Federal ...
    • Improvements in Everlasting Privacy: Efficient and Secure Zero Knowledge Proofs 

      Haines, Thomas Edmund; Gritti, Clementine Jeanne Pierrette (Journal article; Peer reviewed, 2019)
      Verifiable electronic voting promises to ensure the correctness of elections even in the presence of a corrupt authority, while providing strong privacy guarantees. However, few practical systems with end-to-end verifiability ...
    • A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing 

      Boyen, Xavier; Haines, Thomas Edmund; Müller, Johannes (Peer reviewed; Journal article, 2020)
      Mix nets are often used to provide privacy in modern security protocols, through shuffling. Some of the most important applications, such as secure electronic voting, require mix nets that are verifiable. In the literature, ...
    • Verifiable Homomorphic Tallying for the Schulze Vote Counting Scheme 

      Haines, Thomas Edmund; Pattinson, Dirk; Tiwari, Mukesh (Peer reviewed; Journal article, 2019)
      The encryption of ballots is crucial to maintaining integrity and anonymity in electronic voting schemes. It enables, amongst other things, each voter to verify that their encrypted ballot has been recorded as cast, by ...
    • Verified Verifiers for Verifying Elections 

      Haines, Thomas Edmund; Gore, Rajeev; Tiwari, Mukesh (Journal article; Peer reviewed, 2019)
      The security and trustworthiness of elections is critical to democracy; alas, securing elections is notoriously hard. Powerful cryptographic techniques for verifying the integrity of electronic voting have been developed ...