Quantum Encryption Notions
Relations among competing definitions of IND-CPA-style security against quantum adversaries.
| Status | Statement | Tags |
|---|---|---|
|
Erasing real-or-random vs Boneh–Zhandry Open: whether erasing real-or-random security implies Boneh-Zhandry security. The reverse non-implication is proved only in the quantum random oracle model, and this direction is one of six non-implications the source paper conjectures and does not prove. 5 open |
Quantum CryptographyQuantum Encryption Notionsseparation | |
|
One erasing challenge vs many embedding learns Open: whether a single erasing two-ciphertext challenge query, with classical learning queries, implies security against polynomially many embedding-model superposition learning queries. One of six non-implications the source paper conjectures, and on its own account the one that would close the most remaining cells. 5 open |
Quantum CryptographyQuantum Encryption Notionsseparation | |
|
Standard real-or-random vs embedding two-ciphertext Open: whether one standard-oracle real-or-random challenge query implies one embedding-model two-ciphertext challenge query, with classical learning queries on both sides. Both notions are singleton classes in the source’s classification, and this is one of six non-implications it conjectures. 5 open |
Quantum CryptographyQuantum Encryption Notionsseparation |
No matching items