On the round complexity of secure quantum computation
From MaRDI portal
Publication:2120084
DOI10.1007/978-3-030-84242-0_15OpenAlexW3197427549MaRDI QIDQ2120084
Fermi Ma, Andrea Coladangelo, James Bartusek, Dakshita Khurana
Publication date: 31 March 2022
Full work available at URL: https://arxiv.org/abs/2011.11212
Related Items
Certified everlasting zero-knowledge proof for QMA ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ On concurrent multi-party quantum computation ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Secure quantum computation with classical communication ⋮ Rate-1 quantum fully homomorphic encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum FHE (almost) as secure as classical
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
- Two-round multiparty secure computation from minimal assumptions
- A new approach to round-optimal secure multiparty computation
- Four round secure computation without setup
- Round-optimal secure two-party computation from trapdoor permutations
- Promise zero knowledge and its applications to round optimal MPC
- Secure multi-party quantum computation with a dishonest majority
- Post-quantum multi-party computation
- Secure software leasing
- Round optimal secure multiparty computation from minimal assumptions
- Reusable non-interactive secure computation
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Efficient Non-interactive Secure Computation
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Secure multi-party quantum computation
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- A Framework for Efficient and Composable Oblivious Transfer
- Instantaneous measurements of nonlocal variables
- Bounds on Instantaneous Nonlocal Quantum Computation
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- The Exact Round Complexity of Secure Computation
