Practical provably secure multi-node communication

We present a practical and provably-secure multinode communication scheme in the presence of a passive eavesdropper. The scheme is based on a random scheduling approach that hides the identity of the transmitter from the eavesdropper. This random scheduling leads to ambiguity at the eavesdropper with regard to the origin of the transmitted frame. Implementation of the scheme over Crossbow Telosb motes, equipped with CC2420 radio chips, shows that the scheme can achieve significant secrecy gain with vanishing outage probability. In addition, it has significant overhead advantage over direct extensions to two-nodes schemes. The technique also has the advantage of allowing inactive nodes to leverage sleep mode to further save energy.

[1]  Anish Arora,et al.  Dialog codes for secure wireless communications , 2009, 2009 International Conference on Information Processing in Sensor Networks.

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

[3]  Moustafa Youssef,et al.  Demonstrating practical provably secure multi-node communication , 2012, WiNTECH '12.

[4]  Moustafa Youssef,et al.  ARQ secrecy: From theory to practice , 2009, 2009 IEEE Information Theory Workshop.

[5]  Ruoheng Liu,et al.  On the Achievable Secrecy Throughput of Block Fading Channels with No Channel State Information at Transmitter , 2007, 2007 41st Annual Conference on Information Sciences and Systems.

[6]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[7]  Moustafa Youssef,et al.  ARQ security in Wi-Fi and RFID networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[8]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[9]  Moustafa Youssef,et al.  Keys Through ARQ: Theory and Practice , 2011, IEEE Transactions on Information Forensics and Security.

[10]  Moustafa Youssef,et al.  Opportunistic Secrecy with a Strict Delay Constraint , 2013, IEEE Transactions on Communications.

[11]  Hesham El Gamal,et al.  On the Secrecy Capacity of Fading Channels , 2006, 2007 IEEE International Symposium on Information Theory.

[12]  Ueli Maurer,et al.  Secret key agreement by public discussion , 1993 .

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

[14]  Moustafa Youssef,et al.  Practical Provably Secure Communication for Half-Duplex Radios , 2011, 2011 IEEE International Conference on Communications (ICC).