Security amplification by composition: The case of doubly-iterated, ideal ciphers
From MaRDI portal
Recommendations
- Security amplification for the composition of block ciphers: simpler proofs and new results
- Amplification of Chosen-Ciphertext Security
- Security Amplification for Interactive Cryptographic Primitives
- The security of multiple encryption in the ideal cipher model
- Efficient key dependent message security amplification against chosen ciphertext attacks
- Key-dependent message security: generic amplification and completeness
- Key-dependent message security: generic amplification and completeness
- Combiners for chosen-ciphertext security
- Practical dual-receiver encryption. Soundness, complete non-malleability, and applications
- Efficient amplification of the security of weak pseudo-random function generators
Cited in
(10)- A polynomial-time universal security amplifier in the class of block ciphers
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
- Tight time-space lower bounds for finding multiple collision pairs and their applications
- scientific article; zbMATH DE number 1689006 (Why is no real title available?)
- Security amplification for the composition of block ciphers: simpler proofs and new results
- Security amplification against meet-in-the-middle attacks using whitening
- The security of multiple encryption in the ideal cipher model
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Amplification of Chosen-Ciphertext Security
- The Multi-user Security of Double Encryption
This page was built for publication: Security amplification by composition: The case of doubly-iterated, ideal ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249346)
