Proceedings ArticleDOI
Finite-state wiretap channels: Secrecy under memory constraints
Yogesh Sankarasubramaniam,Andrew Thangaraj,Kapali Viswanathan +2 more
- pp 115-119
TLDR
This work develops a stochastic algorithm for computing tight lower bounds on the secrecy capacity of a less-noisy FSWC, and provides numerical comparisons between secrecy capacities with and without memory, and provide specific targets for code design.Abstract:
Information-theoretic security offered by the wiretap channel model has been extensively studied for various scenarios recently. One scenario that has not received much attention is secrecy for systems with memory in the form of input constraints or inter-symbol interference (ISI). In this work, we consider finite state wiretap channels (FSWCs), which model the scenario of secrecy with memory. Using results on secrecy capacity for arbitrary wiretap channels, we first arrive at the secrecy capacity of a FSWC. Then, we develop a stochastic algorithm for computing tight lower bounds on the secrecy capacity of a less-noisy FSWC, and illustrate the computation through examples. Our results provide numerical comparisons between secrecy capacities with and without memory, and provide specific targets for code design.read more
Citations
More filters
Journal ArticleDOI
Strong Secrecy From Channel Resolvability
TL;DR: It is shown that at least for symmetric wiretap channels, random capacity- based constructions fail to achieve the strong secrecy capacity, while channel-resolvability-based constructions achieve it.
Posted Content
Strong Secrecy from Channel Resolvability
TL;DR: In this article, the authors consider channel resolvability-based constructions, which associate to each message a sub-code that operates just above the capacity of the eavesdropper's channel.
Journal ArticleDOI
Finite State Markov Wiretap Channel With Delayed Feedback
TL;DR: In this paper, the authors investigated the security issue in the mobile wireless communication systems by considering the finite-state Markov wiretap channel (FSM-WC), where the state is perfectly known by the legitimate receiver and the eavesdropper, and through a noiseless feedback channel, a legitimate receiver sends his received channel output and the state back to the transmitter after some time delay.
Posted Content
Secrecy from Resolvability
TL;DR: It is shown that, at least for symmetric wiretap channels, random capacity- based constructions fail to achieve the strong secrecy capacity while resolvability-based constructions achieve it, and the secrecy-capacity region of arbitrary broadcast channels with confidential messages and a cost constraint for strong secrecy metrics is established.
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
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
Journal ArticleDOI
Broadcast channels with confidential messages
Imre Csiszár,János Körner +1 more
TL;DR: Given two discrete memoryless channels (DMC's) with a common input, a single-letter characterization is given of the achievable triples where R_{e} is the equivocation rate and the related source-channel matching problem is settled.