Bounded ACh unification

DOI10.1017/S0960129520000183zbMath1495.68111arXiv1811.05602MaRDI QIDQ5139278

No author found.

Publication date: 8 December 2020

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.05602

zbMATH Keywords

homomorphismrewritingcommutativityMaudecryptographic protocol analysisequational unification

Mathematics Subject Classification ID

Cryptography (94A60) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Restricted unification in the DL \(\mathcal{FL}_0\)

Uses Software

• Maude
• Maude-NPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification modulo homomorphic encryption
• Efficient general AGH-unification
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Unification problems with one-sided distributivity
• A decision algorithm for distributive unification
• On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Unification Modulo Homomorphic Encryption
• Term Rewriting and All That
• Efficient General Unification for XOR with Homomorphism

This page was built for publication: Bounded ACh unification