Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys

Debaditya Chaudhuri; Michael Langberg; Michelle Effros

doi:10.1109/ISIT.2019.8849665

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys

Debaditya Chaudhuri, Michael Langberg, Michelle Effros

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

Abstract

It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to z network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances - a well known open problem. This work treats an intermediate model of secure unicast in which only one node can generate random keys, however that node need not be the source node. The secure communication rate for this setting is characterized again with an eavesdropper that has access to z network links.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2309-2313
Number of pages	5
ISBN (Electronic)	9781538692912
DOIs	https://doi.org/10.1109/ISIT.2019.8849665
State	Published - Jul 2019
Externally published	Yes
Event	2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France Duration: 7 Jul 2019 → 12 Jul 2019

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2019-July
ISSN (Print)	2157-8095

Conference

Conference	2019 IEEE International Symposium on Information Theory, ISIT 2019
Country/Territory	France
City	Paris
Period	7/07/19 → 12/07/19

Bibliographical note

Publisher Copyright:
© 2019 IEEE.

Access to Document

10.1109/ISIT.2019.8849665

Cite this

Chaudhuri, D., Langberg, M., & Effros, M. (2019). Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 2309-2313). Article 8849665 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849665

Chaudhuri, Debaditya ; Langberg, Michael ; Effros, Michelle. / Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 2309-2313 (IEEE International Symposium on Information Theory - Proceedings).

@inproceedings{6cac393d018444b7a57d0e4589cd1931,

title = "Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys",

abstract = "It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to z network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances - a well known open problem. This work treats an intermediate model of secure unicast in which only one node can generate random keys, however that node need not be the source node. The secure communication rate for this setting is characterized again with an eavesdropper that has access to z network links.",

author = "Debaditya Chaudhuri and Michael Langberg and Michelle Effros",

note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 IEEE International Symposium on Information Theory, ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849665",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "2309--2313",

booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",

address = "ארצות הברית",

}

Chaudhuri, D, Langberg, M & Effros, M 2019, Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849665, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 2309-2313, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849665

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. / Chaudhuri, Debaditya; Langberg, Michael; Effros, Michelle.
2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 2309-2313 8849665 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

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

TY - GEN

T1 - Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys

AU - Chaudhuri, Debaditya

AU - Langberg, Michael

AU - Effros, Michelle

PY - 2019/7

Y1 - 2019/7

N2 - It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to z network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances - a well known open problem. This work treats an intermediate model of secure unicast in which only one node can generate random keys, however that node need not be the source node. The secure communication rate for this setting is characterized again with an eavesdropper that has access to z network links.

AB - It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to z network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances - a well known open problem. This work treats an intermediate model of secure unicast in which only one node can generate random keys, however that node need not be the source node. The secure communication rate for this setting is characterized again with an eavesdropper that has access to z network links.

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

U2 - 10.1109/ISIT.2019.8849665

DO - 10.1109/ISIT.2019.8849665

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85073166781

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2309

EP - 2313

BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019

Y2 - 7 July 2019 through 12 July 2019

ER -

Chaudhuri D, Langberg M, Effros M. Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 2309-2313. 8849665. (IEEE International Symposium on Information Theory - Proceedings). doi: 10.1109/ISIT.2019.8849665

Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this