scientific article; zbMATH DE number 1759624
From MaRDI portal
Publication:4536615
zbMATH Open0999.94538MaRDI QIDQ4536615FDOQ4536615
Authors: Roberto M. Amadio, D. Lugiez 
Publication date: 28 November 2002
Title of this publication is not available (Why is that?)
Recommendations
- On the symbolic reduction of processes with cryptographic functions.
- On the symbolic reduction of processes with cryptographic functions
- scientific article; zbMATH DE number 1754628
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- Three systems for cryptographic protocol analysis
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (42)
- Deciding security properties for cryptographic protocols. application to key cycles
- Bounded memory protocols
- Probabilistic and nondeterministic aspects of anonymity
- Title not available (Why is that?)
- 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?)
- Key Substitution in the Symbolic Analysis of Cryptographic Protocols
- 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
- Verification, Model Checking, and Abstract Interpretation
- Simulation relations for alternating Büchi automata
- A static analysis of cryptographic processes: the denotational approach
- The coinductive approach to verifying cryptographic protocols.
- Tree automata with one memory set constraints and cryptographic protocols
- Bounded memory Dolev-Yao adversaries in collaborative systems
- Deciding Key Cycles for Security Protocols
- Foundations of Software Science and Computation Structures
- 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
- The practice of cryptographic protocol verification
- CONCUR 2004 - Concurrency Theory
- On the symbolic reduction of processes with cryptographic functions
- 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
- Protocol Verification Via Rigid/Flexible Resolution
- Analysis of security protocols as open systems
- Satisfiability of general intruder constraints with and without a set constructor
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- Finite Models in FOL-Based Crypto-Protocol Verification
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
