One-time memories secure against depth-bounded quantum circuits
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 7651031 (Why is no real title available?)
- A single quantum cannot be cloned
- Depth-bounded quantum cryptography with applications to one-time memory and more
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Hidden cosets and applications to unclonable cryptography
- How to record quantum queries, and applications to quantum indifferentiability
- Lockable obfuscation
- Obfuscating compute-and-compare programs under LWE
- On lattices, learning with errors, random linear codes, and cryptography
- One-Time Programs
- One-time programs from commodity hardware
- Pseudorandom functions and lattices
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Quantum money from hidden subspaces
- Quantum one-time programs. (Extended abstract)
- Quantum one-time protection of any randomized algorithm
- Revocable Quantum Timed-Release Encryption
- Software with certified deletion
- Time-lock puzzles from randomized encodings
This page was built for publication: One-time memories secure against depth-bounded quantum circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6840137)