Concept

Sliding window protocol

Publications associées (43)

Destination buffer analysis for packets rejection obliteration in multi-channel networks

In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronou ...

2019

A Timing-Monitoring Sequential for Forward and Backward Error-Detection in 28 nm FD-SOI

Andreas Peter Burg, Adam Shmuel Teman, Andrea Bonetti, Jeremy Hugues-Felix Constantin

The increasing impact of variability on near-threshold nanometer circuits calls for a tighter online monitoring and control of the available timing margins. Error-detection sequentials are widely used together with error-correction techniques to operate di ...

IEEE2018

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Challenges in Distance Bounding

Serge Vaudenay

Smartcard-based protocols represent an increasingly large share of the wireless authentication market, from contactless payments to remote car unlocking. Unfortunately, relay attacks pose a significant threat to these wireless solutions. However, this risk ...

Ieee Computer Soc2015

Practical and 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. In this paper, we present a formal analysis of SKI, which recentl ...

IOS Press2015

Time- and Space-Efficient Sliding Window Top-k Query Processing

Karl Aberer, Kresimir Pripuzic

A sliding window top-k (top-k/w) query monitors incoming data stream objects within a sliding window of size w to identify the k highest-ranked objects with respect to a given scoring function over time. Processing of such queries is challenging because, e ...

Association for Computing Machinery2015

Optimal Proximity Proofs Revisited

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become important since wireless technologies become more and more common. Therefore, the security of the distance bounding protocol should be carefully analyzed. However, most of the protocols are not secure or their security is ...

Springer Verlag2015

Optimal Proximity Proofs

Serge Vaudenay

Provably secure distance-bounding is a rising subject, yet an unsettled one; indeed, very few distance-bounding protocols, with formal security proofs, have been proposed. In fact, so far only two protocols, namely SKI (by Boureanu et al.) and FO (by Fisch ...

Springer2015

On Privacy for RFID

Serge Vaudenay

Many wearable devices identify themselves in a pervasive way. But at the same time, people want to remain anonymous. Modeling anonymity and unlinkability in identification protocols is a delicate issue. In this paper, we revisit the privacy model from Asia ...

2015

Location leakage in distance bounding: Why location privacy does not work

Serge Vaudenay, Aikaterini Mitrokotsa

In many cases, we can only have access to a service by proving we are sufficiently close to a particular location (e.g. in automobile or building access control). In these cases, proximity can be guaranteed through signal attenuation. However, by using add ...

Elsevier2014

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