Pages that link to "Item:Q1283776"
From MaRDI portal
The following pages link to A calculus for cryptographic protocols: The spi calculus (Q1283776):
Displaying 41 items.
- Static Evidences for Attack Reconstruction (Q3460869) (← links)
- A Probabilistic Applied Pi–Calculus (Q3498438) (← links)
- Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap (Q3498468) (← links)
- Ugo Montanari and Software Verification (Q3507392) (← links)
- Implementing Spi Calculus Using Nominal Techniques (Q3507444) (← links)
- Channel abstractions for network security (Q3550700) (← links)
- Formal Analysis of Dynamic, Distributed File-System Access Controls (Q3613061) (← links)
- Bisimulation for Demonic Schedulers (Q3617738) (← links)
- Typing Correspondence Assertions for Communication Protocols (Q4917053) (← links)
- A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Q4917062) (← links)
- Encryption as an abstract data-type (Q4924525) (← links)
- (Q5009710) (← links)
- Symmetric Authentication within a Simulatable Cryptographic Library (Q5030211) (← links)
- Trace Equivalence and Epistemic Logic to Express Security Properties (Q5041278) (← links)
- Towards Secrecy for Rewriting in Weakly Adhesive Categories (Q5166615) (← links)
- Counting the Cost in the Picalculus (Extended Abstract) (Q5166616) (← links)
- A Complete Symbolic Bisimilarity for an Extended Spi Calculus (Q5170184) (← links)
- Type Inference for Correspondence Types (Q5170185) (← links)
- Security Abstractions and Intruder Models (Extended Abstract) (Q5170668) (← links)
- Verification of Correspondence Assertions in a Calculus for Mobile Ad Hoc Networks (Q5179206) (← links)
- A Logical Characterisation of Static Equivalence (Q5262936) (← links)
- Bisimulation and Co-induction: Some Problems (Q5262977) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- Foundations of Software Science and Computation Structures (Q5308441) (← links)
- Programming Languages and Systems (Q5308708) (← links)
- Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming (Q5325767) (← links)
- Automated Technology for Verification and Analysis (Q5394175) (← links)
- Computational and Information Science (Q5491642) (← links)
- A Formal Analysis of Complex Type Flaw Attacks on Security Protocols (Q5505422) (← links)
- (Q5856409) (← links)
- A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol (Q5862307) (← links)
- Psi-calculi in Isabelle (Q5890661) (← links)
- A bisimulation for dynamic sealing (Q5899331) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900575) (← links)
- Foundations of Security Analysis and Design II (Q5901852) (← links)
- From rewrite rules to bisimulation congruences (Q5958468) (← links)
- Reasoning about cryptographic protocols in the spi calculus (Q6044108) (← links)
- Adversarial logic (Q6109430) (← links)
- DeepSec: deciding equivalence properties for security protocols -- improved theory and practice (Q6566464) (← links)
- A generic type system for higher-order \(\Psi\)-calculi (Q6614878) (← links)
- Processes, systems \& tests: defining contextual equivalences (Q6649539) (← links)