| 1. |
- Babaheidarian, P., et al.
(författare)
-
Compute-and-forward can buy secrecy cheap
- 2015
-
Ingår i: IEEE International Symposium on Information Theory - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467377041 ; , s. 2475-2479
-
Konferensbidrag (refereegranskat)abstract
- We consider a Gaussian multiple access channel with K transmitters, a (intended) receiver and an external eavesdropper. The transmitters wish to reliably communicate with the receiver while concealing their messages from the eavesdropper. This scenario has been investigated in prior works using two different coding techniques; the random i.i.d. Gaussian coding and the signal alignment coding. Although, the latter offers promising results in a very high SNR regime, extending these results to the finite SNR regime is a challenging task. In this paper, we propose a new lattice alignment scheme based on the compute-and-forward framework which works at any finite SNR. We show that our achievable secure sum rate scales with log(SNR) and hence, in most SNR regimes, our scheme outperforms the random coding scheme in which the secure sum rate does not grow with power. Furthermore, we show that our result matches the prior work in the infinite SNR regime. Additionally, we analyze our result numerically.
|
|
| 2. |
- Babaheidarian, P., et al.
(författare)
-
Preserving confidentiality in the Gaussian broadcast channel using compute-and-forward
- 2017
-
Ingår i: 2017 51st Annual Conference on Information Sciences and Systems, CISS 2017. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509047802
-
Konferensbidrag (refereegranskat)abstract
- We study the transmission of confidential messages across a wireless broadcast channel with K > 2 receivers and K helpers. The goal is to transmit all messages reliably to their intended receivers while keeping them confidential from the unintended receivers. We design a codebook based on nested lattice structure, cooperative jamming, lattice alignment, and i.i.d. coding. Moreover, we exploit the asymmetric compute-and-forward decoding strategy to handle finite SNR regimes. Unlike previous alignment schemes, our achievable rates are attainable at any finite SNR value. Also, we show that our scheme achieves the optimal sum secure degrees of freedom of 1 for the K-receiver Gaussian broadcast channel with K confidential messages and K helpers.
|
|
| 3. |
- Babaheidarian, P., et al.
(författare)
-
Scalable Security in Interference Channels with Arbitrary Number of Users
- 2020
-
Ingår i: Proceedings of 2020 International Symposium on Information Theory and its Applications, ISITA 2020. - : Institute of Electrical and Electronics Engineers Inc.. ; , s. 402-406
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it should remain ignorant regarding messages intended for other receivers. Our scheme relies ontransmitters to collectively ensure the confidentiality of the transmitted messages using a cooperative jamming technique and lattice alignment. The Asymmetric compute-and-forward framework is used to perform the decoding operation. The proposed scheme is the first asymptotically optimal achievable scheme for this security scenario which scales to arbitrary number of users and works for any finite-valued SNR. Also, our scheme achieves the upper bound sum secure degrees of freedom of 1 without using external helpers and thus the achievable rates lie within constant gap from sum secure capacity.
|
|
| 4. |
- Babaheidarian, P., et al.
(författare)
-
Security in the Gaussian interference channel : Weak and moderately weak interference regimes
- 2016
-
Ingår i: 2016 IEEE International Symposium on Information Theory - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509018062 ; , s. 2434-2438
-
Konferensbidrag (refereegranskat)abstract
- We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver. Prior work investigated the performance of two different approaches for this scenario; i.i.d. Gaussian random codes and real alignment of structured codes. While the latter achieves the optimal sum secure degrees of freedom (s.d.o.f.), its extension to finite SNR regimes is challenging. In this paper, we propose a new achievability scheme for the weak and the moderately weak interference regimes, in which the reliability as well as the confidentiality of the transmitted messages are maintained at any finite SNR value. Our scheme uses lattice structure, structured jamming codewords, and lattice alignment in the encoding and the asymmetric compute-and-forward strategy in the decoding. We show that our lower bound on the sum secure rates scales linearly with log(SNR) and hence, it outperforms i.i.d. Gaussian random codes. Furthermore, we show that our achievable result is asymptotically optimal. Finally, we provide a discussion on an extension of our scheme to K > 2 users.
|
|
