scientific article; zbMATH DE number 1759624

zbMATH Open0999.94538MaRDI QIDQ4536615FDOQ4536615

Roberto M. Amadio, D. Lugiez

Publication date: 28 November 2002

Title of this publication is not available (Why is that?)

zbMATH Keywords

verificationsymbolic computationcryptographic protocols

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (29)

• Bounded memory protocols
• Probabilistic and nondeterministic aspects of anonymity
• Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
• A Proof Theoretic Analysis of Intruder Theories
• A method for symbolic analysis of security protocols
• Title not available (Why is that?)
• Decidability issues for extended ping-pong protocols
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks
• On the symbolic reduction of processes with cryptographic functions.
• An NP decision procedure for protocol insecurity with XOR
• A symbolic decision procedure for cryptographic protocols with time stamps
• Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
• Deciding framed bisimilarity
• Simulation relations for alternating Büchi automata
• A static analysis of cryptographic processes: the denotational approach
• Tree automata with one memory set constraints and cryptographic protocols
• Bounded memory Dolev-Yao adversaries in collaborative systems
• Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
• State space reduction in the Maude-NRL protocol analyzer
• Title not available (Why is that?)
• Probabilistic Termination and Composability of Cryptographic Protocols
• Computing knowledge in equational extensions of subterm convergent theories
• The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols
• Efficient representation of the attacker's knowledge in cryptographic protocols analysis
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Analysis of security protocols as open systems
• Satisfiability of general intruder constraints with and without a set constructor
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• On the symbolic reduction of processes with cryptographic functions. 👍 👎
• On the symbolic reduction of processes with cryptographic functions 👍 👎
• Title not available (Why is that?) 👍 👎
• Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or 👍 👎
• Three systems for cryptographic protocol analysis 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536615)