A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7651035
- Trading locality for time: certifiable randomness from low-depth circuits
- Certifiable quantum dice, or, true random number generation secure against quantum adversaries
- Certifiable quantum dice
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
Cited in
(32)- Trading locality for time: certifiable randomness from low-depth circuits
- Quantum money with mintage supervision
- Secure quantum computation with classical communication
- Secure software leasing from standard assumptions
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
- Classical verification of quantum computations
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- scientific article; zbMATH DE number 7651035 (Why is no real title available?)
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- Classical Homomorphic Encryption for Quantum Circuits
- Quantum encryption with certified deletion, revisited: public key, attribute-based, and classical communication
- Constructive post-quantum reductions
- Post-quantum insecurity from LWE
- Simple tests of quantumness also certify qubits
- Certified randomness from quantum supremacy
- Obfuscation of pseudo-deterministic quantum circuits
- Quantum advantage from any non-local game
- Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
- Semi-quantum copy-protection and more
- How to construct quantum FHE, generically
- Quantum advantage from one-way functions
- Revocable quantum digital signatures
- Quantum cryptography and meta-complexity
- Quantum key leasing for PKE and FHE with a classical lessor
- A simple framework for secure key leasing
- Quantum money from abelian group actions
- A direct product theorem for quantum communication complexity with applications to device-independent cryptography
- Quantum key-revocable dual-Regev encryption, revisited
- How to verify that a small device is quantum, unconditionally
- A note on the minimality of one-way functions in post-quantum cryptography
This page was built for publication: A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056420)
