Examining the DoS Resistance of HIP

  • Suratose Tritilanunt
  • Colin Boyd
  • Ernest Foo
  • Juan Manuel González Nieto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4277)


We examine DoS resistance of the Host Identity Protocol (HIP) and discuss a technique to deny legitimate services. To demonstrate the experiment, we implement a formal model of HIP based on Timed Petri Nets and use a simulation approach provided in CPN Tools to achieve a formal analysis. By integrating adjustable puzzle difficulty, HIP can mitigate the effect of DoS attacks. However, the inability to protect against coordinated adversaries on a hash-based puzzle causes the responder to be susceptible to DoS attacks at the identity verification phase. As a result, we propose an enhanced approach by employing a time-lock puzzle instead of a hash-based scheme. Once the time-lock puzzle is adopted, the effect of coordinated attacks will be removed and the throughput from legitimate users will return to the desirable level.


Host Identity Protocol Adversarial Strategy Puzzle Solution Client Puzzle Bogus Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Al-azzoni, I.: The Verification of Cryptographic Protocols using Coloured Petri Nets. Master of Applied Sciences Thesis, Department of Software Engineering, McMaster University, Ontario, Canada (2004)Google Scholar
  2. 2.
    Aura, T., Nagarajan, A., Gurtov, A.: Analysis of the HIP Base Exchange Protocol. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 481–493. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Aura, T., Nikander, P.: Stateless Connections. In: International Conference on Information and Communications Security, Beijing, China, November 1997, pp. 87–97 (1997)Google Scholar
  4. 4.
    Aura, T., Nikander, P., Leiwo, J.: DoS-resistant authentication with client puzzles. In: Security Protocols Workshop 2000, pp. 170–181 (April 2000)Google Scholar
  5. 5.
    Back, A.: Hashcash - A Denial of Service Counter-Measure (2002), http://citeseer.ist.psu.edu/back02hashcash.html
  6. 6.
    Beal, J., Shepard, T.: Deamplification of DoS Attacks via Puzzles (2004), available http://web.mit.edu/jakebeal/www/Unpublished/puzzle.pdf
  7. 7.
    Computer Emergency Response Team (CERT). SYN Flooding Attack (1996) [Online] available: http://www.cert.org/advisories/CA-1996-21.html
  8. 8.
    Doyle, E.M.: Automated Security Analysis of Cryptographic Protocols using Coloured Petri Net Specification. Master of Science Thesis, Department of Electrical and Computer Engineering, Queen’s University, Ontario, Canada (1996)Google Scholar
  9. 9.
    Feng, W., Luu, A., Feng, W.: Scalable, Fine-grained Control of Network Puzzles. Technical report 03-015, OGI CSE (2003)Google Scholar
  10. 10.
    Han, Y.: Automated Security Analysis of Internet Protocols using Coloured Petri Net Specification. Master of Science Thesis, Department of Electrical and Computer Engineering, Queen’s University, Ontario, Canada (1996)Google Scholar
  11. 11.
    Jakobsson, M., Juels, A.: Proofs of work and bread pudding protocols. In: the IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security (CMS 1999) (September 1999)Google Scholar
  12. 12.
    Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks. In: The 1999 Network and Distributed System Security Symposium (NDSS 1999), San Diego, California, USA, February 1999, pp. 151–165 (1999)Google Scholar
  13. 13.
    Mao, W.: Time-Lock Puzzle with Examinable Evidence of Unlocking Time. In: Proceedings of the 7th International Workshop on Security Protocols, pp. 95–102. Springer, London (2000)Google Scholar
  14. 14.
    Moskowitz, R.: The Host Identity Protocol (HIP). Internet Draft, Internet Engineering Task Force (June 2006), http://www.ietf.org/internet-drafts/draft-ietf-hip-base-06.txt
  15. 15.
    Rivest, R.L., Shamir, A., Wagner, D.A.: Time-lock Puzzles and Timed-release Crypto. Technical Report TR-684, Massachusetts Institute of Technology, Cambridge, MA, USA (March 10, 1996)Google Scholar
  16. 16.
    Simpson, W.A.: IKE/ISAKMP Considered Harmful. USENIX 24(6) (December 1999)Google Scholar
  17. 17.
    Smith, J., González Nieto, J.M., Boyd, C.: Modelling Denial of Service Attacks on JFK with Meadows’s Cost-Based Framework. In: Fourth Australasian Information Security Workshop (AISW-NetSec 2006), vol. 54, pp. 125–134 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Suratose Tritilanunt
    • 1
  • Colin Boyd
    • 1
  • Ernest Foo
    • 1
  • Juan Manuel González Nieto
    • 1
  1. 1.Information Security InstituteQueensland University of TechnologyBrisbaneAustralia

Personalised recommendations