2017 IEEE International Symposium on Information Theory (ISIT) 2017
DOI: 10.1109/isit.2017.8006873
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic converse bound for secret key capacity in hidden Markov model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…securely shared with the help of certificates issued by trusted authorities), key-distribution centers (with which each of the parties is assumed to already share a secret key), privileged communication channels (like out-of-band channels [13], or superior wireless channels [3,19]) or sources of common randomness [1,4,12] (like the signal received from a satellite [12] or network metadata [8,16]).…”
mentioning
confidence: 99%
“…securely shared with the help of certificates issued by trusted authorities), key-distribution centers (with which each of the parties is assumed to already share a secret key), privileged communication channels (like out-of-band channels [13], or superior wireless channels [3,19]) or sources of common randomness [1,4,12] (like the signal received from a satellite [12] or network metadata [8,16]).…”
mentioning
confidence: 99%