From plaintext-extractability to IND-CCA security
From MaRDI portal
Recommendations
Cites work
- Coding theorem and strong converse for quantum channels
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- On security notions for encryption in a quantum world
- Online-extractability in the quantum random-oracle model
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Post-quantum plaintext-awareness
- Post-quantum Security of Plain OAEP Transform
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Random oracles in a quantum world
- RSA-OAEP is secure under the RSA assumption
- Secure signatures and chosen ciphertext security in a quantum computing world
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
This page was built for publication: From plaintext-extractability to IND-CCA security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619857)