3 citations · 8 across the 5 of their papers we have counts for
6 papers
Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent
Carter Bunch, Saraid Dwyer Satterfield, Serdar Erbatur +2
We introduce a new form of restricted term rewrite system, the graph-embedded term rewrite system. These systems, and thus the name, are inspired by the graph minor relation and ar…
CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms
Dalton Chichester, Wei Du, Raymond Kauffman +8
Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable pr…
On Asymmetric Unification for the Theory of XOR with a Homomorphism
Christopher Lynch, Andrew M. Marshall, Catherine Meadows +2
Asymmetric unification, or unification with irreducibility constraints, is a newly developed paradigm that arose out of the automated analysis of cryptographic protocols. However,…
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
Andrew M Marshall, Catherine Meadows, Paliath Narendran
An algorithm for unification modulo one-sided distributivity is an early result by Tidén and Arnborg. More recently this theory has been of interest in cryptographic protocol analy…
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Paliath Narendran, Andrew Marshall, Bibhu Mahapatra
We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamp…
Unification modulo a partial theory of exponentiation
Deepak Kapur, Andrew Marshall, Paliath Narendran
Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) play…