A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
From MaRDI portal
Recommendations
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Faster chosen-key distinguishers on reduced-round AES
- A practical approach to attaining chosen ciphertext security
- Efficient chosen-ciphertext security via extractable hash proofs
- Improved efficiency of chosen ciphertext secure encryption from factoring
- Chosen-ciphertext security without redundancy
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Chosen ciphertext secure encryption under factoring assumption revisited
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- scientific article; zbMATH DE number 2009957
Cited in
(14)- scientific article; zbMATH DE number 1942437 (Why is no real title available?)
- From non-adaptive to adaptive pseudorandom functions
- scientific article; zbMATH DE number 1759792 (Why is no real title available?)
- Range Extension for Weak PRFs; The Good, the Bad, and the Ugly
- Information Security and Cryptology - ICISC 2005
- Subversion-resilient authenticated encryption without random oracles
- Efficient Shared-Key Authentication Scheme from Any Weak Pseudorandom Function
- Tweakable Enciphering Schemes from Hash-Sum-Expansion
- Information Security and Cryptology - ICISC 2005
- Weak Pseudorandom Functions in Minicrypt
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Two-round man-in-the-middle security from LPN
- Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
This page was built for publication: A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429409)
