The following pages link to Programming Languages and Systems (Q5316562):
Displaying 16 items.
- A survey of symbolic methods in computational analysis of cryptographic systems (Q540683) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Secure mechanical verification of mutually recursive procedures (Q1887136) (← links)
- Universally composable symbolic security analysis (Q2429708) (← links)
- Explicit randomness is not necessary when modeling probabilistic encryption (Q2866728) (← links)
- Computational soundness of symbolic analysis for protocols using hash functions (Q2866733) (← links)
- How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. (Q3113670) (← links)
- Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
- OAEP Is Secure under Key-Dependent Messages (Q3600394) (← links)
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption (Q3631375) (← links)
- Automating Computational Proofs for Public-Key-Based Key Exchange (Q4933211) (← links)
- Computer-Aided Security Proofs for the Working Cryptographer (Q5199185) (← links)
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography (Q5458826) (← links)
- Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos (Q5862527) (← links)
- Soundness of Formal Encryption in the Presence of Key-Cycles (Q5862672) (← links)
- Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols (Q6485963) (← links)
