Publications related to Creating Secrets out of Erasures

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.

Distributed Rate Allocation in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user ...

Institute of Electrical and Electronics Engineers2014

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

Network Coding Meets Multimedia: A Review

Pascal Frossard, Enrico Magli

While every network node only relays messages in a traditional communication system, the recent network coding (NC) paradigm proposes to implement simple in-network processing with packet combinations in the nodes. NC extends the concept of "encoding" a me ...

Ieee-Inst Electrical Electronics Engineers Inc2013

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

Formal Analysis of Secure Neighbor Discovery in Wireless Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski

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

Ieee Computer Soc2013

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

SenseCode: Network Coding for Reliable Sensor Networks

Christina Fragouli, Lorenzo Keller, Emre Atsan

Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goa ...

Assoc Computing Machinery2013

Game Theory Meets Network Security and Privacy

Jean-Pierre Hubaux

This survey provides a structured and comprehensive overview of research on security and privacy in computer and communication networks that use game-theoretic approaches. We present a selected set of works to highlight the application of game theory in ad ...

Assoc Computing Machinery2013

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

Creating Secrets out of Erasures

Graph Chatbot

Chat with Graph Search

Probing the network. Architecturality of Wireless Infrastructure

Distributed Rate Allocation in Inter-Session Network Coding

Exchanging Pairwise Secrets Efficiently

Rate allocation and optimized decoding in inter-session network coding

Network Coding Meets Multimedia: A Review

Low cost security for sensor networks

Formal Analysis of Secure Neighbor Discovery in Wireless Networks

Robust Localization from Incomplete Local Information

SenseCode: Network Coding for Reliable Sensor Networks

Game Theory Meets Network Security and Privacy

Exchanging Pairwise Secrets Efficiently

Rate allocation and optimized decoding in inter-session network coding

Network Coding Meets Multimedia: A Review

Formal Analysis of Secure Neighbor Discovery in Wireless Networks

Robust Localization from Incomplete Local Information

Game Theory Meets Network Security and Privacy

Probing the network. Architecturality of Wireless Infrastructure

Distributed Rate Allocation in Inter-Session Network Coding

Low cost security for sensor networks

SenseCode: Network Coding for Reliable Sensor Networks