Secure Multi-party Quantum Computation with a Dishonest Majority
- 1 May 2020
- book chapter
- Published by Springer Nature
- p. 729-758
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- SPD$\mathbb {Z}_{2^k}$: Efficient MPC mod $2^k$ for Dishonest Majority2018
- Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives2017
- Efficient Simulation for Quantum Message Authentication2016
- Secure Multiparty Computation and Secret Sharing2015
- Actively Secure Two-Party Evaluation of Any Quantum Operation2012
- Semi-homomorphic Encryption and Multiparty Computation2011
- Secure Two-Party Quantum Evaluation of Unitaries against Specious AdversariesLecture Notes in Computer Science, 2010
- Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority2006
- Universal quantum computation with ideal Clifford gates and noisy ancillasPhysical Review A, 2005
- Secure multi-party quantum computation2002