Cyber-attack on Packet-Based Time Synchronization Protocols: the Undetectable Delay Box

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.

We present protocols for creating pairwise secrets between nodes in a wireless network, so that these secrets are secure from an eavesdropper, Eve, with unbounded computational and memory capabilities, but with limited network presence. We first present a ...

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 ...

Today it is possible to achieve sub-ns level time synchronization on a wireline network while only us-level synchronization can be achieved on a wireless (microwave) link. In this paper we will, first, study the performances of different time synchronizati ...

Gossip-based protocols have proven very efficient for disseminating high-bandwidth content such as video streams in a peer-to-peer fashion. However, for the protocols to work, nodes are required to collaborate by devoting a fraction of their upload bandwid ...

Most existing distributed systems use logical clocks to order events in the implementation of various consistency models. Although logical clocks are straightforward to implement and maintain, they may affect the scalability, availability, and latency of t ...

Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secr ...

We develop a formal framework for the analysis of security protocols in wireless networks. The framework captures characteristics necessary to reason about neighbor discovery protocols, such as the neighbor relation, device location, and message propagatio ...

Method for estimating and correcting a frequency offset between a local clock of a receiving transceiver and a remote clock of an emitting transceiver comprises receiving by said receiving transceiver, a signal emitted by the emitting transceiver, said sig ...

Distance-bounding protocols form a family of challenge-response authentication protocols that have been introduced to thwart relay attacks. They enable a verifier to authenticate and to establish an upper bound on the physical distance to an untrusted prov ...

Cyber-attack on Packet-Based Time Synchronization Protocols: the Undetectable Delay Box

Chat with Graph Search

Creating Secrets Out Of Packet Erasures

Optimal Proximity Proofs

ns-level time transfer over a microwave link using the PTP-WR protocol

Tracking freeriders in gossip-based content dissemination systems

Consistency Models in Distributed Systems with Physical Clocks

Secure Wireless Communications via Cooperative Transmitting

Formal Analysis of Secure Neighbor Discovery in Wireless Networks

Method for estimating and correcting a drift between clocks of receiving transceiver and a corresponding emitting transceiver, and receive for implementing said method

On Selecting the Nonce Length in Distance-Bounding Protocols