Concept

Kerberos (protocole)

Publications associées (42)

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

Expected loss analysis of thresholded authentication protocols in noisy conditions

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting

n

rounds, with no error correction. This requires assigning an acceptable threshold for the number of de ...

2010

User-Aided Data Authentication

Sylvain Pasini

All classical authentication protocols are based on pre-shared authentic information such as long-term secret keys or a public key infrastructure. However, there are many practical settings, where participants can additionally employ authentic Out-Of-Band ...

2009

Interference-Resilient Information Exchange

Rachid Guerraoui, Seth Gilbert

This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C ava ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Secrecy for bounded security protocols with freshness check is NEXPTIME-complete

The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bounded protocols with freshness check is shown to be NEXPTIME-complete. Relating ...

2008

Securing Vehicular Ad Hoc Networks

Jean-Pierre Hubaux, Maxime Raya

Vehicular networks are very likely to be deployed in the coming years and thus become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat analysis and devise an appropriat ...

2007

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

Oscar: Small-world overlay for realistic key distributions

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

The research on P2P systems which support skewed key distributions has rapidly advanced in the recent years. Yet, the assumptions on the skews we are dealing with remained pretty simple: most of the existing literature assumes simple monotonous key distrib ...

2006

Reducing Time Complexity in RFID Systems

Gildas Avoine, Philippe Oechslin, Etienne Dysli

Radio frequency identification systems based on low-cost computing devices is the new plaything that every company would like to adopt. Its goal can be either to improve the productivity or to strengthen the security. Specific identification protocols base ...

2006

The security of VANETs

Jean-Pierre Hubaux, Maxime Raya

In this work, we address the security of VANETs. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some major design decisions still to be made, which in some cases have more than mere technical implica ...

2005

The Security of Vehicular Ad Hoc Networks

Jean-Pierre Hubaux, Maxime Raya

Vehicular networks are likely to become the most relevant form of mobile ad hoc networks. In this paper, we address the security of these networks. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some ...

2005

Expected loss analysis of thresholded authentication protocols in noisy conditions

Serge Vaudenay, Christos Dimitrakakis, Aikaterini Mitrokotsa

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting

n

rounds, with no error correction. This requires assigning an acceptable threshold for the number of de ...

2010