A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Verifying Authentication Protocols in CSP
IEEE Transactions on Software Engineering
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Mobile values, new names, and secure communication
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Finite-state analysis of two contract signing protocols
Theoretical Computer Science
A Formal Security Model for Microprocessor Hardware
IEEE Transactions on Software Engineering
A bisimulation method for cryptographic protocols
Nordic Journal of Computing
A new logic for electronic commerce protocols
Theoretical Computer Science - Special issue: Algebraic methodology and software technology
Secure Information Flow as Typed Process Behaviour
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Cryptographically Sound and Machine-Assisted Verification of Security Protocols
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On the Reachability Problem in Cryptographic Protocols
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Multiset Rewriting and Security Protocol Analysis
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Probabilistic Polynomial-Time Equivalence and Security Analysis
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
A Uniform Approach for the Definition of Security Properties
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
A Formal Security Model for Microprocessor Hardware
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Authenticity and Provability - A Formal Framework
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
Verifying authentication protocol implementations
FMOODS '02 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Methods for Open Object-Based Distributed Systems V
A Meta-Notation for Protocol Analysis
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Specifying and Verifying Hardware for Tamper-Resistant Software
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Computing Symbolic Models for Verifying Cryptographic Protocols
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Relating multiset rewriting and process algebras for security protocol analysis
Journal of Computer Security - Special issue on WITS'03
Relating Symbolic and Cryptographic Secrecy
IEEE Transactions on Dependable and Secure Computing
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Static validation of security protocols
Journal of Computer Security
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Using equivalence-checking to verify robustness to denial of service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computationally sound secrecy proofs by mechanized flow analysis
Proceedings of the 13th ACM conference on Computer and communications security
Weakening the perfect encryption assumption in Dolev-Yao adversaries
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science - Automated reasoning for security protocol analysis
Protocol Composition Logic (PCL)
Electronic Notes in Theoretical Computer Science (ENTCS)
Finite-state analysis of SSL 3.0
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Simulation Based Validation Of Authentication Protocols
Journal of Integrated Design & Process Science
Style-Based Model Transformation for Early Extrafunctional Analysis of Distributed Systems
QoSA '08 Proceedings of the 4th International Conference on Quality of Software-Architectures: Models and Architectures
Safely composing security protocols
Formal Methods in System Design
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
Using equivalence-checking to verify robustness to denial of service
Computer Networks: The International Journal of Computer and Telecommunications Networking
On a formal framework for security properties
Computer Standards & Interfaces
CoSP: a general framework for computational soundness proofs
Proceedings of the 16th ACM conference on Computer and communications security
Approximating Imperfect Cryptography in a Formal Model
Electronic Notes in Theoretical Computer Science (ENTCS)
A Trace Logic for Local Security Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
ESOP'03 Proceedings of the 12th European conference on Programming
A probabilistic applied pi-calculus
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Security protocols: principles and calculi tutorial notes
Foundations of security analysis and design IV
Non-repudiation analysis using LySa with annotations
Computer Languages, Systems and Structures
Computationally sound verification of source code
Proceedings of the 17th ACM conference on Computer and communications security
Computational soundness of symbolic zero-knowledge proofs
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
| Hi-index | 0.01 |
Security properties such as confidentiality and authenticity may be considered in terms of the flow of messages within a network. To the extent that this characterization is justified, the use of a process algebra such as Communicating Sequential Processes (CSP) seems appropriate to describe and analyze them. This paper explores ways in which security properties may be described as CSP specifications, how security mechanisms may be captured, and how particular protocols designed to provide these properties may be analyzed within the CSP framework. The paper is concerned with the theoretical basis for such analysis. A sketch verification of a simple example is carried out as an illustration.