On the symbolic reduction of processes with cryptographic functions
- 1 January 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 290 (1) , 695-740
- https://doi.org/10.1016/s0304-3975(02)00090-7
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Tree Automata with One Memory, Set Constraints, and Ping-Pong ProtocolsPublished by Springer Nature ,2001
- On the Reachability Problem in Cryptographic ProtocolsPublished by Springer Nature ,2000
- A compiler for analyzing cryptographic protocols using noninterferenceACM Transactions on Software Engineering and Methodology, 2000
- Reconciling Two Views of CryptographyPublished by Springer Nature ,2000
- Towards an Automatic Analysis of Security Protocols in First-Order LogicPublished by Springer Nature ,1999
- Using State Space Exploration and a Natural Deduction Style Message Derivation Engine to Verify Security ProtocolsPublished by Springer Nature ,1998
- On the regular structure of prefix rewritingTheoretical Computer Science, 1992
- A logic of authenticationProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1989
- On the security of public key protocolsIEEE Transactions on Information Theory, 1983
- Regular canonical systemsArchive for Mathematical Logic, 1964