On full-duplex secure key generation with deterministic models

The potential of full-duplex in communication design has been recently considered for emerging technologies such as 5G. Moreover, full-duplex can play a crucial role in upcoming secure communication scenarios too. However, results in the literature are limited and only explore scenarios, where the wireless channel is used either for key generation or for secure messaging. Our first contribution is the invention of a deterministic model for full-duplex communication which can analyse both scenarios, depending on the channel gain. Moreover, the properties of the model allow investigating scenarios, which were out of reach before, e.g. mixed channel gain randomness. Furthermore, it can incorporate a recently proposed scheme, called product signalling, which utilizes secure messaging and measures the channel gain bits at the same time. We demonstrate the utility of the model by investigating pilot signalling, i.e. secure key generation and secure messaging, for a two-way wiretap channel model. While pilot signalling is useful for channels with short coherence time, we will see that cooperative jamming is needed for channels with long coherence time. The bit-level nature of our model enables jamming schemes where users can jam individual levels at Eve, in contrast to previous achievable schemes where the users either send messages or jamming signals.

[1]  Gerhard Wunder,et al.  On-the-fly secure key generation with deterministic models , 2017, 2017 IEEE International Conference on Communications (ICC).

[2]  Sachin Katti,et al.  Full duplex radios , 2013, SIGCOMM.

[3]  Alex Reznik,et al.  Extracting Secrecy from Jointly Gaussian Random Variables , 2006, 2006 IEEE International Symposium on Information Theory.

[4]  Amir K. Khandani,et al.  Two-way (true full-duplex) wireless , 2013, 2013 13th Canadian Workshop on Information Theory.

[5]  G. David Forney,et al.  On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener , 2004, ArXiv.

[6]  H. Vincent Poor,et al.  A Unified Framework for Key Agreement Over Wireless Fading Channels , 2009, IEEE Transactions on Information Forensics and Security.

[7]  Wunder Gerhard,et al.  RECiP: Wireless channel reciprocity restoration method for varying transmission power , 2016 .

[8]  Gerhard Wunder,et al.  Towards a constant-gap sum-capacity result for the Gaussian wiretap channel with a helper , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[9]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

[10]  Aylin Yener,et al.  The Role of Feedback in Two-Way Secure Communications , 2009, IEEE Transactions on Information Theory.

[11]  Alexandre J. Pierrot,et al.  Strongly Secure Communications Over the Two-Way Wiretap Channel , 2010, IEEE Transactions on Information Forensics and Security.

[12]  Ender Tekin,et al.  The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.

[13]  Aydin Sezgin,et al.  Full-duplex vs. half-duplex secret-key generation , 2015, 2015 IEEE International Workshop on Information Forensics and Security (WIFS).

[14]  Ashutosh Sabharwal,et al.  Experiment-Driven Characterization of Full-Duplex Wireless Systems , 2011, IEEE Transactions on Wireless Communications.

[15]  David Tse,et al.  Channel Identification: Secret Sharing using Reciprocity in Ultrawideband Channels , 2007 .

[16]  U. Maurer,et al.  Secret key agreement by public discussion from common information , 1993, IEEE Trans. Inf. Theory.

[17]  Amitav Mukherjee,et al.  Physical-Layer Security in the Internet of Things: Sensing and Communication Confidentiality Under Resource Constraints , 2015, Proceedings of the IEEE.

[18]  Wenliang Du,et al.  Key Generation From Wireless Channels , 2013 .

[19]  Urs Niesen,et al.  Interference alignment: From degrees-of-freedom to constant-gap capacity approximations , 2012, ISIT.

[20]  Moustafa Youssef,et al.  Achievable Secrecy Rate Regions for the Two-Way Wiretap Channel , 2010, IEEE Transactions on Information Theory.

[21]  Rudolf Ahlswede,et al.  Common randomness in information theory and cryptography - I: Secret sharing , 1993, IEEE Trans. Inf. Theory.