Concept

Preuve à divulgation nulle de connaissance

Publications associées (54)

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

Practical unconditionally secure two-channel message authentication

Atefeh Mashatan

We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. (Two-channel cryptography employs a broadband, insecure wireless channel and an authenticated, narrow-band manual channel at the sa ...

2010

A Message Recognition Protocol Based on Standard Assumptions

Serge Vaudenay, Atefeh Mashatan

We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the random oracle model or are based on non-standard assumptions. Incorporating ran ...

Springer2010

Improved Cryptanalysis of Skein

Willi Meier, Onur Özen, Jean-Philippe Aumasson

The hash function Skein is the submission of Ferguson et al. to the NIST Hash Competition, and is arguably a serious candidate for selection as SHA-3. This paper presents the first third-party analysis of Skein, with an extensive study of its main componen ...

Springer Berlin Heidelberg2009

Efficient Protocols for Set Membership and Range Proofs

Rafik Chaabouni

We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...

Springer2008

About Machine-Readable Travel Documents

Serge Vaudenay, Martin Vuagnoux, Jean Monnerat

Passports are now equipped with RFID chips that contain private information, biometric data, and a digital signature by issuing authorities. We review most of applicable security and privacy issues. We argue that the main privacy issue is not unauthorized ...

Springer2007

Dial C for Cipher

Thomas Baignères

We introduce C, a practical provably secure block cipher with a slow key schedule. C is based on the same structure as AES but uses independent random substitution boxes instead of a fixed one. Its key schedule is based on the Blum-Blum-Shub pseudo-random ...

Springer2007

Short 2-Move Undeniable Signatures

Serge Vaudenay, Jean Monnerat

Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication const ...

2006

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

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Marko Vukolic, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a security module. The security modules trust each other but can only communicate by exch ...

2005

Fair Exchange with Guardian Angels

Serge Vaudenay, Gildas Avoine

In this paper we propose a new probabilistic Fair Exchange Protocol which requires no central Trusted Third Party. Instead, it relies on a virtually distributed and decentralized Trusted Third Party which is formalized as a Guardian Angel: a kind of Observ ...

2003