3 citations · 8 across the 5 of their papers we have counts for
3 papers · 1 filter
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 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…