Error and Secrecy Exponents for Wiretap Channels under Two-Fold Cost Constraints

[1]  Aaron D. Wyner,et al.  Capacity and error-exponent for the direct detection photon channel-Part II , 1988, IEEE Trans. Inf. Theory.

[2]  Matthieu R. Bloch,et al.  Strong Secrecy From Channel Resolvability , 2011, IEEE Transactions on Information Theory.

[3]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[4]  Masahide Sasaki,et al.  Reliability and Secrecy Functions of the Wiretap Channel Under Cost Constraint , 2013, IEEE Transactions on Information Theory.

[5]  Sergio Verdú,et al.  Approximation theory of output statistics , 1993, IEEE Trans. Inf. Theory.

[6]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[7]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[8]  Masahito Hayashi,et al.  General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel , 2006, IEEE Transactions on Information Theory.

[9]  Masahito Hayashi,et al.  Exponential Decreasing Rate of Leaked Information in Universal Random Privacy Amplification , 2009, IEEE Transactions on Information Theory.