Serdar Erbatur

  • Citations Per Year
Learn More
We address a problem that arises in cryptographic protocol analysis when the equational properties of the cryptosystem are taken into account: in many situations it is necessary to guarantee that certain terms generated during a state exploration are in normal form with respect to the equational theory. We give a tool-independent methodology for state(More)
We present a new paradigm for unification arising out of a technique commonly used in cryptographic protocol analysis tools that employ unification modulo equational theories. This paradigm relies on: (i) a decomposition of an equational theory into (R,E) where R is confluent, terminating, and coherent modulo E, and (ii) on reducing unification problems to(More)
We examine the disjoint combination problem in the newly developed paradigm of asymmetric unification. This new unification problem was developed based on newly identified requirements arising from symbolic cryptographic protocol analysis [4]. Its application involves unificationbased exploration of a space in which the states obey rich equational theories(More)
Equational Unification has recently been applied in the field of formal analysis of cryptographic protocols. Formal methods have been very useful in detecting nontrivial flaws in protocols and also to verify their correctness; see Meadows [7] for a survey of formal verification of cryptographic protocols. Terms in this approach are often assumed to be in(More)
A critical question in unification theory is how to obtain a unification algorithm for the combination of non-disjoint equational theories when there exists unification algorithms for the constituent theories. The problem is known to be difficult and can easily be seen to be undecidable in the general case. Therefore, previous work has focused on(More)
We discuss the use of type systems in a non-strict sense when designing unification algorithms. We first give a new (rule-based) algorithm for an equational theory which represents a property of El-Gamal signature schemes and show how a type system can be used to prove termination of the algorithm. Lastly, we reproduce a termination result for theory of(More)