Concept

Protocol Data Unit

Publications associées (170)

Consensus Inside

Rachid Guerraoui, Maysam Yabandeh, Tudor Alexandru David

Scaling to a large number of cores with non-uniform communication latency and unpredictable response time may call for viewing a modern many-core architecture as a distributed system. In this view, the cores replicate shared data and ensure consistency amo ...

2014

Consensus inside

Rachid Guerraoui, Maysam Yabandeh, Tudor Alexandru David

ACM Press2014

Compact portable biosensor for arsenic detection in aqueous samples with Escherichia coli bioreporter cells

Philippe Renaud, Harald Van Lintel, Nina Buffi

We present a compact portable biosensor to measure arsenic As(III) concentrations in water using Escherichia coli bioreporter cells. Escherichia coli expresses green fluorescent protein in a linearly dependent manner as a function of the arsenic concentrat ...

Amer Inst Physics2014

Input-Aware Equivocable Commitments and UC-secure Commitments With Atomic Exchanges

Serge Vaudenay

We define a new primitive, input-aware equivocable commitment, baring similar hardness assumptions as plaintext-aware encryption and featuring equivocability. We construct an actual input-aware equivocable commitment protocol, based on a flavor of Diffie-H ...

Springer2013

Fairness of MAC protocols: IEEE 1901 vs. 802.11

Patrick Thiran, Julien Pierre Sacha Herzen, Christina Vlachou

The MAC layer of the IEEE 1901 standard for power line communications employs a CSMA/CA method similar to, but more complex than, this of IEEE 802.11 for wireless communications. The differences between these protocols raise questions such as which one per ...

IEEE2013

Low cost security for sensor networks

Christina Fragouli, Lorenzo Keller, Iris Safaka, Emre Atsan

We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by a ...

Institute of Electrical and Electronics Engineers Inc.2013

Exchanging Pairwise Secrets Efficiently

Christina Fragouli, Suhas Diggavi, Iris Safaka

We consider the problem where a group of wireless nodes, connected to the same broadcast domain, want to create pairwise secrets, in the presence of an adversary Eve, who tries to listen in and steal these secrets. Existing solutions assume that Eve cannot ...

Institute of Electrical and Electronics Engineers Inc.2013

On Modeling Terrorist Frauds

Serge Vaudenay

Quite recently, distance-bounding protocols received a lot of attention as they offer a good solution to thwart relay attacks. Their security models at still unstable, especially when considering terrorist fraud. This considers the case where a malicious p ...

Springer2013

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

View Selection Policy For Multi-View Video Delivery

We derive an optimization framework for computing a view selection policy for streaming multi-view content over a bandwidth constrained channel. The optimization allows us to determine the decisions of sending the packetized data such that the end-to-end r ...

IEEE2013

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