Concept

Hardware-based full disk encryption

Publications associées (29)

Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance

A definition of online authenticated-encryption (OAE), call it OAE1, was given by Fleischmann, Forler, and Lucks (2012). It has become a popular definitional target because, despite allowing encryption to be online, security is supposed to be maintained ev ...

Springer2015

Private Eyes: Secure Remote Biometric Authentication

Bryan Alexander Ford

We propose an efficient remote biometric authentication protocol that gives strong protection to the user’s biometric data in case of two common kinds of security breaches: (1) loss or theft of the user’s token (smart card, handheld device, etc.), giving t ...

SciTePress2015

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption

Robert Granger, Philipp Svetolik Jovanovic

A popular approach to tweakable blockcipher design is via masking, where a certain primitive (a blockcipher or a permutation) is preceded and followed by an easy-to-compute tweak-dependent mask. In this work, we revisit the principle of masking. We do so a ...

2015

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We present two variants of OMD which are robust against nonce misuse. Security of OMD---a CAESAR candidate---relies on the assumption that implementations always ensure correct use of nonce (a.k.a. message number); namely that, the nonce never gets repeate ...

Springer-Verlag Berlin2014

OMD: A Compression Function Mode of Operation for Authenticated Encryption

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We propose the Offset Merkle-Damgård (OMD) scheme, a mode of operation to use a compression function for building a nonce-based authenticated encryption with associated data. In OMD, the parts responsible for privacy and authenticity are tightly coupled to ...

Springer International Publishing2014

A Related-Key Attack against Multiple Encryption based on Fixed Points

Serge Vaudenay, Atefeh Mashatan, Asli Bay

In order to alleviate the burden of short keys, encrypting a multiple times has been proposed. In the multiple encryption mode, there may be encryptions under the same or different keys. There have been several attacks against this encryption mode. When tr ...

Springer2011

Efficient Cache Attacks on AES, and Countermeasures

Dag Arne Osvik

We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache. This leakage reveals memory access patterns, which can be used for cryptanalysis of cryptographic primitives that employ data-depe ...

Springer Verlag2010

GossiCrypt: Wireless Sensor Network Data Confidentiality Against Parasitic Adversaries

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Jun Luo

Abstract—Resource and cost constraints remain a challenge for wireless sensor network security. In this paper, we propose a new approach to protect confidentiality against a parasitic adversary, which seeks to exploit sensor networks by obtaining measureme ...

2008

Dynamic power management for portable systems

Giovanni De Micheli, Luca Benini

Portable systems require long battery lifetime while still delivering high performance. Dynamic power management (DPM) policies trade off the performance for the power consumption at the system level in portable devices. In this work we present the time-in ...

2000

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search