Pages that link to "Item:Q5408416"
From MaRDI portal
The following pages link to Probabilistic relational verification for cryptographic implementations (Q5408416):
Displaying 16 items.
- Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
- A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
- Toward automatic verification of quantum programs (Q667515) (← links)
- Program synthesis for interactive-security systems (Q1696589) (← links)
- Translation certification for smart contracts (Q2163161) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- CryptHOL: game-based proofs in higher-order logic (Q2175214) (← links)
- Coupled relational symbolic execution for differential privacy (Q2233459) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- Product programs and relational program logics (Q2374302) (← links)
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic (Q2802495) (← links)
- A Formalized Hierarchy of Probabilistic System Types (Q2945633) (← links)
- (Q3342359) (← links)
- Relational Hash: Probabilistic Hash for Verifying Relations, Secure Against Forgery and More (Q3457126) (← links)
- (Q5009416) (← links)
- Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
