A method for symbolic analysis of security protocols

DOI10.1016/J.TCS.2005.03.044MaRDI QIDQ557806zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1927581
• scientific article; zbMATH DE number 1754628
• Mathematical Foundations of Computer Science 2003
• Analysis of security protocols as open systems
• Universally composable symbolic security analysis

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 1956510 (Why is no real title available?)
• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 2043527 (Why is no real title available?)
• scientific article; zbMATH DE number 1927581 (Why is no real title available?)
• scientific article; zbMATH DE number 1500551 (Why is no real title available?)
• scientific article; zbMATH DE number 1754628 (Why is no real title available?)
• scientific article; zbMATH DE number 1754629 (Why is no real title available?)
• scientific article; zbMATH DE number 1759624 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1418468 (Why is no real title available?)
• An NP decision procedure for protocol insecurity with XOR
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Information based reasoning about security protocols
• Mobile values, new names, and secure communication
• On the Security of Ping-Pong Protocols
• On the security of public key protocols
• On the symbolic reduction of processes with cryptographic functions.
• Programming Languages and Systems
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.

Cited in

(18)

• Equal to the task?
• Analyzing security protocols with secrecy types and logic programs
• scientific article; zbMATH DE number 1927581 (Why is no real title available?)
• scientific article; zbMATH DE number 1754628 (Why is no real title available?)
• scientific article; zbMATH DE number 1962759 (Why is no real title available?)
• A game-theoretic framework for specification and verification of cryptographic protocols
• Universally composable symbolic security analysis
• A complete symbolic bisimulation for full applied pi calculus
• Deconstructing Alice and Bob
• scientific article; zbMATH DE number 1929965 (Why is no real title available?)
• scientific article; zbMATH DE number 7113382 (Why is no real title available?)
• The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
• scientific article; zbMATH DE number 1390339 (Why is no real title available?)
• Theory of Cryptography
• Symbolic analysis of identity-based protocols
• Analysis of security protocols as open systems
• Mathematical Foundations of Computer Science 2003
• Security analysis of \textit{SPAKE2+}

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557806)