scientific article; zbMATH DE number 1754628

zbMath0986.94022MaRDI QIDQ4535055

Michele Boreale

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760667

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

concurrencyspi-calculusformal methods for security protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (19)

Formalising Observer Theory for Environment-Sensitive Bisimulation ⋮ The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols ⋮ Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols ⋮ Decidability issues for extended ping-pong protocols ⋮ On-the-Fly Model Checking of Fair Non-repudiation Protocols ⋮ Authentication Revisited: Flaw or Not, the Recursive Authentication Protocol ⋮ Efficient representation of the attacker's knowledge in cryptographic protocols analysis ⋮ A semantic framework for open processes ⋮ Transducer-based analysis of cryptographic protocols ⋮ Hierarchical combination of intruder theories ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ An NP decision procedure for protocol insecurity with XOR ⋮ Simulation relations for alternating Büchi automata ⋮ A method for symbolic analysis of security protocols ⋮ Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures ⋮ A Proof Theoretic Analysis of Intruder Theories ⋮ Comparing State Spaces in Automatic Security Protocol Analysis ⋮ A symbolic decision procedure for cryptographic protocols with time stamps ⋮ Models and emerging trends of concurrent constraint programming

This page was built for publication: