Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)
DOI: 10.1109/itcom.1999.781417
View full text |Buy / Rent full text
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

1
104
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 47 publications
(105 citation statements)
references
References 0 publications
1
104
0
Order By: Relevance
“…Another challenge is to characterize the capacity as a function of the public discussion rates. For the two-user case with one-way discussion, the capacity was characterized in [9,Theorem 2.6], extending the result in [3] for unlimited one-way discussion. A more explicit characterization was also derived for Gaussian sources in [15,16].…”
mentioning
confidence: 78%
See 3 more Smart Citations
“…Another challenge is to characterize the capacity as a function of the public discussion rates. For the two-user case with one-way discussion, the capacity was characterized in [9,Theorem 2.6], extending the result in [3] for unlimited one-way discussion. A more explicit characterization was also derived for Gaussian sources in [15,16].…”
mentioning
confidence: 78%
“…The simplest extension of secret key agreement beyond two users is by [9], which, in addition to the two active users who attempt to share a secret key, introduces a helper who can help discuss in public but need not share the secret key. The general multiterminal setting was subsequently formulated in [10], allowing arbitrary numbers of active users and helpers.…”
mentioning
confidence: 99%
See 2 more Smart Citations
“…is defined as the maximum of all possible secret key rates. In Csiszar and Narayan, 17 the secret key capacity between two nodes is specified as follow…”
Section: Adversary Modelmentioning
confidence: 99%