In this paper, we consider secure device-to-device (D2D) direct communication in cellular networks for wiretap channel. We assume that D2D transmitter sends its data to desired D2D receiver by reusing frequency resources originally allocated to the cellular link transmission between a base station (BS) and a cellular user. When there is a single eavesdropper (ED) in wiretap channel, we propose ...

We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits of informat...

Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary symmetric forward and backward channels is considered, and a combination of the proposed scheme and Maurer’s coding scheme is shown to achieve improved secrecy rates. The scenario of a Gaussian channel with perfect outpu...

The coding problem for wiretap channels with causal channel state information available at the encoder and/or the decoder is studied under the strong secrecy criterion. This problem consists of two aspects: one is due to naive wiretap channel coding and the other is due to one-time pad cipher based on the secret key agreement between Alice and Bob using the channel state information. These two ...

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the problem of secret communication over the Gaussian broadcast channel, where a multi-antenna transmitter sends independent confidential messages to two users wit...

The role of multiple antennas for secure communication is investigated within the framework of Wyner’s wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper have multiple antennas, the intended receiver has a single antenna, and the channel matrices are fixed and known to all the terminals, and show that a beamforming strategy...

We demonstrate an intuitive relation between conditional entropy and conditional expectation that is useful when one want to compare them as measurement tools to evaluate secrecy systems. In particular, we give a Security Property applicable to general vector variables in , using measurement based on vector quadratic distance, and we show that one can derive variables that can be measured with ...

We show strongly secret achievable rate regions for two different wiretap multiple-access channel coding problems. In the first problem, each encoder has a private message and both together have a common message to transmit. The encoders have entropy-limited access to common randomness. If no common randomness is available, then the achievable region derived here does not allow for the secret t...

The fundamental limits of biometric identification systems under a strong secrecy criterion are investigated. In the previous studies this scenario, trade-off among secrecy, template, privacy- and secrecy-leakages has been revealed in case where there is only one user, while multiple users not discussed yet. study, we consider system with exponentially many users, characterize capacity region r...