Mutual dependence for secret key agreement

Author

Chan, Chung ; Zheng, Lizhong

Author_Institution

Shun Hing Inst. of Adv. Eng., Chinese Univ. of Hong Kong, Hong Kong, China

fYear

2010

fDate

17-19 March 2010

Firstpage

1

Lastpage

6

Abstract

A mutual dependence expression is established for the secret key agreement problem when all users are active. In certain source networks, the expression can be interpreted as certain notions of connectivity and network information flow. In particular, the secrecy problem can be mapped to a new class of network coding problems with selectable links and undirected broadcast links. For such networks, the secrecy capacities serve as upper bounds on the maximum network throughputs, while the network coding solutions can be used for secret key agreement.

Keywords

broadcast channels; computer network security; cryptography; network coding; connectivity information flow; mutual dependence; network coding problems; network information flow; secrecy problem; secret key agreement; source networks; undirected broadcast links; Broadcasting; Channel coding; Entropy; Information theory; Laboratories; Mutual information; Network coding; Random variables; Throughput; Upper bound; Secret key agreement; mutual dependence; network coding; partition connectivity; supermodularity;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Sciences and Systems (CISS), 2010 44th Annual Conference on

Conference_Location

Princeton, NJ

Print_ISBN

978-1-4244-7416-5

Electronic_ISBN

978-1-4244-7417-2

Type

conf

DOI

10.1109/CISS.2010.5464805

Filename

5464805