• Lattice-Based Proof of Shuffle and Applications to Electronic Voting 

      Aranha, Diego F.; Baum, Carsten; Gjøsteen, Kristian; Silde, Tjerand; Tunge, Thor (Peer reviewed; Journal article, 2021)
      A verifiable shuffle of known values is a method for proving that a collection of commitments opens to a given collection of known messages, without revealing a correspondence between commitments and messages. We propose ...
    • Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions 

      Aranha, Diego F.; Baum, Carsten; Gjøsteen, Kristian; Silde, Tjerand Aga (Journal article; Peer reviewed, 2023)
      Cryptographic voting protocols have recently seen much interest from practitioners due to their (planned) use in countries such as Estonia, Switzerland, France, and Australia. Practical protocols usually rely on tested ...