General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel
Reads0
Chats0
TLDR
Several nonasymptotic formulas are established in channel resolvability and identification capacity and they are applied to the wiretap channel, and lower bounds of the exponents of error probability and the wiretapper's information in the wiretAP channel are obtained.Abstract:
Several nonasymptotic formulas are established in channel resolvability and identification capacity, and they are applied to the wiretap channel. By using these formulas, the epsi capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem proposed by Han and Verduacute. Moreover, we obtain lower bounds of the exponents of error probability and the wiretapper's information in the wiretap channelread more
Citations
More filters
Journal ArticleDOI
Wireless Information-Theoretic Security
TL;DR: A practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security and is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.
Journal ArticleDOI
Secure Communication Over Fading Channels
TL;DR: In this article, the secrecy capacity region of the fading broadcast channel with confidential messages (BCC) was investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1.
Posted Content
Secure Communication over Fading Channels
TL;DR: In this paper, the secrecy capacity region of the parallel Gaussian broadcast channel with confidential messages (BCC) with independent sub-channels is investigated, and the optimal source power allocations that achieve the boundary of the secrecy region are derived.
Book
Physical-Layer Security: From Information Theory to Security Engineering
Matthieu R. Bloch,Joao Barros +1 more
TL;DR: In this article, the theoretical foundations, practical implementation, challenges and benefits of a groundbreaking new model for secure communication are presented, using a bottom-up approach from the link level all the way to end-to-end architectures.
References
More filters
Journal ArticleDOI
The wire-tap channel
TL;DR: This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.
Journal ArticleDOI
A general formula for channel capacity
Sergio Verdu,Te Sun Han +1 more
TL;DR: A formula for the capacity of arbitrary single-user channels without feedback is proved and capacity is shown to equal the supremum, over all input processes, of the input-output inf-information rate defined as the liminf in probability of the normalized information density.
Book
Information-Spectrum Methods in Information Theory
太舜 韓,Hiroki Koga +1 more
TL;DR: This paper presents a meta-analyses of source and channel coding for multi-Terminal Information Theory, which aims to clarify the role of symbols in the development of information theory.