• Hardness of Lattice Based Cryptography 

      Tunge, Thor (Master thesis, 2018)
      In this thesis we will discuss hard computational problems in lattice theory and relate them to cryptographic constructions. Many of these problems enjoy average-case hardness which makes them attractive for cryptography. ...
    • 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 ...