Lattice Coding for Strongly Secure Compute-and-Forward in a Bidirectional Relay

Shashank, V and Kashyap, Navin (2013) Lattice Coding for Strongly Secure Compute-and-Forward in a Bidirectional Relay. In: IEEE International Symposium on Information Theory Proceedings (ISIT), JUL 07-12, 2013, Istanbul, TURKEY, pp. 2775-2779.

PDF IEEE_ISIT_2775_2013.pdf - Published Version Restricted to Registered users only Download (180kB) | Request a copy

Abstract

We study the problem of secure bidirectional relaying in the presence of an ``honest but curious'' relay. We consider the setting where all links between nodes are additive white Gaussian noise (AWGN) channels, and show that using nested lattice codes, it is possible to obtain strong secrecy. A randomized encoder based on probability mass functions obtained by sampling the Gaussian function is used, and we show that the mutual information between the secret messages and the vector received by the relay is arbitrarily small for large block lengths. We determine sufficient conditions for secure and reliable communication, and find achievable rates. We then extend the results to the case of secure relaying in a multi-hop network with K + 1 hops.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belongs to the IEEE International Symposium on Information Theory Proceedings (ISIT), Istanbul, TURKEY, JUL 07-12, 2013
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	19 Aug 2016 10:22
Last Modified:	19 Aug 2016 10:22
URI:	http://eprints.iisc.ac.in/id/eprint/54444

Actions (login required)

View Item