Model Checking Security Protocols
From MaRDI portal
Publication:3176380
DOI10.1007/978-3-319-10575-8_22zbMATH Open1392.68228OpenAlexW2803681306MaRDI QIDQ3176380FDOQ3176380
Recommendations
Cites work
- scientific article; zbMATH DE number 1722690 (Why is no real title available?)
- scientific article; zbMATH DE number 3963720 (Why is no real title available?)
- scientific article; zbMATH DE number 1962758 (Why is no real title available?)
- scientific article; zbMATH DE number 1759313 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1394315 (Why is no real title available?)
- A formal language for cryptographic protocol requirements
- A framework for compositional verification of security protocols
- A survey of symbolic methods in computational analysis of cryptographic systems
- Algebraic Intruder Deductions
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Analysing password protocol security against off-line dictionary attacks
- Automated complexity analysis based on ordered resolution
- Automated verification of selected equivalences for security protocols
- Automatic analysis of a non-repudiation protocol
- Computationally sound implementations of equational theories against passive adversaries
- Computer Aided Verification
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Deciding knowledge in security protocols under equational theories
- Degrees of security: protocol guarantees in the face of compromising adversaries
- Easy intruder deductions
- Foundations of Software Science and Computation Structures
- Let’s Get Physical: Models and Methods for Real-World Security Protocols
- Limits of the BRSIM/UC soundness of Dolev-Yao models with hashes
- Limits of the cryptographic realization of Dolev-Yao-style XOR
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Mobile values, new names, and secure communication
- Model checking probabilistic systems
- On the freedom of decryption
- On the security of ping-pong protocols
- On the security of public key protocols
- Partial-Order Reduction
- Programming Languages and Systems
- Propositional SAT solving
- Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
- Provably repairing the ISO/IEC 9798 standard for entity authentication
- Term Rewriting and All That
- Term Rewriting and Applications
- The CL-Atse Protocol Analyser
- The NRL Protocol Analyzer: An Overview
- The reactive simulatability (RSIM) framework for asynchronous systems
- Unification in permutative equational theories is undecidable
- Unification in the union of disjoint equational theories: Combining decision procedures
- Using encryption for authentication in large networks of computers
- Variant narrowing and equational unification
- YAPA: A Generic Tool for Computing Intruder Knowledge
Cited in
(12)
- Analysing a stream authentication protocol using model checking
- Analyzing Internet Routing Security Using Model Checking
- Verification and modelling of authentication protocols
- Title not available (Why is no real title available?)
- Automated proof of Bell-LaPadula security properties
- Formal Modeling and Verification of High-Availability Protocol for Network Security Appliances
- Formal verification of security model using SPR tool
- Communicating Sequential Processes. The First 25 Years
- Modular verification of security protocol code by typing
- Formalization and analysis of the post-quantum signature scheme FALCON with Maude
- From model-checking to automated testing of security protocols: bridging the gap
- Title not available (Why is no real title available?)
Describes a project that uses
Uses Software
This page was built for publication: Model Checking Security Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176380)
