Secure quantum computation with classical communication
From MaRDI portal
Recommendations
- On the round complexity of secure quantum computation
- Secure multi-party quantum computation with a dishonest majority
- Composable security of delegated quantum computation
- Non-interactive classical verification of quantum computation
- Multi-server blind quantum computation protocol with limited classical communication among servers
Cites work
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- Actively secure two-party evaluation of any quantum operation
- Classical verification of quantum computations with efficient verifier
- Composable security of delegated quantum computation
- Constant-round blind classical verification of quantum sampling
- Efficient non-interactive secure computation
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Multiparty reusable non-interactive secure computation from LWE
- Non-interactive classical verification of quantum computation
- Non-interactive secure computation based on cut-and-choose
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Oblivious transfer is in MiniQCrypt
- On the round complexity of secure quantum computation
- One-way functions imply secure computation in a quantum world
- Post-quantum multi-party computation
- Quantum FHE (almost) as secure as classical
- Reusable non-interactive secure computation
- Revisiting post-quantum Fiat-Shamir
- Round efficient secure multiparty quantum computation with identifiable abort
- Secure multi-party quantum computation
- Secure multi-party quantum computation with a dishonest majority
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Succinct non-interactive secure computation
- Two round multiparty computation via multi-key FHE
- Two-message statistically sender-private OT from LWE
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions
- UC-secure OT from LWE, revisited
- Unbounded multi-party computation from learning with errors
- Universally composable quantum multi-party computation
Cited in
(21)- Quantum security computation on shared secrets
- Secure multi-party quantum computation with a dishonest majority
- Multi-server blind quantum computation protocol with limited classical communication among servers
- Non-interactive classical verification of quantum computation
- Round efficient secure multiparty quantum computation with identifiable abort
- Constant-round blind classical verification of quantum sampling
- Delegating quantum computation in the quantum random oracle model
- Qfactory: classically-instructed remote secret qubits preparation
- Secure two-party computation based on blind quantum computation
- Verifier-on-a-leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
- A generic quantum protocol for one-sided secure two-party classical computations
- Security limitations of classical-client delegated quantum computing
- Composable security of delegated quantum computation
- Universally composable quantum multi-party computation
- A simple protocol for verifiable delegation of quantum computation in one round
- On the impossibility of key agreements from quantum random oracles
- Black-box separations for non-interactive classical commitments in a quantum world
- On concurrent multi-party quantum computation
- Obfuscation of pseudo-deterministic quantum circuits
- On the power of oblivious state preparation
- MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
This page was built for publication: Secure quantum computation with classical communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695622)
