Less is more: on copy complexity in quantum cryptography
From MaRDI portal
Cites work
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Collusion resistant copy-protection for watermarkable functionalities
- Cryptography from pseudorandom quantum states
- Explicit orthogonal and unitary designs
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- PKE and ABE with collusion-resistant secure key leasing
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Pseudorandom quantum states
- Quantum commitments and signatures without one-way functions
- Quantum lightning never strikes the same state twice
- Quantum money from hidden subspaces
- Scalable pseudorandom quantum states
- Secure identity-based encryption in the quantum random oracle model
- Shadow tomography of quantum states
- Unclonable cryptography with unbounded collusions and impossibility of hyperefficient shadow tomography
This page was built for publication: Less is more: on copy complexity in quantum cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443366)