Best-of-both-worlds multiparty quantum computation with publicly verifiable identifiable abort

DOI10.1007/978-3-031-58751-1_5MaRDI QIDQ6637565zbMATH OpenFDO

Authors Kai-Min Chung, Mi-Ying Huang, Er-Cheng Tang, Jiapeng Zhang

Publication date 13 November 2024

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 5485432 (Why is no real title available?)
• scientific article; zbMATH DE number 1559533 (Why is no real title available?)
• Actively secure two-party evaluation of any quantum operation
• Commitments to quantum states
• Constant-round blind classical verification of quantum sampling
• 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
• Secure multi-party computation with identifiable abort
• Secure multi-party quantum computation
• Secure multi-party quantum computation with a dishonest majority
• Unconditionally Secure Key Distribution in Higher Dimensions by Depolarization
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Valence bond solid formalism ford-level one-way quantum computation
• \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds

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)