Satisfiability of general intruder constraints with and without a set constructor
From MaRDI portal
Publication:507349
DOI10.1016/j.jsc.2016.07.009zbMath1356.68269OpenAlexW1876319183MaRDI QIDQ507349
Yannick Chevalier, Tigran Avanesov, Mathieu Turuani, Michaël Rusinowitch
Publication date: 6 February 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: http://oatao.univ-toulouse.fr/22621/1/avanesov_22621.pdf
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability and combination results for two notions of knowledge in security protocols
- Satisfiability of general intruder constraints with and without a set constructor
- Reducing protocol analysis with XOR to the XOR-free case in the Horn theory based approach
- An NP decision procedure for protocol insecurity with XOR
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures
- Tools and algorithms for the construction and analysis of systems. 20th international conference, TACAS 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5--13, 2014. Proceedings
- Symbolic protocol analysis for monoidal equational theories
- Towards an Automatic Analysis of Web Service Security
- The CL-Atse Protocol Analyser
- A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
- Associative-Commutative Deducibility Constraints
- Term Rewriting and All That
- Efficient General Unification for XOR with Homomorphism
- Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
- Foundations of Software Science and Computation Structures
- Lazy Mobile Intruders
- Algebraic Intruder Deductions
- Bounding Messages for Free in Security Protocols
- Information and Communications Security
- Automata, Languages and Programming
