Soundness of Formal Encryption in the Presence of Key-Cycles
From MaRDI portal
Recommendations
- Theory of Cryptography
- Information Security and Cryptology - ICISC 2003
- scientific article; zbMATH DE number 1759457
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Computational soundness, co-induction, and encryption cycles
- Programming Languages and Systems
- Advances in Cryptology - CRYPTO 2003
- scientific article; zbMATH DE number 1842510
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
Cites work
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Automata, Languages and Programming
- Automata, Languages and Programming
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 503243 (Why is no real title available?)
- scientific article; zbMATH DE number 1951605 (Why is no real title available?)
- scientific article; zbMATH DE number 1962854 (Why is no real title available?)
- scientific article; zbMATH DE number 1497864 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 2242582 (Why is no real title available?)
- Information Security and Cryptology - ICISC 2003
- Logics for reasoning about cryptographic constructions
- On the security of public key protocols
- Programming Languages and Systems
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Security and composition of multiparty cryptographic protocols
- Symmetric authentication within a simulatable cryptographic library
- The Notion of Security for Probabilistic Cryptosystems
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
Cited in
(15)- Computationally sound implementations of equational theories against passive adversaries
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
- Rate-1 key-dependent message security via reusable homomorphic extractor against correlated-source attacks
- CPA-to-CCA transformation for KDM security
- KDM security for identity-based encryption: constructions and separations
- Universally composable symbolic security analysis
- Sound and complete computational interpretation of symbolic hashes in the standard model
- Circular security is complete for KDM security
- Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption
- Computational soundness, co-induction, and encryption cycles
- Computational soundness of coinductive symbolic security under active attacks
- Programming Languages and Systems
- Advances in Cryptology - CRYPTO 2003
- Towards Key-Dependent Message Security in the Standard Model
- Information Security and Cryptology - ICISC 2003
This page was built for publication: Soundness of Formal Encryption in the Presence of Key-Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862672)
