Unité

Laboratoire de sécurité et de cryptographie

Laboratoire

Publications associées (856)

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

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

Cryptanalysis of chosen symmetric homomorphic schemes

Serge Vaudenay, Damian Vizár

Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryption has become a very popular topic. The main contribution of Gentry’s thesis was, that it has proven, that it actually is possible to design a fully homomorphic enc ...

2015

Making Masking Security Proofs Concrete - Or How to Evaluate the Security of any Leaking Device

Alexandre Raphaël Duc, Sebastian Faust

We investigate the relationships between theoretical studies of leaking cryptographic devices and concrete security evaluations with standard side-channel attacks. Our contributions are in four parts. First, we connect the formal analysis of the masking co ...

Springer2015

Boosting OMD for Almost Free Authentication of Associated Data

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We propose pure OMD (p-OMD) as a new variant of the Offset Merkle-Damgård (OMD) authenticated encryption scheme. Our new scheme inherits all desirable security features of OMD while having a more compact structure and providing higher efficiency. The origi ...

Springer2015

On the Analysis of Public-Key Cryptologic Algorithms

Andrea Miele

The RSA cryptosystem introduced in 1977 by Ron Rivest, Adi Shamir and Len Adleman is the most commonly deployed public-key cryptosystem. Elliptic curve cryptography (ECC) introduced in the mid 80's by Neal Koblitz and Victor Miller is becoming an increasin ...

EPFL2015

Automatic Application of Power Analysis Countermeasures

Paolo Ienne, Francesco Regazzoni, Philip Brisk, David Novo Bruna, Ali Galip Bayrak

We introduce a compiler that automatically inserts software countermeasures to protect cryptographic algorithms against power-based side-channel attacks. The compiler first estimates which instruction instances leak the most information through side-channe ...

Institute of Electrical and Electronics Engineers2015

Optimal Proximity Proofs

Serge Vaudenay

Provably secure distance-bounding is a rising subject, yet an unsettled one; indeed, very few distance-bounding protocols, with formal security proofs, have been proposed. In fact, so far only two protocols, namely SKI (by Boureanu et al.) and FO (by Fisch ...

Springer2015

Leakage-resilient non-malleable codes

Divesh Aggarwal

A recent trend in cryptography is to construct cryptosystems that are secure against physical attacks. Such attacks are usually divided into two classes: the \emph{leakage} attacks in which the adversary obtains some information about the internal state of ...

Springer2015

Efficient Recursive Diffusion Layers for Block Ciphers, and Hash Functions

Pouyan Sepehrdad

Many modern block ciphers use maximum distance separable (MDS) matrices as the main part of their diffusion layers. In this paper, we propose a very efficient new class of diffusion layers constructed from several rounds of Feistel-like structures whose ro ...

Springer2015

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

Ieee-Inst Electrical Electronics Engineers Inc2015