Secrecy results for compound wiretap channels
Tóm tắt
We derive a lower bound on the secrecy capacity of a compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. [1], thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability criterion, and with a decoder that is robust against the effect of randomization in the encoding. This relieves us from the need of decoding the randomization parameter, which is in general impossible within this model. Moreover, we prove a lower bound on the secrecy capacity of a compound wiretap channel without channel state information and derive a multiletter expression for the capacity in this communication scenario.
Tài liệu tham khảo
citation_title=Compound Wiretap Channels; citation_inbook_title=EURASIP J. Wireless Commun. Networking; citation_publication_date=2009; citation_id=CR1; citation_author=Y Liang; citation_author=G Kramer; citation_author=HV Poor; citation_author=S Shamai Shitz
Bloch, M. and Laneman, J.N., On the Secrecy Capacity of Arbitrary Wiretap Channels, in Proc. 46th Ann. Allerton Conf. on Communication, Control, and Computing, Monticello, IL, USA, 2008, pp. 818–825.
citation_title=Capacity Results for Arbitrarily Varying Wiretap Channels, accepted for publication in LNCS Volume in Memory of R. Ahlswede; citation_publication_date=2012; citation_id=CR3; citation_author=I Bjelaković; citation_author=H Boche; citation_author=J Sommerfeld
citation_journal_title=Bell System Tech. J.; citation_title=The Wire-Tap Channel; citation_author=AD Wyner; citation_volume=54; citation_issue=8; citation_publication_date=1975; citation_pages=1355-1387; citation_id=CR4
citation_journal_title=Probl. Peredachi Inf.; citation_title=Almost Independence and Secrecy Capacity; citation_author=I Csiszár; citation_volume=32; citation_issue=1; citation_publication_date=1996; citation_pages=48-57; citation_id=CR5
citation_title=Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free; citation_inbook_title=Advances in Cryptology — EUROCRYPT 2000 (Proc. Int. Conf. on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, 2000); citation_publication_date=2000; citation_pages=351-368; citation_id=CR6; citation_author=UM Maurer; citation_author=S Wolf; citation_publisher=Springer
citation_journal_title=Probl. Peredachi Inf.; citation_title=Quantum Privacy and Quantum Wiretap Channels; citation_author=N Cai, A Winter, RW Yeung; citation_volume=40; citation_issue=4; citation_publication_date=2004; citation_pages=26-47; citation_id=CR7
citation_journal_title=IEEE Trans. Inform. Theory; citation_title=The Private Classical Capacity and Quantum Capacity of a Quantum Channel; citation_author=I Devetak; citation_volume=51; citation_issue=1; citation_publication_date=2005; citation_pages=44-55; citation_doi=10.1109/TIT.2004.839515; citation_id=CR8
citation_journal_title=Ann. Math. Statist.; citation_title=The Capacity of a Class of Channels; citation_author=D Blackwell, L Breiman, AJ Thomasian; citation_volume=30; citation_issue=4; citation_publication_date=1959; citation_pages=1229-1241; citation_doi=10.1214/aoms/1177706106; citation_id=CR9
citation_journal_title=IEEE Trans. Inform. Theory; citation_title=Identification via Channels; citation_author=R Ahlswede, G Dueck; citation_volume=35; citation_issue=1; citation_publication_date=1989; citation_pages=15-29; citation_doi=10.1109/18.42172; citation_id=CR10
citation_journal_title=Discrete Appl. Math.; citation_title=General Theory of Information Transfer: Updated; citation_author=R Ahlswede; citation_volume=156; citation_issue=9; citation_publication_date=2008; citation_pages=1348-1388; citation_doi=10.1016/j.dam.2007.07.007; citation_id=CR11
citation_title=Information Theory: Coding Theorems for Discrete Memoryless Systems; citation_publication_date=2011; citation_id=CR12; citation_author=I Csiszár; citation_author=J Körner; citation_publisher=Cambridge Univ. Press
citation_journal_title=IEEE Trans. Commun.; citation_title=Optimal Coding Strategies for Bidirectional Broadcast Channels under Channel Uncertainty; citation_author=RF Wyrembelski, I Bjelaković, TJ Oechtering, H Boche; citation_volume=58; citation_issue=10; citation_publication_date=2010; citation_pages=2984-2994; citation_doi=10.1109/TCOMM.2010.082010.090170; citation_id=CR13
citation_title=Concentration of Measure for the Analysis of Randomized Algorithms; citation_publication_date=2009; citation_id=CR14; citation_author=DP Dubhashi; citation_author=A Panconesi; citation_publisher=Cambridge Univ. Press
citation_journal_title=IEEE Trans. Inform. Theory; citation_title=Strong Converse for Identification via Quantum Channels; citation_author=R Ahlswede, A Winter; citation_volume=48; citation_issue=3; citation_publication_date=2002; citation_pages=569-579; citation_doi=10.1109/18.985947; citation_id=CR15
citation_journal_title=Math. Z.; citation_title=Über die Verteilung der Wurzeln bei gewissen algebraischen Gleichungen mit ganzzahligen Koeffizienten; citation_author=M Fekete; citation_volume=17; citation_issue=1; citation_publication_date=1923; citation_pages=228-249; citation_doi=10.1007/BF01504345; citation_id=CR16
citation_journal_title=IEEE Trans. Inform. Theory; citation_title=Common Randomness in Information Theory and Crytography-Part I: Secret Sharing; citation_author=R Ahlswede, I Csiszár; citation_volume=39; citation_issue=4; citation_publication_date=1993; citation_pages=1121-1132; citation_doi=10.1109/18.243431; citation_id=CR17