Implementing a Unification Algorithm for Protocol Analysis with XOR
Max Tuengerthal, Ralf Kuesters, Mathieu Turuani
Abstract
In this paper, we propose a unification algorithm for the theory E which combines unification algorithms for E\ and E\ (ACUN properties, like XOR) but compared to the more general combination methods uses specific properties of the equational theories for further optimizations. Our optimizations drastically reduce the number of non-deterministic choices, in particular those for variable identification and linear orderings. This is important for reducing both the runtime of the unification algorithm and the number of unifiers in the complete set of unifiers. We emphasize that obtaining a ``small'' set of unifiers is essential for the efficiency of the constraint solving procedure within which the unification algorithm is used. The method is implemented in the CL-Atse tool for security protocol analysis.
Create a lesson
Related papers
Capability-Gated Language Models: Security Composes, Utility Does Not
Patrikas Vanagas, Augustas Mačijauskas, Laurynas Lopata
Don't Trust the Code, Check Its Effects: Runtime Refinement for Regenerated Systems Code Under an Adversarial Generator
Jinhao Hu, Ashvin Goel, Laurent Bindschaedler
NeuroPriv: Adversarial Representation Learning for Privacy in Wearable EEG Systems
Sarmistha Sarna Gomasta, Bhawana Chhaglani, Prashant Shenoy
OreProof: Verifiable Provenance with Limited Disclosure for Critical-Minerals Supply Chains Using Zero-Knowledge Proofs
Oleksandr Hrabar, Hossein Arshadi Soufiani, Henry M. Kim et al.
Workload Identification with Physical Side Channels for AI Governance
Simone Gargiulo, Gabriel Kulp
Delegation Without Trust: An Empirical Gap Analysis of Identity, Authorization, and Runtime Governance in Multi-Agent LLM Systems
Panduranga Sai Varma Dantuluri, Jyotirmoy Sundi