Multiterminal Secret Key Agreement

Chung Chan; Lizhong Zheng

doi:10.1109/TIT.2014.2313566

Multiterminal Secret Key Agreement

Chung Chan, Lizhong Zheng

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

12 Citations (Scopus)

Abstract

The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels. A counter-example shows that the bounds do not match in general, and a better cooperative scheme can narrow the gap.

Original language	English
Article number	6803068
Pages (from-to)	3379-3412
Journal	IEEE Transactions on Information Theory
Volume	60
Issue number	6
Online published	21 Apr 2014
DOIs	https://doi.org/10.1109/TIT.2014.2313566
Publication status	Published - Jun 2014
Externally published	Yes

Research Keywords

general multiterminal network
pure and mixed source emulations
secrecy capacity
Secret key agreement

Access Output

10.1109/TIT.2014.2313566

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{b9b8788f8cf24d849a34bbe1cfdc1046,

title = "Multiterminal Secret Key Agreement",

abstract = "The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels. A counter-example shows that the bounds do not match in general, and a better cooperative scheme can narrow the gap.",

keywords = "general multiterminal network, pure and mixed source emulations, secrecy capacity, Secret key agreement",

author = "Chung Chan and Lizhong Zheng",

year = "2014",

month = jun,

doi = "10.1109/TIT.2014.2313566",

language = "English",

volume = "60",

pages = "3379--3412",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "6",

}

TY - JOUR

T1 - Multiterminal Secret Key Agreement

AU - Chan, Chung

AU - Zheng, Lizhong

PY - 2014/6

Y1 - 2014/6

N2 - The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels. A counter-example shows that the bounds do not match in general, and a better cooperative scheme can narrow the gap.

AB - The problem of secret key agreement by public discussion is studied under a general multiterminal network, where each user can both send and receive over a private channel. Single-letter upper and lower bounds are for the maximum achievable key rate. The bounds are shown to match for a large class of private channels. A counter-example shows that the bounds do not match in general, and a better cooperative scheme can narrow the gap.

KW - general multiterminal network

KW - pure and mixed source emulations

KW - secrecy capacity

KW - Secret key agreement

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84901283610&origin=recordpage

U2 - 10.1109/TIT.2014.2313566

DO - 10.1109/TIT.2014.2313566

M3 - RGC 21 - Publication in refereed journal

SN - 0018-9448

VL - 60

SP - 3379

EP - 3412

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

M1 - 6803068

ER -

Multiterminal Secret Key Agreement

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this