Blar i Institutt for matematiske fag på tidsskrift "Lecture Notes in Computer Science"

Viser treff 1-7 av 7

    • A verifiable shuffle for the GSW cryptosystem 

      Strand, Martin (Journal article; Peer reviewed, 2019)
      This paper provides the first verifiable shuffle specifically for fully homomorphic schemes. A verifiable shuffle is a way to ensure that if a node receives and sends encrypted lists, the content will be the same, even ...

    • Attacks on the Basic cMix Design: On the Necessity of Commitments and Randomized Partial Checking 

      Galteland, Herman; Mjølsnes, Stig Frode; Olimid, Ruxandra-Florentina (Journal article; Peer reviewed, 2017)
      The cMix scheme was proposed by Chaum et al. in 2016 as the first practical set of cryptographic protocols that offer sender-recipient unlinkability at scale. The claim was that the cMix is secure unless all nodes collude. ...

    • Malware, Encryption, and Rerandomization - Everything is Under Attack 

      Galteland, Herman; Gjøsteen, Kristian (Journal article; Peer reviewed, 2017)
      A malware author constructing malware wishes to infect a specific location in the network. The author will then infect n initial nodes with n different variations of his malicious code. The malware continues to infect ...

    • Offline Assisted Group Key Exchange 

      Boyd, Colin Alexander; Davies, Gareth Thomas; Gjøsteen, Kristian; Jiang, Yao (Journal article; Peer reviewed, 2018)
      We design a group key exchange protocol with forward secrecy where most of the participants remain offline until they wish to compute the key. This is well suited to a cloud storage environment where users are often offline, ...

    • Practical and tightly-secure digital signatures and authenticated key exchange 

      Gjøsteen, Kristian; Jager, Tibor (Journal article; Peer reviewed, 2018)
      Tight security is increasingly gaining importance in real-world cryptography, as it allows to choose cryptographic parameters in a way that is supported by a security proof, without the need to sacrifice efficiency by ...

    • Security notions for cloud storage and deduplication 

      Boyd, Colin Alexander; Davies, Gareth Thomas; Gjøsteen, Kristian; Raddum, Håvard; Toorani, Mohsen (Journal article; Peer reviewed, 2018)
      Cloud storage is in widespread use by individuals and enterprises but introduces a wide array of attack vectors. A basic step for users is to encrypt their data, yet it is not obvious what security properties are required ...

    • Shape analysis on lie groups and homogeneous spaces 

      Celledoni, Elena; Eidnes, Sølve; Eslitzbichler, Markus; Schmeding, Alexander (Journal article, 2017)
      In this paper we are concerned with the approach to shape analysis based on the so called Square Root Velocity Transform (SRVT). We propose a generalisation of the SRVT from Euclidean spaces to shape spaces of curves on ...