Demonstrating practical provably secure multi-node communication

We demonstrate a practical and provably-secure multi-node 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. We demonstrate the internal details of the technique and quantify the secrecy-overhead tradeoff. Our implementation is based on Crossbow Telosb motes, equipped with CC2420 radio chips. The demo will allow the attendees to see the scheme in action and how the scheme can achieve significant secrecy gains with vanishing outage probability. The demo also compared the proposed scheme to other direct extensions the two node case.

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

[2]  RSA Laboratories , 1997 .

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

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