International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort

Authors:
Bar Alon , Ariel University
Hao Chung , Carnegie Mellon University
Kai-Min Chung , Academia Sinica
Mi-Ying Huang , Academia Sinica
Yi Lee , Academia Sinica
Yu-Ching Shen , Academia Sinica
Download:
Search ePrint
Search Google
Conference: CRYPTO 2021
Abstract: A recent result by Dulek et al. (EUROCRYPT 2020) showed a secure protocol for computing any quantum circuit even without the presence of an honest majority. Their protocol, however, is susceptible to a ``denial of service'' attack and allows even a single corrupted party to force an abort. We propose the first quantum protocol that admits security-with-identifiable-abort, which allows the honest parties to agree on the identity of a corrupted party in case of an abort. Additionally, our protocol is the first to have the property that the number of rounds where quantum communication is required is independent of the circuit complexity. Furthermore, if there exists a post-quantum secure classical protocol whose round complexity is independent of the circuit complexity, then our protocol has this property as well. Our protocol is secure under the assumption that classical quantum-resistant fully homomorphic encryption schemes with decryption circuit of logarithmic depth exist. Interestingly, our construction also admits a reduction from quantum fair secure computation to classical fair secure computation.
Video from CRYPTO 2021
BibTeX
@inproceedings{crypto-2021-31189,
  title={Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort},
  publisher={Springer-Verlag},
  author={Bar Alon and Hao Chung and Kai-Min Chung and Mi-Ying Huang and Yi Lee and Yu-Ching Shen},
  year=2021
}