Related papers: Construction of Codes for Wiretap Channel and Secr…
It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We…
This paper characterizes the secret message capacity of three networks where two unicast sessions share some of the communication resources. Each network consists of erasure channels with state feedback. A passive eavesdropper is assumed to…
Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric…
Sparse superposition codes were originally proposed as a capacity-achieving communication scheme over the gaussian channel, whose coding matrices were made of i.i.d. gaussian entries.We extend this coding scheme to more generic ensembles of…
The capacity of the Gaussian wiretap channel model is analyzed when there are multiple antennas at the sender, intended receiver and eavesdropper. The associated channel matrices are fixed and known to all the terminals. A computable…
Optimal signaling for secrecy rate maximization in Gaussian MIMO wiretap channels is considered. While this channel has attracted a significant attention recently and a number of results have been obtained, including the proof of the…
Secure communications is becoming increasingly relevant in the development of space technology. Well established cryptographic technology is already in place and is expected to continue to be so. On the other hand, information theoretical…
We investigate the secret key agreement from correlated vector Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show…
This paper shows determining the secrecy capacity of a unicast network with uniform wiretap sets is at least as difficult as the k-unicast problem. In particular, we show that a general k-unicast problem can be reduced to the problem of…
In this paper we discuss the ability of channel codes to enhance cryptographic secrecy. Toward that end, we present the secrecy metric of degrees of freedom in an attacker's knowledge of the cryptogram, which is similar to equivocation.…
We consider the problem of securing a multicast network against a wiretapper that can intercept the packets on a limited number of arbitrary network links of his choice. We assume that the network implements network coding techniques to…
Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources to transmit. Here, two correlated sources across a channel with eavesdroppers are investigated, and…
Multi-user Gaussian MIMO wiretap channel is considered under interference power constraints (IPC), in addition to the total transmit power constraint (TPC). Algorithms for \textit{global} maximization of its secrecy rate are proposed. Their…
We consider a wiretap channel and use previously transmitted messages to generate a secret key which increases the secrecy capacity. This can be bootstrapped to increase the secrecy capacity to the Shannon capacity without using any…
The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random…
In recent years, a lot of attention has been devoted to efficient nearest neighbor search by means of similarity-preserving hashing. One of the plights of existing hashing techniques is the intrinsic trade-off between performance and…
Information-theoretically secure communications are possible when channel noise is usable and when the channel has an intrinsic characteristic that a legitimate receiver (Bob) can use the noise more advantageously than an eavesdropper…
Message Authentication Code (MAC) is a keyed function $f_K$ such that when Alice, who shares the secret $K$ with Bob, sends $f_K(M)$ to the latter, Bob will be assured of the integrity and authenticity of $M$. Traditionally, it is assumed…
In this paper we provide secrecy metrics applicable to physical-layer coding techniques with finite blocklengths over Gaussian and fading wiretap channel models. Our metrics go beyond some of the known practical secrecy measures, such as…
The design of lattice coset codes for wiretap channels is considered. Bounds on the eavesdropper's correct decoding probability and information leakage are first revisited. From these bounds, it is explicit that both the information leakage…