Authenticating ad hoc networks by comparison of short digests

Information and Computation

Volumn 206, Issue 2-4, 2008, Pages 250-271

  Nguyen, L H ^a   Roscoe, A W ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CHANNEL CAPACITY; CRYPTOGRAPHY; NETWORK PROTOCOLS; NETWORK SECURITY;

GROUP PROTOCOLS; HASH FUNCTIONS; UNSPOOFABLE CHANNELS;

AD HOC NETWORKS;

EID: 40149095729     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.07.010     Document Type: Article

References (40)

1. See: http://en.wikipedia.org/wiki/Avalanche_effect.
2. D. Balfanz, D. Smetters, P. Stewart, H. Wong, Talking to strangers: authentication in ad hoc wireless networks, in: Symposium on Network and Distributed Systems Security, San Diego, California, USA, 2002.
3. Bellare M., and Rogaway P. Entity authentication and key distribution. Advances in Cryptology-Crypto 1993. LNCS vol. 773 (1993), Springer-Verlag 232-249
4. M. Bellare, R. Canetti, H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols, in: 30th STOC, 1998.
5. Bellare M., Pointcheval D., and Rogaway P. Authenticated key exchange secure against dictionary attacks. Advances in Cryptology-Eurocrypt 2000. LNCS vol. 1807 (2000), Springer-Verlag 139-155
6. See: www.bluetooth.com/developer/specification/specification.asp.
7. Simple Pairing White Paper. See: www.bluetooth.com/NR/rdonlyres/0A0B3F36-D15F-4470-85A6-F2CCFA26F70F/0/SimplePairing_WP_V10r00.pdf.
8. M. over(C, ̌)agalj, S. over(C, ̌)apkun, J. Hubaux, Key agreement in peer-to-peer wireless networks, in: Proceedings of the IEEE, Special Issue on Security and Cryptography, vol. 94, no. 2, February 2006.
9. Canetti R., and Krawczyk H. Analysis for key-exchange protocols and their use for building secure channels. Advances in Cryptology-Eurocrypt 2001. LNCS vol. 2045 (2001), Springer-Verlag 453-474
10. Canetti R., Halevi S., Katz J., Lindell Y., and MacKenzie P. Universally composable password-based key exchange. Advances in Cryptology-Eurocrypt 2005. LNCS vol. 3494 (2005), Springer-Verlag 404-421
11. Carter J.L., and Wegman M.N. Universal classes of hash functions. Journal of Computer and System Sciences 18 (1979) 143-154
12. Creese S.J., Goldsmith M.H., Harrison R., Roscoe A.W., Whittaker P., and Zakiuddin I. Exploiting empirical engagement in authentication protocol design. In: Hutter D., and Ullmann M. (Eds). Proceedings of 2nd International Conference on Security in Pervasive Computing (SPC ′05). LNSC vol. 3450 (2005), Springer, Boppard, Germany
13. S.J. Creese, M.H. Goldsmith, A.W. Roscoe, M. Xiao, Bootstrapping multi-party ad-hoc security, in: Proceedings of IEEE Security Track, 2006.
14. S.J. Creese, M.H. Goldsmith, A.W. Roscoe, I. Zakiuddin, The attacker in ubiquitous computing environments: formalising the threat model, in: T. Dimitrakos, F. Martinelli (Eds.), Workshop on Formal Aspects in Security and Trust, Pisa, Italy, September 2003, IIT-CNR Technical Report.
15. S.J. Creese, M.H. Goldsmith, A.W. Roscoe, I. Zakiuddin, Security properties and mechanisms in human-centric computing, in: P. Robinson, H, Vogt, W. Wagealla (Eds.), Privacy, Security and Trust within the Context of Pervasive Computing, Kluwer International Series in Engineering and Computer Science, Springer, 2004. Proceedings of Workshop on Security and Privacy in Pervasive Computing, Wien, April 2004.
16. Gehrmann C., Mitchell C., and Nyberg K. Manual authentication for wireless devices. RSA Cryptobytes 7 1 (2004) 29-37
17. Gehrmann C., and Nyberg K. Security in personal area networks. In: Mitchell C.J. (Ed). Security for Mobility (2004), IEE, London 191-230
18. O. Goldreich, L.A. Levin, A hard-core predicate for all one-way functions, in: Annual ACM Symposium on Theory of Computing, 1989, pp. 25-32.
19. Golomb S.W. Shift Register Sequences (1981), Aegean Park Press. 0894120484
20. Hastad J., Impagliazzo R., Levin L.A., and Luby M. A pseudorandom generator from any one-way function. SIAM Journal of Computer (1999)
21. Hoepman J.-H. Ephemeral pairing on anonymous networks. In: Hutter D., and Ullmann M. (Eds). 2nd International Conference on Security in Pervasive Computing (SPC ′05). LNSC vol. 3450 (2005), Springer, Boppard, Germany 101-116
22. Hoepman J.-H. Ephemeral pairing problem. 8th International Conference Fin. Crypt. LNCS vol. 3110 (2004), Springer 212-226
23. Jakobsson M., and Wetzel S. Security weaknesses in bluetooth. CT-RSA 2001. LNCS vol. 2020 (2001), Springer-Verlag 176-191
24. H. Krawczyk, LFSR-based hashing and authentication, in: CRYPTO 1994, LNCS, vol. 839, 1994, pp. 129-139.
25. H. Krawczyk, New hash functions for message authentication, in: EUROCRYPT 1995, LNCS, vol. 921, 1995, pp. 301-310.
26. D. Knuth, The art of computer programming, Seminumerical Algorithms, third ed., vol. 2, Addison-Wesley, Reading, MA, 1997, ISBN: 0-201-89684-2.
27. Lowe G. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. Tools and Algorithms for the Construction and Analysis of Systems. LNCS vol. 1055 (1996), Springer-Verlag 147-166
28. Luby M. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes (1996), Princeton University Press
29. Y. Mansour, N. Nisan, P. Tiwari, The computational complexity of universal hashing, in: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 1990, pp. 235-243.
30. L.H. Nguyen, A.W. Roscoe, Efficient group authentication protocol based on human interaction, in: Proceedings of Workshop on Foundation of Computer Security and Automated Reasoning Protocol Security Analysis, August 2006, pp. 9-31.
31. Pasini S., and Vaudenay S. SAS-based authenticated key agreement. Public Key Cryptography-PKC'06: The 9th International Workshop on Theory and Practice in Public Key Cryptography. LNCS vol. 3958 (2006), Springer 395-409
32. Pasini S., and Vaudenay S. An optimal non-interactive message authentication protocol. Topics in Cryptology-CT-RSA'06: The Cryptographers' Track at the RSA Conference 2006. LNCS vol. 3860 (2006), Springer 280-294
33. T. Peyrin, S. Vaudenay, The pairing problem with user interaction, in: SEC 2005, 2005, pp. 251-266.
34. A.W. Roscoe, Human-centred Computer Security. See: http://web.comlab.ox.ac.uk/oucl/work/bill.roscoe/publications/113.pdf, 2005.
35. Stajano F., and Anderson R. The resurrecting duckling: security issues for ad-hoc wireless networks. Security Protocols 1999. LNCS vol. 1976 (1999), Springer-Verlag 172-194
36. Stinson D.R. Universal hashing and authentication codes. Advances in Cryptology-Crypto 1991. LNCS vol. 576 (1992), Springer-Verlag 74-85
37. Vaudenay S. Secure communications over insecure channels based on short authenticated strings. Advances in Cryptology-Crypto 2005. LNCS vol. 3621 (2005), Springer-Verlag 309-326
38. Wegman M.N., and Carter J.L. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences 22 (1981) 265-279
39. Webster A.F., and Tavares S.E. On the design of S-boxes. CRYPTO 1985. LNCS vol. 218 (1986), Springer Verlag 523-534
40. F.-L. Wong, F. Stajano, Multi-channel protocols, in: Proceedings of the 13th International Workshop on Security Protocols, LNCS, Cambridge, England, 2005.