scientific article; zbMATH DE number 1759624
From MaRDI portal
Publication:4536615
zbMath0999.94538MaRDI QIDQ4536615
Roberto M. Amadio, Denis Lugiez
Publication date: 28 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (24)
Protocol insecurity with a finite number of sessions and composed keys is NP-complete. ⋮ Probabilistic and nondeterministic aspects of anonymity ⋮ 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 ⋮ Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks ⋮ Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols ⋮ State space reduction in the Maude-NRL protocol analyzer ⋮ Bounded memory Dolev-Yao adversaries in collaborative systems ⋮ Computing knowledge in equational extensions of subterm convergent theories ⋮ Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete ⋮ Efficient representation of the attacker's knowledge in cryptographic protocols analysis ⋮ Satisfiability of general intruder constraints with and without a set constructor ⋮ Unnamed Item ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ 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 ⋮ A Proof Theoretic Analysis of Intruder Theories ⋮ A symbolic decision procedure for cryptographic protocols with time stamps ⋮ Bounded memory protocols ⋮ Analysis of security protocols as open systems ⋮ On the symbolic reduction of processes with cryptographic functions.
This page was built for publication:
