Recherche

Afficher tous les résultats pour

Accueil

Personne

Serge Vaudenay

Cette personne a quitté l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (151)

Page 4 sur 8

On Selecting the Nonce Length in Distance-Bounding Protocols

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

Oxford University Press2013

Discovery and Exploitation of New Biases in RC4

Serge Vaudenay, Pouyan Sepehrdad, Martin Vuagnoux

In this paper, we present several weaknesses in the stream cipher RC4. First, we present a technique to automatically reveal linear correlations in the PRGA of RC4. With this method, 48 new exploitable correlations have been discovered. Then we bind these ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

About Machine-Readable Travel Documents

Serge Vaudenay, Martin Vuagnoux

Passports are documents that help immigration officers to identify people. In order to strongly authenticate their data and to automatically identify people, they are now equipped with RFID chips. These contain private information, biometrics, and a digita ...

Springer2007

Primeless Modular Cryptography (Extended Abstract)

Serge Vaudenay, Sonia Mihaela Bogos, Ioana Cristina Carlson

Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off proce ...

2012

HELEN: A Public-Key Cryptosystem Based on the LPN and the Decisional Minimal Distance Problems

Serge Vaudenay, Alexandre Raphaël Duc

We propose HELEN, a code-based public-key cryptosystem whose security is based on the hardness of the Learning from Parity with Noise problem (LPN) and the decisional minimum distance problem. We show that the resulting cryptosystem achieves indistinguisha ...

Springer2013

Security-Preserving Asymmetric Protocol Encapsulation

Serge Vaudenay

Query-response based protocols between a client and a server such as SSL, TLS, SSH are asymmetric in the sense that the querying client and the responding server play different roles, and for which there is a need for two-way linkability between queries an ...

Springer-Verlag2007

On Privacy Models for RFID

Serge Vaudenay

We provide a formal model for identification schemes. Under this model, we give strong definitions for security and privacy. Our model captures the notion of a powerful adversary who can monitor all communications, trace tags within a limited period of tim ...

Springer-Verlag2007

Beyond Security and Efficiency: On-Demand Ratcheting with Security Awareness

Serge Vaudenay, Andrea Felice Caforio, Fatma Betül Durak

Secure asynchronous two-party communication applies ratcheting to strengthen privacy, in the presence of internal state exposures. Security with ratcheting is provided in two forms: forward security and post-compromise security. There have been several suc ...

2021

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018

Linear Cryptanalysis of Non Binary Ciphers (with an application to SAFER)

Serge Vaudenay, Thomas Baignères

In this paper we re-visit distinguishing attacks. We show how to generalize the notion of linear distinguisher to arbitrary sets. Our thesis is that our generalization is the most natural one. We compare it with the one by Granboulan et al. from FSE'06 by ...

Springer2007

On Modeling Terrorist Frauds

Serge Vaudenay

Quite recently, distance-bounding protocols received a lot of attention as they offer a good solution to thwart relay attacks. Their security models at still unstable, especially when considering terrorist fraud. This considers the case where a malicious p ...

Springer2013

An Optimal Non-Interactive Message Authentication Protocol

Serge Vaudenay, Sylvain Pasini

Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SAS-based non-interactive message authentication protocols (NIMAP). We start by the analysis of two popular non- ...

Springer2006

Cryptanalysis of LowMC instances using single plaintext/ciphertext pair

Serge Vaudenay, Subhadeep Banik, Fatma Betül Durak, Khashayar Barooti

Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned with ...

2020

Efficient Deniable Authentication for Signatures, Application to Machine-Readable Travel Document

Serge Vaudenay, Jean Monnerat, Sylvain Pasini

Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicious verifier to transfer the proof to anyone else. It is for instance the cas ...

Springer Berlin / Heidelberg2009

Making Classical (Threshold) Signatures Post-quantum for Single Use on a Public Ledger

Serge Vaudenay, Laurane Chloé Angélina Marco, Abdullah Talayhan

The Bitcoin architecture heavily relies on the ECDSA signature scheme which is broken by quantum adversaries as the secret key can be computed from the public key in quantum polynomial time. To mitigate this attack, bitcoins can be paid to the hash of a pu ...

2023

Chaum's Designated Confirmer Signature Revisited

Serge Vaudenay, Jean Monnerat

This article revisits the original designated confirmer signature scheme of Chaum. Following the same spirit we naturally extend the Chaum's construction in a more general setting and analyze its security in a formal way. We prove its security in the rando ...

2005

Solving the Learning Parity with Noise Problem Using Quantum Algorithms

Serge Vaudenay, Bénédikt Minh Dang Tran

The Learning Parity with Noise (LPN) problem is a famous cryptographic problem consisting in recovering a secret from noised samples. This problem is usually solved via reduction techniques, that is, one reduces the original instance to a smaller one befor ...

Springer2022

Compact and Efficient UC Commitments under Atomic-Exchanges

Serge Vaudenay

We devise a multiple (concurrent) commitment scheme operating on large messages. It uses an ideal global setup functionality in a minimalistic way. The commitment phase is non-interactive. It is presented in a modular way so that the internal building bloc ...

2014

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

Method and apparatus for wireless validation

Serge Vaudenay, Handan Kilinç Alper

A wireless validation method between an first apparatus and a second apparatus comprising the following steps of communicating between the first apparatus and the second apparatus for agreeing in a protected way on a common symmetric key and performing a s ...

2017