We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
This paper discusses the practical issues that arise when securing the access to the World Wide Web (WWW). A brief overview of the different protocols that are proposed to secure ...
Joris Claessens, Mark Vandenwauver, Bart Preneel, ...
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
Ad hoc networks are subject of many recent research efforts. Especially in mobile scenarios, self-organizing networks are of high interest. While the routing aspects of mobile ad ...
Frank Kargl, Stefan Schlott, Andreas Klenk, Alfred...