Ideal key derivation and encryption in simulation-based security
From MaRDI portal
Publication:3073705
Recommendations
Cites work
- scientific article; zbMATH DE number 1263181 (Why is no real title available?)
- scientific article; zbMATH DE number 1942418 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- scientific article; zbMATH DE number 2086716 (Why is no real title available?)
- A Modular Security Analysis of the TLS Handshake Protocol
- Advances in Cryptology - CRYPTO 2003
- Authenticated key exchange secure against dictionary attacks
- Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
- How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.
- Ideal key derivation and encryption in simulation-based security
- Inductive Proofs of Computational Secrecy
- On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- Polynomial runtime and composability
- Theory of Cryptography
- Universally Composable Security Analysis of TLS
Cited in
(4)
This page was built for publication: Ideal key derivation and encryption in simulation-based security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073705)