The secrecy capacity of the arbitrarily varying wiretap channel under list decoding
From MaRDI portal
Publication:1726007
DOI10.3934/amc.2019002zbMath1454.94034OpenAlexW2904317023WikidataQ128726315 ScholiaQ128726315MaRDI QIDQ1726007
Rafael F. Schaefer, Ahmed S. Mansour, Holger Boche
Publication date: 15 February 2019
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2019002
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Source coding (94A29)
Cites Work
- Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
- Capacity of the arbitrarily varying channel under list decoding
- A Channel Under Simultaneous Jamming and Eavesdropping Attack—Correlated Random Coding Capacities Under Strong Secrecy Criteria
- The Arbitrarily Varying Wiretap Channel—Secret Randomness, Stability, and Super-Activation
- On the Deterministic Code Capacity Region of an Arbitrarily Varying Multiple-Access Channel Under List Decoding
- Information Theoretic Security
- The capacity of the arbitrarily varying channel revisited: positivity, constraints
- The Wire-Tap Channel
- Elimination of correlation in random codes for arbitrarily varying channels
- The smallest list for the arbitrarily varying channel
- Reliable communication under channel uncertainty
- Capacity Results for Arbitrarily Varying Wiretap Channels
- The Capacities of Certain Channel Classes Under Random Coding
This page was built for publication: The secrecy capacity of the arbitrarily varying wiretap channel under list decoding