A mobile world of security - The model

We propose a novel approach to establish cryptographic keys among mobile users and a networking infrastructure. Our approach comes at a low cost and can either be used as an alternative to existing solutions or can be employed in a complementary way. Our basic observation is that users are often very mobile. As they interact with the infrastructure, each of them leaves a unique trace behind, known both to the users and the infrastructure. We can leverage this shared information to create shared secret keys, with little or no change of existing mobile communication systems. We show that we can achieve (almost passively) a rate of roughly 0∶1 bits per second.

[1]  Daniel Krajzewicz,et al.  The Open Source Traffic Simulation Package SUMO , 2006 .

[2]  Hugo Krawczyk,et al.  Strengthening Digital Signatures Via Randomized Hashing , 2006, CRYPTO.

[3]  Ueli Maurer,et al.  Secret-key agreement over unauthenticated public channels I: Definitions and a completeness result , 2003, IEEE Trans. Inf. Theory.

[4]  Sandeep Chennakeshu,et al.  Secure information transmission for mobile radio , 2000, IEEE Communications Letters.

[5]  Akbar M. Sayeed,et al.  Secure wireless communications: Secret keys through multipath , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[6]  David Tse,et al.  Channel Identification: Secret Sharing Using Reciprocity in Ultrawideband Channels , 2007, IEEE Transactions on Information Forensics and Security.

[7]  Ueli Maurer,et al.  Generalized privacy amplification , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[8]  Ernst Bonek,et al.  Mobility model of vehicle-borne terminals in urban cellular systems , 2003, IEEE Trans. Veh. Technol..

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

[10]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[11]  Sneha Kumar Kasera,et al.  Robust uncorrelated bit extraction methodologies for wireless sensors , 2010, IPSN '10.

[12]  Aggelos Kiayias,et al.  Robust key generation from signal envelopes in wireless networks , 2007, CCS '07.

[13]  Wade Trappe,et al.  Radio-telepathy: extracting a secret key from an unauthenticated wireless channel , 2008, MobiCom '08.

[14]  John McEachen,et al.  Unconditionally secure communications over fading channels , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[15]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[16]  T. Aono,et al.  Wireless secret key generation exploiting reactance-domain scalar response of multipath fading channels , 2005, IEEE Transactions on Antennas and Propagation.

[17]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[18]  Christina Fragouli,et al.  A Mobile World of Security , 2011, CISS 2011.

[19]  Wade Trappe,et al.  Information-Theoretically Secret Key Generation for Fading Wireless Channels , 2009, IEEE Transactions on Information Forensics and Security.

[20]  Rao Yarlagadda,et al.  Unconventional cryptographic keying variable management , 1995, IEEE Trans. Commun..

[21]  Donald F. Towsley,et al.  Secure Wireless Communication with Dynamic Secrets , 2010, 2010 Proceedings IEEE INFOCOM.