A method for symbolic analysis of security protocols
From MaRDI portal
Publication:557806
DOI10.1016/j.tcs.2005.03.044zbMath1068.94009WikidataQ115036561 ScholiaQ115036561MaRDI QIDQ557806
Michele Boreale, Maria Grazia Buscemi
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.044
94A60: Cryptography
68Q60: Specification and verification (program logics, model checking, etc.)
68M12: Network protocols
Related Items
Cites Work
- An NP decision procedure for protocol insecurity with XOR
- On the symbolic reduction of processes with cryptographic functions.
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Information based reasoning about security protocols
- On the Security of Ping-Pong Protocols
- On the security of public key protocols
- Mobile values, new names, and secure communication
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Programming Languages and Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item