Pages that link to "Item:Q1283776"
From MaRDI portal
The following pages link to A calculus for cryptographic protocols: The spi calculus (Q1283776):
Displayed 50 items.
- Declarative event based models of concurrency and refinement in psi-calculi (Q272301) (← links)
- Compositional refinement in agent-based security protocols (Q432140) (← links)
- Computing strong and weak bisimulations for psi-calculi (Q444457) (← links)
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- Modeling ontology evolution with SetPi (Q497901) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Multi-attacker protocol validation (Q540676) (← links)
- Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← links)
- Trace-based verification of imperative programs with I/O (Q617977) (← links)
- A pure labeled transition semantics for the applied pi calculus (Q621583) (← links)
- \textsf{CaPiTo}: Protocol stacks for services (Q640297) (← links)
- Multiset rewriting for the verification of depth-bounded processes with name binding (Q714507) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Process algebras as support for sustainable systems of services (Q814902) (← links)
- Probabilistic and nondeterministic aspects of anonymity (Q843094) (← links)
- Deciding knowledge in security protocols under equational theories (Q860894) (← links)
- On the semantics of Alice \& Bob specifications of security protocols (Q860900) (← links)
- Injective synchronisation: An extension of the authentication hierarchy (Q860905) (← links)
- A framework for security analysis of mobile wireless networks (Q860908) (← links)
- Verifying the SET purchase protocols (Q861698) (← links)
- Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (Q880987) (← links)
- Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
- Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
- Making random choices invisible to the scheduler (Q979081) (← links)
- A domain-specific language for cryptographic protocols based on streams (Q1001891) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- Quantifying information leakage in process calculi (Q1023286) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Typing correspondence assertions for communication protocols (Q1399972) (← links)
- Mobile ambients (Q1575154) (← links)
- Types for access control (Q1575157) (← links)
- Primitives for authentication in process algebras. (Q1603653) (← links)
- Dynamic connectors for concurrency (Q1603689) (← links)
- Secrecy and group creation (Q1763430) (← links)
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types (Q1770362) (← links)
- Tree automata with one memory set constraints and cryptographic protocols (Q1770429) (← links)
- A framework for specifying and verifying the behaviour of open systems (Q1779319) (← links)
- Analysis of security protocols as open systems (Q1853583) (← links)
- A new logic for electronic commerce protocols (Q1853749) (← links)
- A comparison of three authentication properties. (Q1853750) (← links)
- Static analysis for the \(\pi\)-calculus with applications to security (Q1854437) (← links)
- Trace and testing equivalence on asynchronous processes (Q1854499) (← links)
- Secrecy types for asymmetric communication. (Q1874278) (← links)
- Private authentication (Q1881255) (← links)
- Modeling ontology evolution via pi-calculus (Q1991883) (← links)
- The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
- Compositional reasoning for shared-variable concurrent programs (Q2024370) (← links)