Intruder deduction problem for locally stable theories with normal forms and inverses
DOI10.1016/J.TCS.2017.01.027zbMATH Open1386.68078OpenAlexW2589748073MaRDI QIDQ683746FDOQ683746
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
Recommendations
commutativityassociativityAC-matchingintruder deduction problemlocally stable theoriesterm-rewrite systems
Data encryption (aspects in computer science) (68P25) Grammars and rewriting systems (68Q42) Logic in computer science (03B70)
Cites Work
- YAPA: a generic tool for computing intruder knowledge
- Computer Aided Verification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Unification theory
- Title not available (Why is that?)
- Mobile values, new names, and secure communication
- Automatic recognition of tractability in inference relations
- Deciding knowledge in security protocols under equational theories
- On the security of public key protocols
- Easy intruder deduction problems with homomorphisms
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- An NP decision procedure for protocol insecurity with XOR
- Term Rewriting and Applications
- Efficient solution of linear diophantine equations
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Programming Languages and Systems
- A proof theoretic analysis of intruder theories
- A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
- Title not available (Why is that?)
- An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
- Deducibility Constraints, Equational Theory and Electronic Money
- Title not available (Why is that?)
- Reduction of the intruder deduction problem into equational elementary deduction for electronic purse protocols with blind signatures
- Elementary deduction problem for locally stable theories with normal forms
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
Uses Software
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)
