Casper

swMATH6559MaRDI QIDQ18651FDOQ18651

Author name not available (Why is that?)

Cited In (83)

• Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
• Trust Management
• Constraints Solution for Time Sensitive Security Protocols
• Title not available (Why is that?)
• Formal Methods for Assuring Security of Protocols
• EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS
• Comparative Analysis of Formal Model Checking Tools for Security Protocol Verification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Key Compromise, Strand Spaces, and the Authentication Tests1 1I gave my MFPS 17 talk on 24 May 2001, Bob Dylan's sixtieth birthday. This paper is dedicated to him.
• Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication
• Logics in Artificial Intelligence
• Title not available (Why is that?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Secure Systems Development with UML
• Foundations of Software Science and Computation Structures
• Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis
• Title not available (Why is that?)
• CONCUR 2005 – Concurrency Theory
• Modeling adversaries in a logic for security protocol analysis
• Title not available (Why is that?)
• A quantifier-free first-order knowledge logic of authentication
• Probabilistic and nondeterministic aspects of anonymity
• Source code verification of a secure payment applet
• Distributed temporal logic for the analysis of security protocol models
• Pattern-matching spi-calculus
• On global types and multi-party sessions
• On the semantics of Alice \& Bob specifications of security protocols
• A formal semantics for protocol narrations
• Title not available (Why is that?)
• SAT-solving in CSP trace refinement
• Safely composing security protocols
• Injective synchronisation: An extension of the authentication hierarchy
• Title not available (Why is that?)
• Process Algebra and Model Checking
• Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
• Searching for Shapes in Cryptographic Protocols
• Modeling and Verifying Time Sensitive Security Protocols with Constraints
• Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
• Alice and Bob Meet Equational Theories
• Title not available (Why is that?)
• Compiling and securing cryptographic protocols
• Title not available (Why is that?)
• Operational semantics and verification of security protocols.
• FDR explorer
• Automatic verification of temporal-epistemic properties of cryptographic protocols
• Authentication tests and the structure of bundles.
• Title not available (Why is that?)
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• Log Your Car: Reliable Maintenance Services Record
• Programming Languages and Systems
• Modelling and checking timed authentication of security protocols
• Explicit randomness is not necessary when modeling probabilistic encryption
• Model Checking Security Protocols
• Communicating Sequential Processes. The First 25 Years
• Title not available (Why is that?)
• Recent Trends in Algebraic Development Techniques
• Specification of communicating processes: temporal logic versus refusals-based refinement
• Maude versus Haskell: An experimental comparison in security protocol analysis
• Alice and Bob: Reconciling Formal Models and Implementation
• Relating two standard notions of secrecy
• The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
• Title not available (Why is that?)
• Application-Binding Protocol in the User Centric Smart Card Ownership Model
• Efficient representation of the attacker's knowledge in cryptographic protocols analysis
• ZB 2005: Formal Specification and Development in Z and B
• Verifying security protocols modelled by networks of automata
• Formal correctness of security protocols.
• Integrating Verification, Testing, and Learning for Cryptographic Protocols
• Algebraic Intruder Deductions
• SeVe: automatic tool for verification of security protocols
• Title not available (Why is that?)
• Probabilistic anonymity via coalgebraic simulations
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Mathematical Foundations of Computer Science 2003
• Title not available (Why is that?)
• Cryptographic Protocol Composition via the Authentication Tests
• Comparing State Spaces in Automatic Security Protocol Analysis

This page was built for software: Casper