Advertisement

Acta Informatica

, 48:317 | Cite as

CHAP and rewrite components

  • Sándor Vágvölgyi
Original Article
  • 50 Downloads

Abstract

We present an additional feature to the Challenge Handshake Authentication Protocol. It makes the protocol resilient to offline brute-force/dictionary attacks. We base our contribution to the protocol on the concept of a rewrite complement for ground term rewrite systems (GTRSs). We also introduce and study the notion of a type-based complement which is a special case of a rewrite complement. We show the following decision results. Given GTRSs A, C, and a reduced GTRS B over some ranked alphabet Σ, one can decide whether C is a type-based complement of A for B. Given a GTRS A and a reduced GTRS B over some ranked alphabet Σ, one can decide whether there is a GTRS C such that C is a type-based complement of A for B. If the answer is yes, then we can construct such a GTRS C.

Keywords

Identity Relation Direct Inspection Ground Term Reduction Sequence Tree Automaton 
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.

References

  1. 1.
    Baader F., Nipkow T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
  2. 2.
    Burnett M.: Perfect Passwords: Selection, Protection, Authentication. Syngress Publishing, Burlington (2005)Google Scholar
  3. 3.
    Brainerd W.S.: Tree generating regular systems. Inf. Control 14, 217–231 (1969)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Cisco: Cisco Response to Dictionary Attacks on Cisco LEAP. Product Bulletin, No. 2331. http://www.cisco.com/en/US/products/hw/wireless/ps430/prod_bulletin09186a00801cc901.html (2004). Accessed 1 July 2009
  5. 5.
    Cisco: Understanding and Configuring PPP CHAP Authentication. Document ID: 25647. http://www.cisco.com/en/US/tech/tk713/tk507/technologies_tech_note09186a00800b4131.shtml (2005). Accessed 1 July 2009
  6. 6.
    Dauchet M., Heuillard T., Lescanne P., Tison S.: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Inf. Comput. 88, 187–201 (1990)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Engelfriet J.: Derivation trees of ground term rewriting systems. Inf. Comput. 152, 1–15 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Gallier J.H., Book R.V.: Reductions in tree replacement systems. Theor. Comput. Sci. 37, 123–150 (1985)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Gécseg F., Steinby M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)zbMATHGoogle Scholar
  10. 10.
    Fülöp Z., Vágvölgyi S.: A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata. Fundam. Inf. 13, 211–226 (1990)Google Scholar
  11. 11.
    Sankar K., Sundaralingam S., Miller D., Balinsky A.: Cisco Wireless LAN Security. Cisco Press, Indianapolis (2004)Google Scholar
  12. 12.
    Simpson, W.: PPP Challenge Handshake Authentication Protocol (CHAP). RFC Editor (1996). http://tools.ietf.org/html/rfc1994. Accessed 1 July 2009
  13. 13.
    Snyder W.: A fast Algorithm for generating reduced ground rewriting systems from a set of ground equations. J. Symb. Comput. 15, 415–450 (1993)zbMATHCrossRefGoogle Scholar
  14. 14.
    : Term Rewriting Systems. Cambridge University Press, Cambridge (2003)Google Scholar
  15. 15.
    Togashi A., Noguchi S.: Some decision problems and their time complexity for term rewriting systems. Trans. IECE Jpn. J. 66-D, 1177–1184 (1983)Google Scholar
  16. 16.
    Vágvölgyi S.: A fast algorithm for constructing a tree automaton recognizing a congruential tree language. Theor. Comput. Sci. 115, 391–399 (1993)zbMATHCrossRefGoogle Scholar
  17. 17.
    Vágvölgyi S.: Congruential complements of ground term rewrite systems. Theor. Comput. Sci. 238, 247–274 (2000)zbMATHCrossRefGoogle Scholar
  18. 18.
    Wang X., Yu H.: How to break MD5 and other hash functions. In: Cramer, R (eds) Advances in Cryptology—EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science, vol. 3494, pp. 19–35. Springer, Berlin (2005)Google Scholar
  19. 19.
    Zvada S., Ványi R.: Improving grammar-based evolutionary algorithms via attributed derivation trees. In: Keijzer, M., O’Reilly, U.-M., Lucas, S.M., Costa, E., Soule, T (eds) Genetic Programming, 7th European Conference, EuroGP2004, Proceedings. Lecture Notes in Computer Science, vol. 3003, pp. 208–219. Springer, Berlin (2004)Google Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.Department of Foundations of Computer ScienceUniversity of SzegedSzegedHungary

Personalised recommendations