Post-quantum plaintext-awareness
From MaRDI portal
Publication:6166987
Recommendations
Cites work
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Commitments and efficient zero-knowledge proofs from learning parity with noise
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application
- How to record quantum queries, and applications to quantum indifferentiability
- How to securely release unverified plaintext in authenticated encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On the Power of Quantum Computation
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Post-quantum Security of Plain OAEP Transform
- Quantum indistinguishability for public key encryption
- Relationships between quantum IND-CPA notions
- Secure signatures and chosen ciphertext security in a quantum computing world
- Security models and proof strategies for plaintext-aware encryption
- Semantic security and indistinguishability in the quantum world
- The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
- Towards Plaintext-Aware Public-Key Encryption Without Random Oracles
Cited in
(5)
This page was built for publication: Post-quantum plaintext-awareness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166987)