caa a22 4500 445869674 CHVBK 20180317145507.0 cr unu---uuuuu 170323e20110801xx s 000 0 eng 10.1007/s00236-011-0141-z doi (NATIONALLICENCE)springer-10.1007/s00236-011-0141-z Vágvölgyi Sándor Department of Foundations of Computer Science, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary aut CHAP and rewrite components [Elektronische Daten] [Sándor Vágvölgyi] 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. Springer-Verlag, 2011 Acta Informatica Springer-Verlag 48/5-6(2011-08-01), 317-361 0001-5903 48:5-6<317 2011 48 236 https://doi.org/10.1007/s00236-011-0141-z text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s00236-011-0141-z text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Vágvölgyi Sándor Department of Foundations of Computer Science, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary aut NATIONALLICENCE 773 0- Acta Informatica Springer-Verlag 48/5-6(2011-08-01), 317-361 0001-5903 48:5-6<317 2011 48 236 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer