Publications related to Creating Shared Secrets out of Thin Air

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.

Elucidating the Instability of Random Access Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

We investigate both theoretically and experimentally the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that impac ...

2009

Interference-Resilient Information Exchange

Rachid Guerraoui, Seth Gilbert

This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C ava ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

A Practical Secure Neighbor Verification Protocol for Wireless Sensor Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Reza Shokri, Marcin Poturalski, Gaël Ravot

Wireless networking relies on a fundamental building block, neighbor discovery (ND). The nature of wireless communications, however, makes attacks against ND easy: An adversary can simply replay or relay (wormhole) packets across the network and mislead di ...

2009

Enabling Secure Secret Sharing in Distributed Online Social Networks

Karl Aberer, Anwitaman Datta, Sonja Buchegger

We study a new application of threshold-based secret sharing in a distributed online social network (DOSN), where users need a means to back up and recover their private keys in a network of untrusted servers. Using a simple threshold-based secret sharing ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2009

Security and Cooperation in Wireless Networks

Jean-Pierre Hubaux, Levente Buttyan

According to most technology pundits, progress in wireless and sensor networks will lead us into a world of ubiquitous computing, in which myriads of tiny, untethered sensors and actuators will communicate with each other. Information technology will thus ...

Cambridge University Press2008

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

Jean-Yves Le Boudec, Christina Fragouli, Jörg Widmer

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...

2008

Wireless Network Secrecy with Public Feedback

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we consider secret communication between two special nodes ("source" and "destination") in a wireless network with authenticated relays: the message communicated to the destination is to be kept information-theoretically (unconditionally) sec ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

On Cooperative Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, Etienne Perron

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether w ...

2008

Dynamic network security deployment under partial information

Jean-Yves Le Boudec, Georgios Theodorakopoulos

A network user’s decision to start and continue using security products is based on economic considerations. The cost of a security compromise (e.g., worm infection) is compared against the cost of deploying and maintaining a sufficient level of security. ...

2008

Creating Shared Secrets out of Thin Air

Graph Chatbot

Chat with Graph Search

Elucidating the Instability of Random Access Wireless Mesh Networks

Interference-Resilient Information Exchange

A Practical Secure Neighbor Verification Protocol for Wireless Sensor Networks

Enabling Secure Secret Sharing in Distributed Online Social Networks

Security and Cooperation in Wireless Networks

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

Wireless Network Secrecy with Public Feedback

On Cooperative Wireless Network Secrecy

Dynamic network security deployment under partial information

Non-cooperative behavior in wireless networks

Elucidating the Instability of Random Access Wireless Mesh Networks

Enabling Secure Secret Sharing in Distributed Online Social Networks

Security and Cooperation in Wireless Networks

Dynamic network security deployment under partial information

Non-cooperative behavior in wireless networks

Wireless Network Secrecy with Public Feedback

Interference-Resilient Information Exchange

A Practical Secure Neighbor Verification Protocol for Wireless Sensor Networks

Low-complexity Algorithms for Energy Efficient Broadcasting in Wireless Networks

On Cooperative Wireless Network Secrecy