Publications associées à Interpreting Hash Function Security Proofs

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.

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Serge Vaudenay, Damian Vizár, Reza Reyhanitabar

We present two variants of OMD which are robust against nonce misuse. Security of OMD---a CAESAR candidate---relies on the assumption that implementations always ensure correct use of nonce (a.k.a. message number); namely that, the nonce never gets repeate ...

Springer-Verlag Berlin2014

Security Vulnerabilities of the Cisco IOS Implementation of the MPLS Transport Profile

Jean-Yves Le Boudec, Sergio Barreto Andrade, Teklemariam Tsegay Tesfay, Udaya Upul Kumara Jayasinghe, Miroslav Popovic

We are interested in the security of the MPLS Transport Profile (MPLS-TP), in the context of smart-grid communication networks. The security guidelines of the MPLS-TP standards are written in a complex and indirect way, which led us to pose as hypothesis t ...

2014

Game Theory Meets Network Security and Privacy

Jean-Pierre Hubaux

This survey provides a structured and comprehensive overview of research on security and privacy in computer and communication networks that use game-theoretic approaches. We present a selected set of works to highlight the application of game theory in ad ...

Assoc Computing Machinery2013

Secure & Lightweight Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Distance-bounding is a practical solution to be used in security-sensitive contexts, mainly to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect again ...

2013

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

Serge Vaudenay, Aikaterini Mitrokotsa

In this paper, we show that many formal and informal security results on distance-bounding (DB) protocols are incorrect/incomplete. We identify that this inadequacy stems from the fact that the pseudorandom function (PRF) assumption alone, invoked in many ...

Springer2012

The Inconvenient Truth about Web Certificates

Jean-Pierre Hubaux, Julien Freudiger, Nevena Vratonjic, Vincent Bindschaedler

HTTPS is the de facto standard for securing Internet communications. Although it is widely deployed, the security provided with HTTPS in practice is dubious. HTTPS may fail to provide security for multiple reasons, mostly due to certificate-based authentic ...

2011

Short Undeniable Signatures Based on Group Homomorphisms

Serge Vaudenay, Jean Monnerat

This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully scalable size depending on the security level. To this end, we develop a gene ...

Springer Verlag2011

Faster and Smoother - VSH Revisited

Juraj Sarinay

We reconsider the provably collision resistant Very Smooth Hash and propose a small change in the design aiming to improve both performance and security. While the original proofs of security based on hardness of factoring or discrete logarithms are preser ...

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

Interpreting Hash Function Security Proofs

Graph Chatbot

Chattez avec Graph Search

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Security Vulnerabilities of the Cisco IOS Implementation of the MPLS Transport Profile

Game Theory Meets Network Security and Privacy

Secure & Lightweight Distance-Bounding

Game Theory Meets Network Security and Privacy

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

Cryptographic Hash Functions in Groups and Provable Properties

The Inconvenient Truth about Web Certificates

Short Undeniable Signatures Based on Group Homomorphisms

Faster and Smoother - VSH Revisited

Short Undeniable Signatures Based on Group Homomorphisms

Cryptographic Hash Functions in Groups and Provable Properties

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

Security Vulnerabilities of the Cisco IOS Implementation of the MPLS Transport Profile

Game Theory Meets Network Security and Privacy

Secure & Lightweight Distance-Bounding

Misuse-Resistant Variants of the OMD Authenticated Encryption Mode

Game Theory Meets Network Security and Privacy

The Inconvenient Truth about Web Certificates

Faster and Smoother - VSH Revisited