An E-unification algorithm for analyzing protocols that use modular exponentiation
From MaRDI portal
Recommendations
- A unification algorithm for analysis of protocols with blinded signatures
- Efficient general unification for XOR with homomorphism
- Efficient general AGH-unification
- Symbolic protocol analysis for monoidal equational theories
- Asymmetric unification: a new unification paradigm for cryptographic protocol analysis
Cited in
(12)- Symbolic protocol analysis for monoidal equational theories
- Hierarchical combination of intruder theories
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
- Bounded ACh unification
- Efficient general unification for XOR with homomorphism
- Programming Languages and Systems
- An NP decision procedure for protocol insecurity with XOR
- Simulation relations for alternating Büchi automata
- A unification algorithm for analysis of protocols with blinded signatures
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- Intruder deduction problem for locally stable theories with normal forms and inverses
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
This page was built for publication: An E-unification algorithm for analyzing protocols that use modular exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4447232)