Publications associées à Exchanging Pairwise Secrets Efficiently

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.

Creating Secrets Out Of Packet Erasures

Christina Fragouli, László Czap, Iris Safaka

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

Ieee-Inst Electrical Electronics Engineers Inc2016

Efficient Key Exchange for Wireless Multi-hop Networks

Christina Fragouli, László Czap, Iris Safaka

We present a protocol that enables to create pairwise keys between nodes in a wireless network, so that the keys are secure from an adversary, Eve, with unbounded computational and memory capabilities, but with limited network presence. Our proposed protoc ...

2015

Development of wireless sensor network using bluetooth low energy (BLE) for construction noise monitoring

Josephine Anna Eleanor Hughes

In this paper the development of a Wireless Sensor Network (WSN) for construction noise identification and sound locating is investigated using the novel application of Bluetooth Low Energy (BLE). Three WSNs using different system-on-chip (SoC) devices and ...

Massey University2015

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

Ieee2014

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

Robust Localization from Incomplete Local Information

Amin Karbasi

We consider the problem of localizing wireless devices in an ad-hoc network embedded in a

d

-dimensional Euclidean space. Obtaining a good estimation of where wireless devices are located is crucial in wireless network applications including environment m ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Robust Localization from Incomplete Local Information

Amin Karbasi

We consider the problem of localizing wireless devices in an ad-hoc network embedded in a

d

-dimensional Euclidean space. Obtaining a good estimation of where wireless devices are located is crucial in wireless network applications including environment m ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Exchanging Pairwise Secrets Efficiently

Graph Chatbot

Chattez avec Graph Search

Creating Secrets Out Of Packet Erasures

Efficient Key Exchange for Wireless Multi-hop Networks

Development of wireless sensor network using bluetooth low energy (BLE) for construction noise monitoring

Challenges in Distance Bounding

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Triangle Network Secrecy

Triangle Network Secrecy

Creating Secrets out of Erasures

Robust Localization from Incomplete Local Information

Efficient Key Exchange for Wireless Multi-hop Networks

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Development of wireless sensor network using bluetooth low energy (BLE) for construction noise monitoring

Challenges in Distance Bounding

Triangle Network Secrecy

Creating Secrets Out Of Packet Erasures

Creating Secrets out of Erasures

Triangle Network Secrecy

Robust Localization from Incomplete Local Information