Publications de Aikaterini Mitrokotsa

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.

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

Aikaterini Mitrokotsa

Graph Chatbot

Chattez avec Graph Search

On Selecting the Nonce Length in Distance-Bounding Protocols

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols

Evaluation of classification algorithms for intrusion detection in MANETs

Expected loss bounds for authentication in constrained channels

Mafia Fraud Attack against the RC Distance-Bounding Protocol

A Note on a Privacy-Preserving Distance-Bounding Protocol

Expected loss analysis of thresholded authentication protocols in noisy conditions

Statistical Decision Making for Authentication and Intrusion Detection

Evaluation of classification algorithms for intrusion detection in MANETs

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Expected loss analysis of thresholded authentication protocols in noisy conditions

Mafia Fraud Attack against the RC Distance-Bounding Protocol

Statistical Decision Making for Authentication and Intrusion Detection

On the Pseudorandom Function Assumption in (Secure) Distance-Bounding Protocols

Expected loss bounds for authentication in constrained channels

A Note on a Privacy-Preserving Distance-Bounding Protocol

On Selecting the Nonce Length in Distance-Bounding Protocols