Pages that link to "Item:Q2490263"

The following pages link to Logics for reasoning about cryptographic constructions (Q2490263):

Displaying 18 items.

• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
• The RSA group is pseudo-free (Q2267366) (← links)
• Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
• The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
• Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
• Modal logics for cryptographic processes (Q2842609) (← links)
• The computational SLR: a logic for reasoning about computational indistinguishability (Q3060197) (← links)
• Axiomatizing Resource Bounds for Measure (Q3091445) (← links)
• Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience (Q3100218) (← links)
• The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209) (← links)
• (Q4447230) (← links)
• A Calculus for Game-Based Security Proofs (Q4933210) (← links)
• Secrecy Logic: Protoalgebraic S-Secrecy Logics (Q5412170) (← links)
• A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol (Q5862307) (← links)
• Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos (Q5862527) (← links)
• Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes (Q5862528) (← links)
• Machine-Checked Security Proofs of Cryptographic Signature Schemes (Q5862663) (← links)
• Soundness of Formal Encryption in the Presence of Key-Cycles (Q5862672) (← links)