Pages that link to "Item:Q2784489"

The following pages link to Proof Techniques for Cryptographic Processes (Q2784489):

Displaying 15 items.

• Deciding equivalence-based properties using constraint solving (Q391121) (← links)
• Decidability of equivalence of symbolic derivations (Q437031) (← links)
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
• Encoding cryptographic primitives in a calculus with polyadic synchronisation (Q540687) (← links)
• Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
• Analysis of security protocols as open systems (Q1853583) (← links)
• On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
• Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
• Automated verification of selected equivalences for security protocols (Q2474047) (← links)
• Modal Logics for Cryptographic Processes (Q2842609) (← links)
• (Q2851059) (← links)
• A Testing Theory for a Higher-Order Cryptographic Language (Q3000588) (← links)
• Formalising Observer Theory for Environment-Sensitive Bisimulation (Q3183528) (← links)
• A Logical Characterisation of Static Equivalence (Q5262936) (← links)
• When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus (Q6041667) (← links)