Pages that link to "Item:Q4917062"
From MaRDI portal
The following pages link to A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Q4917062):
Displaying 14 items.
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- A framework for analyzing probabilistic protocols and its application to the partial secrets exchange (Q2463563) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- A process algebra for reasoning about quantum security (Q2864166) (← links)
- (Q4493893) (← 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)
