Blar i NTNU Open på forfatter "Gjøsteen, Kristian"

Viser treff 21-40 av 95

    • Cryptographically Private Linear Regression 

      Stornes, Ågot Marianne (Master thesis, 2021)
      Maskinlæring og stordatabehandling er viktige tema i den digitale verden, men her finnes det ufordringer med å holde dataene privat. I denne teksten skal vi se på hvordan en kan bruke homomorf kryptering for å holde både ...

    • Cryptography for Blockchains 

      Wu, Shuang (Doctoral theses at NTNU;2022:253, Doctoral thesis, 2022)

    • Cryptography for Innovative Blockchain Services 

      Raikwar, Mayank (Doctoral theses at NTNU;2022:241, Doctoral thesis, 2022)
      Since the advent of Bitcoin, scientific interest in its underlying core technology Blockchain has been thriving. Much work has been carried out for blockchain use cases in different industrial areas such as healthcare, ...

    • 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 ...

    • Definitions for Plaintext-Existence Hiding in Cloud Storage 

      Boyd, Colin Alexander; Davies, Gareth Thomas; Gjøsteen, Kristian; Raddum, Håvard; Toorani, Mohsen (ARES 2018;Article No. 41, Chapter, 2018)
      Cloud storage services use deduplication for saving bandwidth and storage. An adversary can exploit side-channel information in several attack scenarios when deduplication takes place at the client side, leaking information ...

    • Dilithium, a Quantum Safe Signature 

      Johansen, Katrine Fjose (Master thesis, 2021)
      Hovedformålet med denne oppgaven er å studere signatursystemet Dilithium, som ble foreslått til det amerikanske National Institute of Standards and Technology (NIST) sin “Post-Quantum Cryptography Standardization” prosess. ...

    • 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 ...

    • Fast and Secure Updatable Encryption 

      Boyd, Colin Alexander; Davies, Gareth Thomas; Gjøsteen, Kristian; Jiang, Yao (Peer reviewed; Journal article, 2020)
      Updatable encryption allows a client to outsource ciphertexts to some untrusted server and periodically rotate the encryption key. The server can update ciphertexts from an old key to a new key with the help of an update ...

    • 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.

    • From Lattice Crypto to Lættis Krypto: Various Approaches to Post-Quantum Key Exchange 

      de Kock, Bastiaan Borgert (Doctoral theses at NTNU;2023:201, Doctoral thesis, 2023)
      Key exchange is a cryptographic mechanism: it enables two or more parties to agree upon a shared key that is known only to them, even in the presence of an adversary that has access to all communication between the parties. ...

    • Fully Homomorphic Encryption 

      Galteland, Herman (Master thesis, 2015)
      I 2009 presenterte Craig Gentry det første krypteringssystemet som klarte å utføre vilkårlig mange homomorfe operasjoner, og i prosessen lagde han også en framgangsmåte på hvordan man konstruerer et slikt system. I denne ...

    • 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 ...

    • Fully homomorphic encryption with applications to electronic voting 

      Strand, Martin (Doctoral theses at NTNU;2018:33, Doctoral thesis, 2018)

    • 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. ...

    • Hash Proof Based Encryption Schemes in EasyCrypt 

      Solberg, Morten Rotvold (Master thesis, 2018)
      We describe the basics of the proof-assistant \EasyCrypt{} and explain how to use \EasyCrypt{} to model encryption schemes and game-based security proofs. Furthermore, we analyze a generic encryption scheme by Cramer and ...

    • Highly Efficient Key Exchange Protocols with Optimal Tightness 

      Cohn-Gordon, Katriel; Cremers, Cas; Gjøsteen, Kristian; Jacobsen, Håkon; Jager, Tibor (Journal article; Peer reviewed, 2019)
      In this paper we give nearly tight reductions for modern implicitly authenticated Diffie-Hellman protocols in the style of the Signal and Noise protocols, which are extremely simple and efficient. Unlike previous approaches, ...

    • Identity Protection, Secrecy and Authentication in Protocols with compromised Agents 

      Båtstrand, Anders Lindholm (Master thesis, 2009)
      The design of security protocols is given an increasing level of academic interest, as an increasing number of important tasks are done over the Internet. Among the fields being researched is formal methods for modeling ...

    • Implementation of the Number Theoretic Transform 

      Bakkebø, Anna (Master thesis, 2020)
      I denne oppgaven skriver vi om implementering av Number Theoretic Transform, NTT. NTT er en algoritme for å multiplisere polynomer kjappere. I denne oppgaven ser vi på hvordan NTT fungerer, og hvorvidt denne faktisk ...