• A Framework for Describing and Analyzing Anonymity Networks 

      Mestl, Elsie Margrethe Staff (Master thesis, 2019)
      Oppgaven introduserer et rammeverk som tillater en idealisering av anonymitetesnettverk og netverksimulering. En hovedfordel med dette rammeverket er at anonyitetskarakterestikker kan bli definert for en spesifik ...
    • A Roadmap to Fully Homomorphic Elections: Stronger Security, Better Verifiability 

      Gjøsteen, Kristian; Strand, Martin (Chapter, 2017)
      After the trials of remote internet voting for local elections in 2011 and parliamentary elections in 2013, a number of local referendums has renewed interest in internet voting in Norway. The voting scheme used in ...
    • A Security Analysis of the Helios Voting Protocol and Application to the Norwegian County Election 

      Salamonsen, Kristine (Master thesis, 2014)
      We present Helios, an end-to-end verifiable internet voting system. We describe the existing protocol, the encryption and decryption process with corresponding proofs, and analyse an attack against ballot secrecy. Further ...
    • A Thousand Variations of Prêt à Voter 

      Goodwin, Sam (Master thesis, 2019)
      This thesis is about the cryptographic voting protocol Prêt à Voter. This is a protocol that has been used in elections and could be applied to more in the future, whether it be electronic or traditional elections. Some ...
    • An Analysis of a Cryptographic Communication Protocol 

      Strand, Maria (Master thesis, 2010)
      We have considered a cryptographic communication protocol and given a proof for its security.
    • Analysis of the Transport Layer Security protocol 

      Firing, Tia Helene (Master thesis, 2010)
      In this master thesis we have presented a security analysis of the TLS protocol with particular emphasis on the recently discovered renegotiation attack. From our security proof we get that the Handshake protocol with ...
    • Anonymity for Decentralized Electronic Cash Systems 

      Dahle, Siri (Master thesis, 2018)
      In 2008 Bitcoin was introduced as the first decentralized electronic cash system and it has seen widespread adoption since it became fully functional in 2009. This thesis describe the Bitcoin system, anonymity aspects for ...
    • Anonymity in Network Connections for Mobile Communication 

      Henriksen, Ragne Elisabeth (Master thesis, 2012)
      This thesis summarizes an existing protocol, that we have chosen to call the Token Key Agreement protocol. It then goes on to introduce two new protocols we have chosen to name the Symmetric Key Agreement protocol and the ...
    • Applications of Paillier s Cryptosystem. 

      Pettersen, Nina (Master thesis, 2016)
      Applications of Paillier s crypto system to electronic voting.
    • Bilinear Pairings in Cryptography 

      Thuen, Øystein (Doctoral Theses at NTNU, 1503-8181; 2011:143, Doctoral thesis, 2011)
    • Bilinear Pairings on Elliptic Curves 

      Høvik, Jenny Kvamme (Master thesis, 2019)
      I denne oppgåva studerer vi bilineære parringer på elliptiske kurver. Først gir vi ein introduksjon til algebraisk geometri og spesielt omgrepet divisorar. Vidare ser vi på elliptiske kurver og deira aritmetikk. Vi ser på ...
    • 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. ...
    • Constructing elliptic curves over finite fields using complex multiplication 

      Thuen, Øystein Øvreås (Master thesis, 2006)
      We study and improve the CM-method for the creation of elliptic curves with specified group order over finite fields. We include a thorough review of the mathematical theory needed to understand this method. The ability ...
    • Counting Points on Elliptic Curves 

      Birkedal, Ole Andre Blom (Master thesis, 2010)
      In this paper we present the first efficient point counting algorithm due to Schoof, before giving a significant improvement due to Elkies. In the final section I give Satoh's algorithm which is even faster and has paved ...
    • Cryptographic Analysis of Voting Systems 

      Solstad, Olav Dahl (Master thesis, 2013)
      Coercion-resistance is defined and used to analyze/discuss the voting systems Civitas and the Norwegian Voting Protocol. Pret a Voter is described both in a real and an ideal case, and analysis of these cases regarding ...
    • Decoding of Algebraic Geometry Codes 

      Slaatsveen, Anna Aarstrand (Master thesis, 2011)
      Codes derived from algebraic curves are called algebraic geometry (AG) codes. They provide a way to correct errors which occur during transmission of information. This paper will concentrate on the decoding of algebraic ...
    • Finding Points on Elliptic Curves Modulo Composites 

      Karlsen, Jon Auklend (Master thesis, 2010)
      We consider the problem of finding points on elliptic curves over the ring of integers modulo an RSA modulus. Finding points on this curve seems to be hard, and we attack the problem from three different points of view.
    • Finding Small Roots of Polynomial Equations Using Lattice Basis Reduction 

      Sletta, Ingeborg (Master thesis, 2009)
      Using the LLL-algorithm to find small roots of polynomial equations using lattice basis reduction.
    • Formal verification of the Norwegian Internet Voting Protocol 

      Slågedal, Solvei (Master thesis, 2018)
      In this paper we look at the formalization and verification of several security components of the cryptosystem underlying The Norwegian Internet Voting Protocol. The focus will be on vote submission and B-Integrity.
    • Fully Homomorphic Encryption 

      Sperre, Harald Elias Bjerke (Master thesis, 2017)
      In this paper we consider fully homomorphic encryption based on the learning with errors problem. We present the problem as introduced by Oded Regev in 2009 and explain a simple public key cryptosystem based on it. We show ...