scientific article; zbMATH DE number 2043528

MaRDI QIDQ4447232zbMATH OpenFDO

Authors Deepak Kapur, Paliath Narendran, Lida Wang

Publication date 16 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2706/27060165.htm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Grammars and rewriting systems (68Q42)

Recommendations

• Mechanizing Mathematical Reasoning
• 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)

• Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
• Programming Languages and Systems
• Intruder deduction problem for locally stable theories with normal forms and inverses
• An NP decision procedure for protocol insecurity with XOR
• Simulation relations for alternating Büchi automata
• Hierarchical combination of intruder theories
• Mechanizing Mathematical Reasoning
• Symbolic protocol analysis for monoidal equational theories
• Efficient general unification for XOR with homomorphism
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• Bounded ACh unification

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4447232)