Symbolic protocol analysis for monoidal equational theories
From MaRDI portal
Publication:2482449
Recommendations
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories
- Security Protocols, Constraint Systems, and Group Theories
- Algebraic Intruder Deductions
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
Cites work
- Algebraic Intruder Deductions
- An attack on a recursive authentication protocol. A cautionary tale
- An Efficient Unification Algorithm
- An NP decision procedure for protocol insecurity with XOR
- An undecidability result for AGh
- Associative-Commutative Deducibility Constraints
- Automata, Languages and Programming
- Automatic recognition of tractability in inference relations
- Combination problems for commutative/monoidal theories or how algebra can help in equational unification
- Easy intruder deduction problems with homomorphisms
- Easy intruder deductions
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computation Structures
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Hierarchical Combination of Intruder Theories
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 108434 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 2043528 (Why is no real title available?)
- On the security of public key protocols
- On the symbolic reduction of processes with cryptographic functions.
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- Term Rewriting and Applications
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Unification in monoidal theories
- Unification in the union of disjoint equational theories: Combining decision procedures
- Unification theory
- Using encryption for authentication in large networks of computers
Cited in
(18)- An equational metalogic for monadic equational systems
- Symbolic Semantics for Multiparty Interactions in the Link-Calculus
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
- Deciding Knowledge in Security Protocols for Monoidal Equational Theories
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
- Challenges in the Automated Verification of Security Protocols
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
- Decidability and combination results for two notions of knowledge in security protocols
- scientific article; zbMATH DE number 2043528 (Why is no real title available?)
- scientific article; zbMATH DE number 1927582 (Why is no real title available?)
- Deducibility constraints and blind signatures
- Satisfiability of general intruder constraints with and without a set constructor
- Algebraic Intruder Deductions
- Mechanizing Mathematical Reasoning
- A Proof Theoretic Analysis of Intruder Theories
- Algebra model and security analysis for cryptographic protocols
This page was built for publication: Symbolic protocol analysis for monoidal equational theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482449)
