Capacity results for arbitrarily varying wiretap channels

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7777, Issue , 2013, Pages 123-144

  Bjelaković, Igor ^a   Boche, Holger ^a   Sommerfeld, Jochen ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

active wiretapper; arbitrarily varying wiretap channels; classes of attacks; jamming; strong secrecy

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; JAMMING;

ACTIVE WIRETAPPER; CLASSES OF ATTACKS; DICHOTOMY RESULTS; ELIMINATION TECHNIQUES; RELIABILITY CRITERION; ROBUSTIFICATION; STRONG SECRECIES; WIRE-TAP CHANNELS;

CODES (SYMBOLS);

EID: 84875981940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36899-8_5     Document Type: Conference Paper

References (16)

1. Ahlswede, R.: A note on the existence of the weak capacity for channels with arbitrarily varying channel probability functions and its relation to shannon's zero error capacity. The Annals of Mathematical Statistics 41(3), 1027-1033 (1970
2. Ahlswede, R.: Elimination of correlation in random codes for arbitrarily varying channels. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete 44, 159-175 (1978
3. Ahlswede, R.: Arbitrarily varying channels with states sequence known to the sender. IEEE Trans. on Inf. Theory 32(5), 621-629 (1986
4. Ahlswede, R., Csisz'ar, I.: Common randomness in information theory and cryptography-part I: Secret sharing. IEEE Trans. on Inf. Theory 39(4), 1121-1132 (1993
5. Ahlswede, R., Csisz'ar, I.: Common randomness in information theory and cryptography-part ii: Cr capacity. IEEE Trans. on Inf. Theory 44(1), 225-240 (1998
6. Ahlswede, R., Wolfowitz, J.: The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet. Z. Wahrscheinlichkeitstheorie verw. Gebiete 15, 186-194 (1970
7. Bjelacovi'c, I., Boche, H., Sommerfeld, J.: Capacity results for compound wiretap channels. In: Proc. IEEE Information Theory Workshop, pp. 60-64 (2011
8. Bjelacovi'c, I., Boche, H., Sommerfeld, J.: Secrecy results for compound wiretap channels. Submitted to Problems of Information Transmission (2011), http://arxiv.org/abs/1106.2013v1
9. Bloch, M., Laneman, J.: On the secrecy capacity of arbitrary wiretap channel. In: Forty-Sixth Annual Allerton Conference, Allerton House, Illinois, USA (2008
10. Csisz'ar, I., Körner, J.: Information Theory: Coding Theorems for Discrete Memoryless Systems. Akademiai Kiado (1981
11. Csisz'ar, I., Narayan, P.: The capacity of the arbitrarily varying channel revisited: Positivity, constraints. IEEE Trans. on Inf. Theory 34(2), 181-193 (1988
12. Ericson, T.: Exponential error bounds for random codes in the arbitrarily varying channel. IEEE Trans. on Inf. Theory 31(1), 42-48 (1985
13. Liang, Y., Kramer, G., Poor, H., Shamai, S.: Compound Wiretap Channels. EURASIP Journal on Wireless Communications and Networking (2008
14. MolavianJazi, E.: Secure Communications over Arbitrarily VaryingWiretap Channels. Master's thesis, Graduate School of the University of Notre Dame (2009
15. Shannon, C.: The zero error capacity of a noisy channel. IRE Trans. Information Theory IT-2, 8-19 (1956
16. Wyrembelski, R.F., Bjelakovi'c, I., Oechtering, T.J., Boche, H.: Optimal coding strategies for bidirectional broadcast channels under channel uncertainty. IEEE Trans. on Communications 58(10), 2984-2994 (2010