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

DOI10.1016/J.TCS.2017.01.027MaRDI QIDQ683746zbMATH OpenOpenAlexFDO

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

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

commutativityassociativityAC-matchingintruder deduction problemlocally stable theoriesterm-rewrite systems

Mathematics Subject Classification ID

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

Recommendations

• Elementary deduction problem for locally stable theories with normal forms
• A Proof Theoretic Analysis of Intruder Theories
• A proof theoretic analysis of intruder theories
• Term Rewriting and Applications
• Hierarchical Combination of Intruder Theories

Cites work

• scientific article; zbMATH DE number 3572260 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 2043528 (Why is no real title available?)
• A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
• A proof theoretic analysis of intruder theories
• An NP decision procedure for protocol insecurity with XOR
• An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
• Automatic recognition of tractability in inference relations
• Computer Aided Verification
• Deciding knowledge in security protocols under equational theories
• Deducibility Constraints, Equational Theory and Electronic Money
• Easy intruder deduction problems with homomorphisms
• Efficient solution of linear diophantine equations
• Elementary deduction problem for locally stable theories with normal forms
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
• Mobile values, new names, and secure communication
• On the security of public key protocols
• Programming Languages and Systems
• Reduction of the intruder deduction problem into equational elementary deduction for electronic purse protocols with blind signatures
• Term Rewriting and Applications
• Unification theory
• YAPA: a generic tool for computing intruder knowledge

Cited in

(7)

• Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity
• A Proof Theoretic Analysis of Intruder Theories
• When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
• Elementary deduction problem for locally stable theories with normal forms
• Term Rewriting and Applications
• A proof theoretic analysis of intruder theories
• Computing knowledge in equational extensions of subterm convergent theories

Describes a project that uses

Uses Software

• Maude-NPA
• CiME
• AVISPA
• YAPA

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

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