You are previewing The Modelling and Analysis of Security Protocols: the CSP Approach.
O'Reilly logo
The Modelling and Analysis of Security Protocols: the CSP Approach

Book Description

Security protocols are one of the most critical elements in enabling the secure communication and processing of information, ensuring its confidentiality, integrity, authenticity and availability. These protocols are vulnerable to a host of subtle attacks, so designing protocols to be impervious to such attacks has proved to be extremely challenging and error prone.   This book provides a thorough and detailed understanding of one of the most effective approaches to the design and evaluation of security critical systems, describing the role of security protocols in distributed secure systems and the vulnerabilities to which they are prey.  The authors introduce security protocols, the role they play and the cryptographic mechanisms they employ, and detail their role in security architectures, e-commerce, e-cash etc. Precise characterizations of key concepts in information security, such as confidentiality, authentication and integrity are introduced and a range of tools and techniques are described which will ensure that a protocol guarantees certain security services under appropriate assumptions.  Modeling and Analysis of Security Protocols provides:

  • An in-depth discussion of the nature and role of security protocols and their vulnerabilities.

  • A rigorous framework in which security protocols and properties can be defined in detail.

  • An understanding of the tools and techniques used to design and evaluate security protocols.

  • Table of Contents

    1. Copyright
    2. Contributing authors
    3. Preface
    4. Introduction
      1. Security protocols
      2. Security properties
      3. Cryptography
      4. Public-key certificates and infrastructures
      5. Encryption modes
      6. Cryptographic hash functions
      7. Digital signatures
      8. Security protocol vulnerabilities
      9. The CSP approach
      10. Casper: the user-friendly interface of FDR
      11. Limits of formal analysis
      12. Summary
    5. An introduction to CSP
      1. Basic building blocks
      2. Parallel operators
      3. Hiding and renaming
      4. Further operators
      5. Process behaviour
      6. Discrete time
    6. Modelling security protocols in CSP
      1. Trustworthy processes
      2. Data types for protocol models
      3. Modelling an intruder
      4. Putting the network together
    7. Expressing protocol goals
      1. The Yahalom protocol
      2. Secrecy
      3. Authentication
      4. Non-repudiation
      5. Anonymity
      6. Summary
    8. Overview of FDR
      1. Comparing processes
      2. Labelled Transition Systems
      3. Exploiting compositional structure
      4. Counterexamples
    9. Casper
      1. An example input file
      2. The %-notation
      3. Case study: the Wide-Mouthed-Frog protocol
      4. Protocol specifications
      5. Hash functions and Vernam encryption
      6. Summary
    10. Encoding protocols and intruders for FDR
      1. CSP from Casper
      2. Modelling the intruder: the perfect spy
      3. Wiring the network together
      4. Example deduction system
      5. Algebraic equivalences
      6. Specifying desired properties
    11. Theorem proving
      1. Rank functions
      2. Secrecy of the shared key: a rank function
      3. Secrecy on nB
      4. Authentication
      5. Machine assistance
      6. Summary
    12. Simplifying transformations
      1. Simplifying transformations for protocols
      2. Transformations on protocols
      3. Examples of safe simplifying transformations
      4. Structural transformations
      5. Case study: The CyberCash Main Sequence protocol
      6. Summary
    13. Other approaches
      1. Introduction
      2. The Dolev-Yao model
      3. BAN logic and derivatives
      4. FDM and InaJo
      5. NRL Analyser
      6. The B-method approach
      7. The non-interference approach
      8. Strand spaces
      9. The inductive approach
      10. Spi calculus
      11. Provable security
    14. Prospects and wider issues
      1. Introduction
      2. Abstraction of cryptographic primitives
      3. The refinement problem
      4. Combining formal and cryptographic styles of analysis
      5. Dependence on infrastructure assumptions
      6. Conference and group keying
      7. Quantum cryptography
      8. Data independence
    15. Background cryptography
      1. The RSA algorithm
      2. The ElGamal public key system
      3. Complexity theory
    16. The Yahalom protocol in Casper
      1. The Casper input file
      2. Casper output
    17. CyberCash rank function analysis
      1. Secrecy
      2. Authentication
    18. Bibliography
    19. Notation in protocol descriptions