Secure Network Coding for Multiple Unicast: On the Case of Single Source

Gaurav Kumar Agarwal; Martina Cardone; Christina Fragouli

doi:10.1007/978-3-319-72089-0_11

Secure Network Coding for Multiple Unicast: On the Case of Single Source

Gaurav Kumar Agarwal, Martina Cardone, Christina Fragouli

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

Abstract

This paper considers multiple unicast wireline noiseless networks where a single source wishes to transmit independent messages to a set of legitimate destinations. The primal goal is to characterize the secure capacity region, where the exchanged messages have to be secured from a passive external eavesdropper that has unbounded computational capabilities, but limited network presence. The secure capacity region for the case of two destinations is characterized and it is shown to be a function of only the min-cut capacities and the number of edges the eavesdropper wiretaps. A polynomial-time two-phase scheme is then designed for a general number of destinations and its achievable secure rate region is derived. It is shown that the secure capacity result for the two destinations case is not reversible, that is, by switching the role of the source and destinations and by reversing the directions of the edges, the secure capacity region changes.

Original language	English (US)
Title of host publication	Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings
Editors	Junji Shikata
Publisher	Springer Verlag
Pages	188-207
Number of pages	20
ISBN (Print)	9783319720883
DOIs	https://doi.org/10.1007/978-3-319-72089-0_11
State	Published - 2017
Event	10th International Conference on Information Theoretic Security, ICITS 2017 - Hong Kong, Hong Kong Duration: Nov 29 2017 → Dec 2 2017

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	10681 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	10th International Conference on Information Theoretic Security, ICITS 2017
Country/Territory	Hong Kong
City	Hong Kong
Period	11/29/17 → 12/2/17

Bibliographical note

Funding Information:
The work of the authors was partially funded by NSF under awards 1321120 and 1740047. G. K. Agarwal is also supported by the Guru Krupa Fellowship.

Publisher Copyright:
© Springer International Publishing AG. 2017.

Access

10.1007/978-3-319-72089-0_11

OpenUrl availability

Full text

Cite this

Agarwal, G. K., Cardone, M., & Fragouli, C. (2017). Secure Network Coding for Multiple Unicast: On the Case of Single Source. In J. Shikata (Ed.), Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings (pp. 188-207). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10681 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-72089-0_11

Secure Network Coding for Multiple Unicast: On the Case of Single Source. / Agarwal, Gaurav Kumar; Cardone, Martina; Fragouli, Christina.
Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings. ed. / Junji Shikata. Springer Verlag, 2017. p. 188-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10681 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Agarwal, GK, Cardone, M & Fragouli, C 2017, Secure Network Coding for Multiple Unicast: On the Case of Single Source. in J Shikata (ed.), Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10681 LNCS, Springer Verlag, pp. 188-207, 10th International Conference on Information Theoretic Security, ICITS 2017, Hong Kong, Hong Kong, 11/29/17. https://doi.org/10.1007/978-3-319-72089-0_11

Agarwal GK, Cardone M, Fragouli C. Secure Network Coding for Multiple Unicast: On the Case of Single Source. In Shikata J, editor, Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings. Springer Verlag. 2017. p. 188-207. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-72089-0_11

Agarwal, Gaurav Kumar ; Cardone, Martina ; Fragouli, Christina. / Secure Network Coding for Multiple Unicast : On the Case of Single Source. Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings. editor / Junji Shikata. Springer Verlag, 2017. pp. 188-207 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5443424cfffc45209572626cecdfefbd,

title = "Secure Network Coding for Multiple Unicast: On the Case of Single Source",

abstract = "This paper considers multiple unicast wireline noiseless networks where a single source wishes to transmit independent messages to a set of legitimate destinations. The primal goal is to characterize the secure capacity region, where the exchanged messages have to be secured from a passive external eavesdropper that has unbounded computational capabilities, but limited network presence. The secure capacity region for the case of two destinations is characterized and it is shown to be a function of only the min-cut capacities and the number of edges the eavesdropper wiretaps. A polynomial-time two-phase scheme is then designed for a general number of destinations and its achievable secure rate region is derived. It is shown that the secure capacity result for the two destinations case is not reversible, that is, by switching the role of the source and destinations and by reversing the directions of the edges, the secure capacity region changes.",

author = "Agarwal, {Gaurav Kumar} and Martina Cardone and Christina Fragouli",

note = "Funding Information: The work of the authors was partially funded by NSF under awards 1321120 and 1740047. G. K. Agarwal is also supported by the Guru Krupa Fellowship. Publisher Copyright: {\textcopyright} Springer International Publishing AG. 2017.; 10th International Conference on Information Theoretic Security, ICITS 2017 ; Conference date: 29-11-2017 Through 02-12-2017",

year = "2017",

doi = "10.1007/978-3-319-72089-0_11",

language = "English (US)",

isbn = "9783319720883",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "188--207",

editor = "Junji Shikata",

booktitle = "Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings",

}

TY - GEN

T1 - Secure Network Coding for Multiple Unicast

T2 - 10th International Conference on Information Theoretic Security, ICITS 2017

AU - Agarwal, Gaurav Kumar

AU - Cardone, Martina

AU - Fragouli, Christina

N1 - Funding Information: The work of the authors was partially funded by NSF under awards 1321120 and 1740047. G. K. Agarwal is also supported by the Guru Krupa Fellowship. Publisher Copyright: © Springer International Publishing AG. 2017.

PY - 2017

Y1 - 2017

N2 - This paper considers multiple unicast wireline noiseless networks where a single source wishes to transmit independent messages to a set of legitimate destinations. The primal goal is to characterize the secure capacity region, where the exchanged messages have to be secured from a passive external eavesdropper that has unbounded computational capabilities, but limited network presence. The secure capacity region for the case of two destinations is characterized and it is shown to be a function of only the min-cut capacities and the number of edges the eavesdropper wiretaps. A polynomial-time two-phase scheme is then designed for a general number of destinations and its achievable secure rate region is derived. It is shown that the secure capacity result for the two destinations case is not reversible, that is, by switching the role of the source and destinations and by reversing the directions of the edges, the secure capacity region changes.

AB - This paper considers multiple unicast wireline noiseless networks where a single source wishes to transmit independent messages to a set of legitimate destinations. The primal goal is to characterize the secure capacity region, where the exchanged messages have to be secured from a passive external eavesdropper that has unbounded computational capabilities, but limited network presence. The secure capacity region for the case of two destinations is characterized and it is shown to be a function of only the min-cut capacities and the number of edges the eavesdropper wiretaps. A polynomial-time two-phase scheme is then designed for a general number of destinations and its achievable secure rate region is derived. It is shown that the secure capacity result for the two destinations case is not reversible, that is, by switching the role of the source and destinations and by reversing the directions of the edges, the secure capacity region changes.

UR - http://www.scopus.com/inward/record.url?scp=85036620163&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85036620163&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-72089-0_11

DO - 10.1007/978-3-319-72089-0_11

M3 - Conference contribution

AN - SCOPUS:85036620163

SN - 9783319720883

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 188

EP - 207

BT - Information Theoretic Security - 10th International Conference, ICITS 2017, Proceedings

A2 - Shikata, Junji

PB - Springer Verlag

Y2 - 29 November 2017 through 2 December 2017

ER -

Secure Network Coding for Multiple Unicast: On the Case of Single Source

Abstract

Publication series

Other

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this