The following pages link to (Q2763667):
Displaying 14 items.
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- Magic-sets for localised analysis of Java bytecode (Q656846) (← links)
- Type systems equivalent to data-flow analyses for imperative languages (Q860844) (← links)
- Cryptographically-masked flows (Q935463) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Unifying simulatability definitions in cryptographic systems under different timing assumptions (Q2484407) (← links)
- More Typed Assembly Languages for Confidentiality (Q3498434) (← links)
- OAEP Is Secure under Key-Dependent Messages (Q3600394) (← links)
- Computational Probabilistic Non-interference (Q5030175) (← links)
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption (Q5458849) (← links)
- A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol (Q5862307) (← links)
- Limits of the BRSIM/UC Soundness of Dolev-Yao Models with Hashes (Q5862528) (← links)
- Limits of the Cryptographic Realization of Dolev-Yao-Style XOR (Q5862666) (← links)
- Quantifying Probabilistic Information Flow in Computational Reactive Systems (Q5862670) (← links)
