Compiled nonlocal games from any trapdoor claw-free function

DOI10.1007/978-3-032-01878-6_21MaRDI QIDQ6863947zbMATH OpenFDO

Authors Kaniuar Bacho, Alexander Kulpe, Giulio Malavolta, Simon Schmidt, Michael Walter

Publication date 4 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01878-6_21

zbMATH Keywords

nonlocal gamessingle-prover protocolstrapdoor claw-free function

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• A cryptographic test of quantumness and certifiable randomness from a single quantum device
• A simple protocol for verifiable delegation of quantum computation in one round
• Bounding the quantum value of compiled nonlocal games: from CHSH to BQP verification
• Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
• Classical homomorphic encryption for quantum circuits
• Classical verification of quantum computations
• Computationally-secure and composable remote state preparation
• Hidden cosets and applications to unclonable cryptography
• How to construct quantum FHE, generically
• MIP* = RE
• Proposed experiment to test local hidden-variable theories
• Quantum advantage from any non-local game
• Quantum FHE (almost) as secure as classical
• Simple tests of quantumness also certify qubits
• Succinct classical verification of quantum computation
• Universal Blind Quantum Computation
• Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources

Cited in

(1)

• A modular approach to succinct arguments for QMA

This page was built for publication: Compiled nonlocal games from any trapdoor claw-free function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863947)