scientific article; zbMATH DE number 1927582
From MaRDI portal
Publication:4484507
zbMath1012.68522MaRDI QIDQ4484507
Witold Charatonik, Roberto M. Amadio
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210499.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (15)
An undecidability result for AGh ⋮ Decidability issues for extended ping-pong protocols ⋮ Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks ⋮ Deciding equivalence-based properties using constraint solving ⋮ Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically ⋮ Rigid tree automata and applications ⋮ Verification of cryptographic protocols: tagging enforces termination ⋮ An NP decision procedure for protocol insecurity with XOR ⋮ Simulation relations for alternating Büchi automata ⋮ Pattern-matching spi-calculus ⋮ Safely Composing Security Protocols ⋮ Comparing State Spaces in Automatic Security Protocol Analysis ⋮ Safely composing security protocols ⋮ Formal modeling and analysis of fairness characterization of E-commerce protocols ⋮ On the symbolic reduction of processes with cryptographic functions.
This page was built for publication:
