Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort
Authors:
- 11 August 2021
- book chapter
- Published by Springer Nature
- p. 436-466
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Secure Multi-Party Computation with Identifiable Abort2014
- Quantum One-Time Programs2013
- Actively Secure Two-Party Evaluation of Any Quantum Operation2012
- Multiparty Computation from Somewhat Homomorphic Encryption2012
- Universally Composable Quantum Multi-party Computation2010
- Universal quantum computation with ideal Clifford gates and noisy ancillasPhysical Review A, 2005
- Quantum data hidingIEEE Transactions on Information Theory, 2002
- Secure multi-party quantum computation2002
- Verifiable secret sharing and multiparty protocols with honest majority1989
- How to play ANY mental game1987