Quantum unpredictability
From MaRDI portal
Cites work
- A note on computational indistinguishability
- Computational Security of Quantum Encryption
- Cryptography from pseudorandom quantum states
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- General properties of quantum bit commitments (extended abstract)
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 1302852 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- On the computational hardness needed for quantum cryptography
- Optimal counterfeiting attacks and generalizations for Wiesner's quantum money
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Pseudorandom quantum states
- Pseudorandomness with proof of destruction and applications
- Quantum commitments and signatures without one-way functions
- Quantum cryptography in Algorithmica
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum money from hidden subspaces
- Secure signatures and chosen ciphertext security in a quantum computing world
- The theory of quantum information
This page was built for publication: Quantum unpredictability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965383)