scientific article; zbMATH DE number 1962758
From MaRDI portal
Publication:4418589
zbMath1033.94513MaRDI QIDQ4418589
Iliano Cervesato, John C. Mitchell, Nancy A. Durgin, Patrick D. Lincoln, Andrej Scedrov
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2609/26090356.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Protocol insecurity with a finite number of sessions and composed keys is NP-complete., A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols, Model Checking Security Protocols, The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols, Secure key management policies in strand spaces, On the complexity of verification of time-sensitive distributed systems, Joshua Guttman: pioneering strand spaces, An undecidability result for AGh, A (restricted) quantifier elimination for security protocols, Decidability issues for extended ping-pong protocols, Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks, Intruder deduction for the equational theory of abelian groups with distributive encryption, Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types, A game-theoretic framework for specification and verification of cryptographic protocols, Deciding equivalence-based properties using constraint solving, Verifying Cryptographic Protocols with Subterms Constraints, To know or not to know: Epistemic approaches to security protocol verification, Strand spaces with choice via a process algebra semantics, State and progress in strand spaces: proving fair exchange, A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols, Relating State-Based and Process-Based Concurrency through Linear Logic, On the relationships between models in protocol verification, Unnamed Item, Unnamed Item, Contract signing, optimism, and advantage, Distributed temporal logic for the analysis of security protocol models, Verification of cryptographic protocols: tagging enforces termination, Tree automata with one memory set constraints and cryptographic protocols, An NP decision procedure for protocol insecurity with XOR, Simulation relations for alternating Büchi automata, A method for symbolic analysis of security protocols, Multiset rewriting for the verification of depth-bounded processes with name binding, Pattern-matching spi-calculus, A decidable class of security protocols for both reachability and equivalence properties, Relating state-based and process-based concurrency through linear logic (full-version), Bounding Messages for Free in Security Protocols, On the freedom of decryption, Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables, Comparing State Spaces in Automatic Security Protocol Analysis, Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case, Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture, Safely composing security protocols, Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates, A semantics for nabla, Models for an Adversary-Centric Protocol Logic, Information based reasoning about security protocols, Security protocols: from linear to classical logic by abstract interpretation, On the symbolic reduction of processes with cryptographic functions., Authentication tests and the structure of bundles., Finite-state analysis of two contract signing protocols
