Intruder deduction problem for locally stable theories with normal forms and inverses

DOI10.1016/j.tcs.2017.01.027zbMath1386.68078OpenAlexW2589748073MaRDI QIDQ683746

Daniele Nantes-Sobrinho, Maribel Fernández, Mauricio Ayala-Rincón

Publication date: 9 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://kclpure.kcl.ac.uk/portal/en/publications/intruder-deduction-problem-for-locally-stable-theories-with-normal-forms-and-inverses(ae64aacc-3f5d-49cf-9674-e5f36cf0247d).html

zbMATH Keywords

associativitycommutativityAC-matchingintruder deduction problemlocally stable theoriesterm-rewrite systems

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (3)

Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ Computing knowledge in equational extensions of subterm convergent theories

Uses Software

• YAPA
• AVISPA
• CiME
• Maude-NPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An NP decision procedure for protocol insecurity with XOR
• Deciding knowledge in security protocols under equational theories
• Easy intruder deduction problems with homomorphisms
• Efficient solution of linear diophantine equations
• An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
• YAPA
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
• Deducibility Constraints, Equational Theory and Electronic Money
• On the security of public key protocols
• Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures
• Mobile values, new names, and secure communication
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Automatic recognition of tractability in inference relations
• Programming Languages and Systems
• Term Rewriting and Applications
• Computer Aided Verification
• A Proof Theoretic Analysis of Intruder Theories

This page was built for publication: Intruder deduction problem for locally stable theories with normal forms and inverses