Single-round proofs of quantumness from knowledge assumptions
From MaRDI portal
Cites work
- A cryptographic test of quantumness and certifiable randomness from a single quantum device
- Advances in Cryptology - CRYPTO 2003
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Classical verification of quantum computations in linear time
- Composition with knowledge assumptions
- Computationally-secure and composable remote state preparation
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- Minimum disclosure proofs of knowledge
- Non-interactive classical verification of quantum computation
- On CCA-Secure Somewhat Homomorphic Encryption
- On the complexity of interactive proofs with bounded communication
- On the existence of extractable one-way functions
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Public-Key Cryptosystems Resilient to Key Leakage
- Quantum advantage from any non-local game
- Random oracles in a quantum world
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Succinct non-interactive arguments via linear interactive proofs
- The computational complexity of linear optics
- The Knowledge Complexity of Interactive Proof Systems
- Towards a Theory of Extractable Functions
- Verifiable quantum advantage without structure
- Weakly extractable one-way functions
This page was built for publication: Single-round proofs of quantumness from knowledge assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296637)
