A method for symbolic analysis of security protocols

DOI10.1016/j.tcs.2005.03.044zbMath1068.94009OpenAlexW2077875077WikidataQ115036561 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

zbMATH Keywords

Process calculiSecurity protocol analysisSymbolic techniques

Mathematics Subject Classification ID

Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Related Items (2)

A game-theoretic framework for specification and verification of cryptographic protocols ⋮ A complete symbolic bisimulation for full applied pi calculus

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

This page was built for publication: A method for symbolic analysis of security protocols