Soundness of Formal Encryption in the Presence of Key-Cycles
From MaRDI portal
Recommendations
- Theory of Cryptography
- Sound computational interpretation of formal encryption with composed keys
- Reconciling two views of cryptography (the computational soundness of formal encryption)
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Computational soundness, co-induction, and encryption cycles
- Completing the picture: Soundness of formal encryption in the presence of active adversaries
- Advances in Cryptology - CRYPTO 2003
- Soundness in the public-key model
- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption
Cites work
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Adaptive security of symbolic encryption
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- An efficient system for non-transferable anonymous credentials with optional anonymity revocation
- Computationally sound implementations of equational theories against passive adversaries
- Computationally sound, automated proofs for security protocols
- Cryptographically sound and machine-assisted verification of security protocols
- Encryption-scheme security in the presence of key-dependent messages
- Formal eavesdropping and its computational interpretation
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 503243 (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?)
- Logics for reasoning about cryptographic constructions
- On the relationships between notions of simulation-based security
- On the security of public key protocols
- Probabilistic polynomial-time semantics for a protocol security logic
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Relations among notions of security for public-key encryption schemes
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Security and composition of multiparty cryptographic protocols
- Sound computational interpretation of formal encryption with composed keys
- Symmetric authentication within a simulatable cryptographic library
- The Notion of Security for Probabilistic Cryptosystems
- 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
- Completing the picture: Soundness of formal encryption in the presence of active adversaries
- Advances in Cryptology - CRYPTO 2003
- Towards Key-Dependent Message Security in the Standard Model
- Sound computational interpretation of formal encryption with composed keys
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)