Fetching the paper…
Reading the bibliography…
We consider block codes for degraded wiretap channels in which the legitimate receiver decodes the message with an asymptotic error probability no larger than $\varepsilon$ but the leakage to the eavesdropper vanishes.
The coding of messages subject to chance errors
J. Wolfowitz · 1957
Earlier work this paper cites.
Information Theory and Reliable Communication
R. G. Gallager · 1968
Earlier work this paper cites.
The wire-tap channel
A. D. Wyner · 1975
Earlier work this paper cites.
The Gaussian wire-tap channel
S. Leung-Yan-Cheong and M. E. Hellman · 1975
Earlier work this paper cites.
On a special class of wiretap channels
S. Leung-Yan-Cheong · 1977
Earlier work this paper cites.
Broadcast channels with confidential messages
I. Csiszár and J. Körner · 1978
Earlier work this paper cites.
Approximation theory of output statistics
T. S. Han and S. Verdú · 1993
Earlier work this paper cites.
A general formula for channel capacity
S. Verdú and T. S. Han · 1994
Earlier work this paper cites.
Almost independence and secrecy capacity
I. Csiszár · 1996
Earlier work this paper cites.
On a special class of broadcast channels with confidential messages
M. van Dijk · 1997
Earlier work this paper cites.
New converses in the theory of identification via channels
Y. Steinberg · 1998
Earlier work this paper cites.
Large Deviations Techniques and Applications
A. Dembo and O. Zeitouni · 1998
Earlier work this paper cites.
An information-spectrum approach to capacity theorems for the general multiple-access channel
T. S. Han · 1998
Earlier work this paper cites.
Cryptographic distinguishability measures for quantum-mechanical states
C. A. Fuchs and J. van de Graaf · 1999
Earlier work this paper cites.
Optimistic Shannon coding theorems for arbitrary single-user systems
P.-N. Chen and F. Alajaji · 1999
Cited alongside, same era.
Information-theoretic key agreement: From weak to strong secrecy for free
U. Maurer and S. Wolf · 2000
Cited alongside, same era.
Information-Spectrum Methods in Information Theory
T. S. Han · 2003
Cited alongside, same era.
General formulas for capacity of classical-quantum channels
M. Hayashi and H. Nagaoka · 2003
Cited alongside, same era.
On an upper bound of the secrecy capacity for a general wiretap channel
H. Koga and N. Sato · 2005
Cited alongside, same era.
General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
M. Hayashi · 2006
The role of signal processing in meeting privacy challenges: An overview
L. Sankar, W. Trappe, K. Ramchandran, H. V. Poor, and M. Debbah · 2013
Later among the works it cites.
Strong secrecy from channel resolvability
M. Bloch and J. N. Laneman · 2013
Later among the works it cites.
How many queries will resolve common randomness?
H. Tyagi and P. Narayan · 2013
Later among the works it cites.
Secure multiplex coding attaining channel capacity in wiretap channels
D. Kobayashi, H. Yamamoto, and T. Ogawa · 2013
Later among the works it cites.
Probability: Theory and Examples
R. Durrett · 2013
Later among the works it cites.
Secret key agreement: General capacity and second-order asymptotics
M. Hayashi, H. Tyagi, and S. Watanabe · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
An algorithm for computing the secrecy capacity of broadcast channels with confidential messages
K. Yasui, T. Suko, and T. Matsushima · 2007
Cited alongside, same era.
On the secrecy capacity of arbitrary wiretap channels
M. Bloch and J. N. Laneman · 2008
Cited alongside, same era.
Information Theoretic Security
Y. Liang, H. V. Poor, and S. Shamai (Shitz) · 2009
Cited alongside, same era.
MIMO wiretap channels with arbitrarily varying eavesdropper channel states
X. He and A. Yener · 2010
Cited alongside, same era.
Physical Layer Security: From Information Theory to Security Engineering
M. Bloch and J. Barros · 2011
Cited alongside, same era.
Noisy channel coding and privacy amplification and information reconciliation
J. M. Renes and R. Renner · 2011
Cited alongside, same era.
H. Tyagi and S. Watanabe · 2014
Closest in time.
“Pretty strong” converse for the quantum capacity of degradable channels
C. Morgan and A. Winter · 2014
Closest in time.
Second-order coding rates for channels with state
M. Tomamichel and V. Y. F. Tan · 2014
Closest in time.
Reliability and security functions of the wiretap channel under cost constraint
T. S. Han, H. Endo, and M. Sasaki · 2014
Closest in time.
Strong converse and second-order asymptotics of channel resolvability
S. Watanabe and M. Hayashi · 2014
Closest in time.
Fixed error probability asymptotics for erasure and list decoding
V. Y. F. Tan and P. Moulin · 2014
Closest in time.
A formula for the capacity of the general Gel’fand-Pinsker channel
V. Y. F. Tan · 2014
Closest in time.