On asymmetric unification for the theory of XOR with a homomorphism
From MaRDI portal
Publication:2180236
Abstract: Asymmetric unification, or unification with irreducibility constraints, is a newly developed paradigm that arose out of the automated analysis of cryptographic protocols. However, there are still relatively few asymmetric unification algorithms. In this paper we address this lack by exploring the application of automata-based unification methods. We examine the theory of xor with a homomorphism, ACUNh, from the point of view of asymmetric unification, and develop a new automata-based decision procedure. Then, we adapt a recently developed asymmetric combination procedure to produce a general asymmetric- ACUNh decision procedure. Finally, we present a new approach for obtaining a solution-generating asymmetric-ACUNh unification automaton. We also compare our approach to the most commonly used form of asymmetric unification available today, variant unification.
Recommendations
- Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
- On Asymmetric Unification and the Combination Problem in Disjoint Theories
- On unification modulo one-sided distributivity: algorithms, variants and asymmetry
- Efficient general unification for XOR with homomorphism
- Asymmetric unification and disunification
Cited in
(3)
This page was built for publication: On asymmetric unification for the theory of XOR with a homomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180236)
