Pages that link to "Item:Q2368990"

The following pages link to A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990):

Displaying 17 items.

• Layout randomization and nondeterminism (Q265789) (← links)
• A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
• Algebra and logic for access control (Q968301) (← links)
• On the relationships between notions of simulation-based security (Q1021241) (← links)
• Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
• State separation for code-based game-playing proofs (Q1710673) (← links)
• Task-structured probabilistic I/O automata (Q1745718) (← links)
• The RSA group is pseudo-free (Q2267366) (← links)
• Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
• Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
• The computational SLR: a logic for reasoning about computational indistinguishability (Q3060197) (← links)
• A Probabilistic Applied Pi–Calculus (Q3498438) (← links)
• The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209) (← links)
• A Calculus for Game-Based Security Proofs (Q4933210) (← links)
• Layout Randomization and Nondeterminism (Q5418953) (← links)
• Soundness of Formal Encryption in the Presence of Key-Cycles (Q5862672) (← links)