On Secure Capacity of Multiple Unicast Traffic over Separable Networks

Gaurav Kumar Agarwal, Martina Cardone, Christina Fragouli

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper studies the problem of information theoretic secure communication when a source has private messages to transmit to m destinations, in the presence of a passive adversary who eavesdrops an unknown set of k edges. The information theoretic secure capacity is derived over unit-edge capacity separable networks, for the cases when k = 1 and m is arbitrary, or m = 3 and k is arbitrary. This is achieved by first showing that there exists a secure polynomial-time code construction that matches an outer bound over two-layer networks, followed by a deterministic mapping between two-layer and arbitrary separable networks.

Original languageEnglish (US)
Title of host publication2019 IEEE Information Theory Workshop, ITW 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538669006
DOIs
StatePublished - Aug 2019
Event2019 IEEE Information Theory Workshop, ITW 2019 - Visby, Sweden
Duration: Aug 25 2019Aug 28 2019

Publication series

Name2019 IEEE Information Theory Workshop, ITW 2019

Conference

Conference2019 IEEE Information Theory Workshop, ITW 2019
CountrySweden
CityVisby
Period8/25/198/28/19

Fingerprint Dive into the research topics of 'On Secure Capacity of Multiple Unicast Traffic over Separable Networks'. Together they form a unique fingerprint.

Cite this