Casper
From MaRDI portal
Software:18651
No author found.
Related Items (83)
Modeling Adversaries in a Logic for Security Protocol Analysis ⋮ On Global Types and Multi-Party Session ⋮ Protocol insecurity with a finite number of sessions and composed keys is NP-complete. ⋮ Source code verification of a secure payment applet ⋮ Comparative Analysis of Formal Model Checking Tools for Security Protocol Verification ⋮ Unnamed Item ⋮ Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication ⋮ Unnamed Item ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ Model Checking Security Protocols ⋮ Process Algebra and Model Checking ⋮ Alice and Bob: Reconciling Formal Models and Implementation ⋮ The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols ⋮ Unnamed Item ⋮ Trust Management ⋮ Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Logics in Artificial Intelligence ⋮ Unnamed Item ⋮ On the semantics of Alice \& Bob specifications of security protocols ⋮ Injective synchronisation: An extension of the authentication hierarchy ⋮ Unnamed Item ⋮ Formal correctness of security protocols. ⋮ Theory and Applications of Satisfiability Testing ⋮ Unnamed Item ⋮ Operational semantics and verification of security protocols. ⋮ Alice and Bob Meet Equational Theories ⋮ Unnamed Item ⋮ Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets ⋮ Unnamed Item ⋮ Formal Methods for Assuring Security of Protocols ⋮ Unnamed Item ⋮ SAT-solving in CSP trace refinement ⋮ Log Your Car: Reliable Maintenance Services Record ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algebraic Intruder Deductions ⋮ Specification of communicating processes: temporal logic versus refusals-based refinement ⋮ Efficient representation of the attacker's knowledge in cryptographic protocols analysis ⋮ ZB 2005: Formal Specification and Development in Z and B ⋮ A formal semantics for protocol narrations ⋮ Unnamed Item ⋮ Communicating Sequential Processes. The First 25 Years ⋮ Unnamed Item ⋮ Application-Binding Protocol in the User Centric Smart Card Ownership Model ⋮ 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. ⋮ Modeling and Verifying Time Sensitive Security Protocols with Constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings ⋮ SeVe: automatic tool for verification of security protocols ⋮ SAT-Based Verification of Security Protocols Via Translation to Networks of Automata ⋮ Relating two standard notions of secrecy ⋮ Distributed temporal logic for the analysis of security protocol models ⋮ Probabilistic anonymity via coalgebraic simulations ⋮ Mathematical Foundations of Computer Science 2003 ⋮ Automatic verification of temporal-epistemic properties of cryptographic protocols ⋮ Pattern-matching spi-calculus ⋮ FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ⋮ Searching for Shapes in Cryptographic Protocols ⋮ Compiling and securing cryptographic protocols ⋮ Integrating Verification, Testing, and Learning for Cryptographic Protocols ⋮ Constraints Solution for Time Sensitive Security Protocols ⋮ Cryptographic Protocol Composition via the Authentication Tests ⋮ Secure Systems Development with UML ⋮ Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis ⋮ Recent Trends in Algebraic Development Techniques ⋮ Comparing State Spaces in Automatic Security Protocol Analysis ⋮ FDR explorer ⋮ CONCUR 2005 – Concurrency Theory ⋮ Foundations of Software Science and Computation Structures ⋮ Safely composing security protocols ⋮ EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS ⋮ Unnamed Item ⋮ Tools and Algorithms for the Construction and Analysis of Systems ⋮ Programming Languages and Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Explicit Randomness is not Necessary when Modeling Probabilistic Encryption ⋮ Authentication tests and the structure of bundles.
This page was built for software: Casper
