We study the effect of pricing on the secrecy capacity of multi-terminal networks. We propose a linear and a non-linear pricing function for user terminals and present mathematical formulations to maximize the individual secrecy capacity of each transmitter-receiver pair as well as the sum secrecy capacity of the system. We show that these pricing models result in better energy efficiency and a...

Relay communication has advantages over direct transmission in terms of secrecy capacity. In this paper, the performance of secrecy, offered by multihop decode-and-forward relaying, is investigated and compared to its counterpart in direct transmission. Three key performance measures are derived over Rayleigh fading channels: probability of non-zero secrecy capacity, secure outage probability a...

We establish the Ahlswede dichotomy for arbitrarily varying classicalquantum wiretap channels, i.e., either the deterministic secrecy capacity of the channel is zero, or it equals its randomness-assisted secrecy capacity. We analyze the secrecy capacity of these channels when the sender and the receiver use various resources. It turns out that randomness, common randomness, and correlation as r...

by Ebrahim MolavianJazi In this thesis, we consider a class of information protection problems requiring confidentiality (secrecy) from eavesdropping and integrity (reliability) from jamming in an information-theoretic context. For this purpose, we introduce the arbitrarily varying wire-tap channel (AVWTC) model consisting of a family of wiretap channels indexed by some state that is selected b...

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper’s channel, we consider resolvability-based constructions, which associate to each message...

In this paper, the one-sided secrecy of two-way wiretap channel with feedback is investigated, where the confidential messages of one user through multiple transmissions is guaranteed secure against an external eavesdropper. For one thing, one-sided secrecy satisfies the secure demand of many practical scenarios. For another, the secrecy is measured over many blocks since the correlation betwee...

In this paper, the information-theoretic secrecy for the log-normal fading channel is investigated. In particular, the closed-form expressions of the probability of strictly positive secrecy capacity are derived for two wireless communication systems, with single eavesdropper and double eavesdroppers, respectively. Keywords-Information-theoretic secrecy, log-normal fading, secrecy capacity.

We study the identification capacity of classical-quantum channels (“cq-channels”), under channel uncertainty and privacy constraints. To be precise, we consider first compound memoryless cq-channels and determine their identification capacity; then we add an eavesdropper, considering compound memoryless wiretap cqq-channels, and determine their secret identification capacity. In the first case...

We determine the secrecy capacities of arbitrarily varying quantum channels. Both secrecy capacity with average error probability and with maximal error probability are derived. The code we construct fulfills a stringent secrecy requirement, which is called the strong code concept. We determine when the secrecy capacity is a continuous function of the system parameters and completely characteri...

In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users’ messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the joint secrecy is impossible to achieve both positive secrecy rates of two users. For another, the individual secrecy satisfies the secrecy demand of many pract...