Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
From MaRDI portal
Publication:6637565
DOI10.1007/978-3-031-58751-1_5MaRDI QIDQ6637565FDOQ6637565
Authors: Kai-Min Chung, Mi-Ying Huang, Er-Cheng Tang, Jiapeng Zhang 
Publication date: 13 November 2024
Cryptography (94A60) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Universal quantum computation with ideal Clifford gates and noisy ancillas
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure multi-party quantum computation
- Actively secure two-party evaluation of any quantum operation
- Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Secure multi-party quantum computation with a dishonest majority
- Secure multi-party computation with identifiable abort
- Efficient constant-round MPC with identifiable abort and public verifiability
- On achieving the ``best of both worlds in secure multiparty computation
- On the round complexity of secure quantum computation
- Round efficient secure multiparty quantum computation with identifiable abort
- Constant-round blind classical verification of quantum sampling
- Valence bond solid formalism ford-level one-way quantum computation
- Commitments to quantum states
This page was built for publication: Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637565)
