• 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 ...
    • Efficient Mixing of Arbitrary Ballots with Everlasting Privacy: How to Verifiably Mix the PPATC Scheme 

      Gjøsteen, Kristian; Haines, Thomas Edmund; Solberg, Morten Rotvold (Peer reviewed; Journal article, 2021)
      The long term privacy of voting systems is of increasing concern as quantum computers come closer to reality. Everlasting privacy schemes offer the best way to manage these risks at present. While homomorphic tallying ...
    • 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 ...
    • Revisiting Practical and Usable Coercion-Resistant Remote E-Voting 

      Estaji, Ehsan; Haines, Thomas Edmund; Gjøsteen, Kristian; Ryan, Peter Y. A. (Peer reviewed; Journal article, 2020)
      In this paper we revisit the seminal coercion-resistant e-voting protocol by Juels, Catalano and Jakobsson (JCJ) and in particular the attempts to make it usable and practical. In JCJ the user needs to handle cryptographic ...
    • Short Paper: An Update on Marked Mix-Nets: An Attack, a Fix and PQ Possibilities 

      Haines, Thomas Edmund; Pereira, Olivier (Peer reviewed; Journal article, 2020)
      Marked mix-nets were introduced by Pereira and Rivest as a mechanism to allow very efficient mixing that ensures privacy but at the cost of not guaranteeing integrity. This is useful in a number of e-voting schemes such ...
    • SoK: Techniques for Verifiable Mix Nets 

      Haines, Thomas Edmund; Müller, Johannes (Peer reviewed; Journal article, 2020)
      Since David Chaum introduced the idea of mix nets 40 years ago, they have become widely used building blocks for privacy-preserving protocols. Several important applications, such as secure e-voting, require that the ...
    • 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 Decryption in the Head 

      Gjøsteen, Kristian; Haines, Thomas Edmund; Müller, Johannes; Rønne, Peter B.; Silde, Tjerand (Peer reviewed; Journal article, 2022)
      In this work we present a new approach to verifiable decryption which converts a 2-party passively secure distributed decryption protocol into a 1-party proof of correct decryption. This leads to an efficient and simple ...
    • 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 ...
    • Vote Selling Resistant Voting 

      Boyd, Colin Alexander; Haines, Thomas Edmund; Rønne, Peter (Peer reviewed; Journal article, 2020)
      Creating a secure (purely) remote voting scheme which prevents active vote selling is an open problem. Observing that vote selling has a primarily economic motivation, we propose a novel approach to the problem which ...