Authenticating ad hoc networks by comparison of short digests

We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted third parties, but rather using a minimum of work by human user(s) implementing the low-band width unspoofable channels between them. We develop both pairwise and group protocols which are essentially optimal in human effort and, given that, computation. We compare our protocols with recent pairwise protocols proposed by, for example, Hoepman and Vaudenay. We introduce and analyse a new cryptographic primitive-a digest function-that is closely related to short-output universal hash functions.

[1]  Hu Chuan-Gan,et al.  On The Shift Register Sequences , 2004 .

[2]  Michael Luby,et al.  Pseudorandomness and cryptographic applications , 1996, Princeton computer science notes.

[3]  Jaap-Henk Hoepman.  Ephemeral Pairing on Anonymous Networks , 2005, SPC.

[4]  Jaap-Henk Hoepman.  The Ephemeral Pairing Problem , 2004, Financial Cryptography.

[5]  Ming Xiao,et al.  Bootstrapping multi-party ad-hoc security , 2006, SAC '06.

[6]  Thomas Peyrin,et al.  The Pairing Problem with User Interaction , 2005, SEC.

[7]  Mihir Bellare,et al.  Entity Authentication and Key Distribution , 1993, CRYPTO.

[8]  Hugo Krawczyk,et al.  Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels , 2001, EUROCRYPT.

[9]  Markus Jakobsson,et al.  Security Weaknesses in Bluetooth , 2001, CT-RSA.

[10]  Serge Vaudenay,et al.  Secure Communications over Insecure Channels Based on Short Authenticated Strings , 2005, CRYPTO.

[11]  Hugo Krawczyk,et al.  LFSR-based Hashing and Authentication , 1994, CRYPTO.

[12]  Noam Nisan,et al.  The computational complexity of universal hashing , 1990, STOC '90.

[13]  Hugo Krawczyk,et al.  A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract) , 1998, STOC '98.

[14]  Yehuda Lindell,et al.  Universally Composable Password-Based Key Exchange , 2005, EUROCRYPT.

[15]  Douglas R. Stinson.  Universal Hashing and Authentication Codes , 1991, CRYPTO.

[16]  A. W. Roscoe,et al.  Efficient group authentication protocols based on human interaction , 2009, IACR Cryptol. ePrint Arch..

[17]  Christian Gehrmann,et al.  Manual authentication for wireless devices , 2004 .

[18]  Mihir Bellare,et al.  Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.

[19]  Sadie Creese,et al.  Research Directions for Trust and Security in Human-Centric Computing , 2005 .

[20]  Frank Stajano,et al.  The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks , 1999, Security Protocols Workshop.

[21]  Stafford E. Tavares,et al.  On the Design of S-Boxes , 1985, CRYPTO.

[22]  Philip Robinson,et al.  Privacy, Security and Trust within the Context of Pervasive Computing (The Kluwer International Series in Engineering and Computer Science) , 2004 .

[23]  Serge Vaudenay,et al.  An Optimal Non-interactive Message Authentication Protocol , 2006, CT-RSA.

[24]  Diana K. Smetters,et al.  Talking to Strangers: Authentication in Ad-Hoc Wireless Networks , 2002, NDSS.

[25]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[26]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[27]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[28]  Gavin Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.

[29]  Flemming Nielson,et al.  Security for Mobility , 2002, FOSAD.

[30]  C. Gehrmann,et al.  Security in personal area networks , 2004 .

[31]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[32]  Hugo Krawczyk,et al.  New Hash Functions For Message Authentication , 1995, EUROCRYPT.

[33]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[34]  Michael Goldsmith,et al.  Security properties and mechanisms in human−centric computing , 2004 .

[35]  Serge Vaudenay,et al.  SAS-Based Authenticated Key Agreement , 2006, Public Key Cryptography.

[36]  Donald E. Knuth.  The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[37]  Bill Roscoe.  Human−centred computer security , 2006 .

[38]  Srdjan Capkun,et al.  Key Agreement in Peer-to-Peer Wireless Networks , 2006, Proceedings of the IEEE.

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

[40]  Sadie Creese,et al.  The attacker in ubiquitous computing environments: formalising the threat model , 2003 .

[41]  Frank Stajano,et al.  Multi-channel Protocols , 2005, Security Protocols Workshop.

[42]  Sadie Creese,et al.  Exploiting Empirical Engagement in Authentication Protocol Design , 2005, SPC.