Publications related to Secure Communication in Erasure Networks with State-feedback

Cryptanalysis of Chosen Symmetric Homomorphic Schemes

Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryption has become a very popular topic. The main contribution of Gentry’s thesis was, that it has proven, that it actually is possible to design a fully homomorphic enc ...

2014

Depth-based multiview distributed video coding

Thomas Maugey

Multiview distributed video coding (DVC) has gained much attention in the last few years because of its potential in avoiding communication between cameras without decreasing the coding performance. However, the current results are not matching the expecta ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Compute-and-forward for discrete memoryless networks

Michael Christoph Gastpar

Consider a receiver that observes multiple interfering codewords. The compute-and-forward technique makes it possible for the receiver to directly decode linear combinations of the codewords. Previous work has focused on compute-and-forward for linear Gaus ...

2014

A simple relaying strategy for diamond networks

Christina Fragouli, Siddhartha Brahma

We consider a Gaussian diamond network where a source communicates with the destination through n non-interfering half-duplex relays. Using simple approximations to the capacity of the network, we show that simple relaying strategies involving two relays a ...

Ieee2014

Secure Network Coding with Erasures and Feedback

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

Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secre ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

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

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

2013

Exploiting Common Randomness: a Resource for Network Secrecy

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

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

Ieee2013

Securing Broadcast Against Dishonest Receivers

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

Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedba ...

IEEE2013

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Christina Fragouli, Efe Onaran

We consider the single hop broadcast packet erasure channel (BPEC) with two multicast sessions (each of them destined to a different group of

N

users) and regularly available instantaneous receiver ACK/NACK feedback. Using the insight gained from recent ...

2013

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

We consider the N-user broadcast erasure channel with unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; ...

Institute of Electrical and Electronics Engineers2013

Secure Communication in Erasure Networks with State-feedback

Graph Chatbot

Chat with Graph Search

Cryptanalysis of Chosen Symmetric Homomorphic Schemes

Depth-based multiview distributed video coding

Compute-and-forward for discrete memoryless networks

A simple relaying strategy for diamond networks

Secure Network Coding with Erasures and Feedback

Exploiting Common Randomness: a Resource for Network Secrecy

Exploiting Common Randomness: a Resource for Network Secrecy

Securing Broadcast Against Dishonest Receivers

Coding schemes for broadcast erasure channels with feedback: the two multicast case

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

Exploiting Common Randomness: a Resource for Network Secrecy

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

Secure Network Coding with Erasures and Feedback

Depth-based multiview distributed video coding

Compute-and-forward for discrete memoryless networks

A simple relaying strategy for diamond networks

Exploiting Common Randomness: a Resource for Network Secrecy

Cryptanalysis of Chosen Symmetric Homomorphic Schemes

Securing Broadcast Against Dishonest Receivers

Coding schemes for broadcast erasure channels with feedback: the two multicast case