TY - GEN
T1 - On Secure Capacity of Multiple Unicast Traffic over Separable Networks
AU - Agarwal, Gaurav Kumar
AU - Cardone, Martina
AU - Fragouli, Christina
PY - 2019/8
Y1 - 2019/8
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85081098120&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081098120&partnerID=8YFLogxK
U2 - 10.1109/ITW44776.2019.8988985
DO - 10.1109/ITW44776.2019.8988985
M3 - Conference contribution
T3 - 2019 IEEE Information Theory Workshop, ITW 2019
BT - 2019 IEEE Information Theory Workshop, ITW 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Information Theory Workshop, ITW 2019
Y2 - 25 August 2019 through 28 August 2019
ER -