We present a novel practical and provably secure key sharing scheme for Near Field Communication (NFC) devices. The scheme is based on sharing secret keys using the noisy wireless channel. We present two schemes based on the different modes of operation of typical NFC devices. Our numerical results establish the achievability of vanishing secrecy rates using the proposed techniques. Implementation of our proposed schemes on NFC-enabled Android and Nokia phones verifies our theoretical analysis and demonstrates the efficiency of our techniques in mitigating attacks at the expense of a minimal increase in the link setup time and a small loss in goodput. In addition, the proposed techniques have the advantage of both increased secrecy and goodput as the data packet length increases. This highlights their suitability for a wide range of NFC applications.

No abstract

Efficient scheduling of wireless resources has always been one of the most challenging tasks for wireless networks. To achieve throughput-optimality, traditional back-pressure algorithms calculate a maximal weight matching at each time slot. However, these algorithms need centralized scheduling with high complexity, and thus are not suitable for practical distributed implementations. A class of distributed queue-length-based CSMA algorithms have been proposed that achieve throughput optimality, which we refer to as regular throughput-optimal. These algorithms suffer from two problems: large delays, and temporal starvation. In this demo we demonstrate the operation of the v(t)-regulated CSMA algorithm that mitigates these two problems while provably retaining throughput optimality. The demo allows the participants to see the the performance advantage of v(t)-regulated CSMA over queue-length-based CSMA algorithms and change the different system parameters.