메뉴 건너뛰기




Volumn , Issue , 2014, Pages 148-151

Strong converse for a degraded wiretap channel via active hypothesis testing

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE HYPOTHESIS; PROBABILITY OF ERRORS; STRONG CONVERSE; TWO CHANNEL; UPPER BOUND; WIRE-TAP CHANNELS;

EID: 84946689015     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2014.7028449     Document Type: Conference Paper
Times cited : (27)

References (19)
  • 1
    • 0027629488 scopus 로고
    • Common randomness in information theory and cryptography-part i: Secret sharing
    • July
    • R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography-part i: Secret sharing," IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, July 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.4 , pp. 1121-1132
    • Ahlswede, R.1    Csiszár, I.2
  • 2
    • 0029706655 scopus 로고    scopus 로고
    • Almost independence and secrecy capacity
    • I. Csiszár, "Almost independence and secrecy capacity," Prob. Pered. Inform., vol. 32, no. 1, pp. 48-57, 1996.
    • (1996) Prob. Pered. Inform. , vol.32 , Issue.1 , pp. 48-57
    • Csiszár, I.1
  • 3
    • 0017973511 scopus 로고
    • Broadcast channels with confidential messages
    • May
    • I. Csiszar and J. Korner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. 24, no. 3, pp. 339-348, May 1978.
    • (1978) IEEE Trans. Inf. Theory , vol.24 , Issue.3 , pp. 339-348
    • Csiszar, I.1    Korner, J.2
  • 4
    • 33645727315 scopus 로고    scopus 로고
    • General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
    • April
    • M. Hayashi, "General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562-1575, April 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.4 , pp. 1562-1575
    • Hayashi, M.1
  • 6
    • 68249152197 scopus 로고    scopus 로고
    • Discrimination of two channels by adaptive methods and its application to quantum system
    • Aug
    • -, "Discrimination of two channels by adaptive methods and its application to quantum system," IEEE Trans. Inf. Theory, vol. 55, no. 8, pp. 3807-3820, Aug 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.8 , pp. 3807-3820
    • Hayashi, M.1
  • 10
    • 0027599802 scopus 로고
    • Secret key agreement by public discussion from common information
    • May
    • U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.3 , pp. 733-742
    • Maurer, U.M.1
  • 11
    • 84891514300 scopus 로고    scopus 로고
    • Pretty strong, converse for the quantum capacity of degradable channels
    • Jan
    • C. Morgan and A. Winter, ""pretty strong" converse for the quantum capacity of degradable channels," IEEE Trans. Inf. Theory, vol. 60, no. 1, pp. 317-333, Jan 2014.
    • (2014) IEEE Trans. Inf. Theory , vol.60 , Issue.1 , pp. 317-333
    • Morgan, C.1    Winter, A.2
  • 12
    • 0041450642 scopus 로고    scopus 로고
    • Strong converse theorems in quantum information theory
    • Univ. Tokyo, Tokyo, Japan, September
    • H. Nagaoka, "Strong converse theorems in quantum information theory," in ERATO Workshop on Quantum Information Science 2001,Univ. Tokyo, Tokyo, Japan, September 68, 2001, p. 33.
    • (2001) ERATO Workshop on Quantum Information Science 2001 , vol.68 , pp. 33
    • Nagaoka, H.1
  • 13
    • 77951624674 scopus 로고    scopus 로고
    • Channel coding rate in the finite blocklength regime
    • May
    • Y. Polyanskiy, H. V. Poor, and S. Verdú, "Channel coding rate in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
    • (2010) IEEE Trans. Inf. Theory , vol.56 , Issue.5 , pp. 2307-2359
    • Polyanskiy, Y.1    Poor, H.V.2    Verdú, S.3
  • 16
    • 84882971734 scopus 로고    scopus 로고
    • How many queries will resolve common randomness
    • September
    • H. Tyagi and P. Narayan, "How many queries will resolve common randomness" IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5363-5378, September 2013.
    • (2013) IEEE Trans. Inf. Theory , vol.59 , Issue.9 , pp. 5363-5378
    • Tyagi, H.1    Narayan, P.2
  • 17
    • 84901684455 scopus 로고    scopus 로고
    • A bound for multiparty secret key agreement and implications for a problem of secure computing
    • H. Tyagi and S. Watanabe, "A bound for multiparty secret key agreement and implications for a problem of secure computing," in Proc. EUROCRYPT, 2014, pp. 369-386.
    • (2014) Proc. EUROCRYPT , pp. 369-386
    • Tyagi, H.1    Watanabe, S.2
  • 19
    • 0016562514 scopus 로고
    • The wiretap channel
    • October
    • A. D. Wyner, "The wiretap channel," Bell System Technical Journal, vol. 54, no. 8, pp. 1355-1367, October 1975.
    • (1975) Bell System Technical Journal , vol.54 , Issue.8 , pp. 1355-1367
    • Wyner, A.D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.