Publications related to Man-in-the-middle attack

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Towards a highly effective and robust Web credibility evaluation system

Karl Aberer, Xin Liu

By leveraging crowdsourcing, Web credibility evaluation systems (WCESs) have become a promising tool to assess the credibility of Web content, e.g., Web pages. However, existing systems adopt a passive Way to collect users' credibility ratings, which incur ...

Elsevier Science Bv2015

On the Key Schedule of Lightweight Block Ciphers

Serge Vaudenay, Jialin Huang

Key schedules in lightweight block ciphers are often highly simplified, which causes weakness that can be exploited in many attacks. Today it remains an open problem on how to use limited operations to guarantee enough diffusion of key bits in lightweight ...

Springer-Verlag Berlin2014

Towards Secure Distance Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Relay attacks (and, more generally, man-in-the-middle attacks) are a serious threat against many access control and payment schemes. In this work, we present distance-bounding protocols, how these can deter relay attacks, and the security models formalizin ...

2013

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 Need for Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

Distance-bounding is a practical solution to prevent relay attacks. Yet, security models are not well-established. We will briefly show recent techniques that expose serious distance-frauds, mafia-frauds, and/or terrorist-frauds on distance-bounding protoc ...

2013

Smashing WEP in A Passive Attack

Serge Vaudenay, Martin Vuagnoux, Pouyan Sepehrdad, Petr Susil

In this paper, we report extremely fast and optimised active and passive attacks against the old IEEE 802.11 wireless communication protocol WEP. This was achieved through a huge amount of theoretical and experimental analysis (capturing WiFi packets), ref ...

2013

Practical & Provably Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. At FSE 2013, we presented SKI as the first family of provably sec ...

2013

Proactively Accountable Anonymous Messaging in Verdict

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Among anonymity systems, DC-nets have long held attraction for their resistance to traffic analysis attacks, but practical implementations remain vulnerable to internal disruption or “jamming” attacks, which require time-consuming detection procedures to r ...

2013

Man-in-the-middle attack

Graph Chatbot

Chat with Graph Search

Towards a highly effective and robust Web credibility evaluation system

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

On the Key Schedule of Lightweight Block Ciphers

Towards Secure Distance Bounding

Secure Device Authentication Mechanisms for the Smart Grid-Enabled Home Area Networks

Secure & Lightweight Distance-Bounding

On the Need for Secure Distance-Bounding

Smashing WEP in A Passive Attack

Practical & Provably Secure Distance-Bounding

Proactively Accountable Anonymous Messaging in Verdict

On the Key Schedule of Lightweight Block Ciphers

Towards a highly effective and robust Web credibility evaluation system

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Secure Device Authentication Mechanisms for the Smart Grid-Enabled Home Area Networks

Towards Secure Distance Bounding

Secure & Lightweight Distance-Bounding

On the Need for Secure Distance-Bounding

Practical & Provably Secure Distance-Bounding

Proactively Accountable Anonymous Messaging in Verdict

Smashing WEP in A Passive Attack