# Secure multiparty quantum computation based on bit commitment

@article{Liang2013SecureMQ, title={Secure multiparty quantum computation based on bit commitment}, author={Min Liang}, journal={arXiv: Quantum Physics}, year={2013} }

This paper studies secure multiparty quantum computation (SMQC) without nonlocal measurements. Firstly, this task is reduced to secure two-party quantum computation of nonlocal controlled-NOT (NL-CNOT) gate. Then, in the passive adversaries model, the secure computation of NL-CNOT is reduced to bit commitment. Thus, a SMQC scheme can be constructed based on bit commitment. This scheme does not depend on trusted third party, and is secure in the passive adversaries model. It is also pointed out…

## 2 Citations

Security Analysis of Quantum Obfuscation

- Computer Science, Mathematics
- 2020

To analyze the obfuscatability of quantum point functions, the strict definition of a quantum point function is introduced and its variants of multiple points and multiple qubits are discussed.

draft-irtf-qirg-principles-02-Architectural Principles for a Quantum Internet

- Computer Science
- 2019

This memo attempts lay down the framework and introduce some basic architectural principles for a quantum internet, intended for general guidance and general interest, but also to provide a foundation for discussion between physicists and network specialists.

## References

SHOWING 1-10 OF 17 REFERENCES

Secure multi-party quantum computation

- Computer Science, MathematicsSTOC '02
- 2002

This work uses a new tool to show how to perform any multi-party quantum computation as long as the number of dishonest players is less than n/6 and gives a protocol which tolerates any t ξ n/4 cheating parties (out of n).

Universally Composable Quantum Multi-party Computation

- Computer Science, MathematicsEUROCRYPT
- 2010

It is proved that in this model statistically secure oblivious transfer protocols can be constructed from commitments, and it is shown that every statistically classically UC secure protocol is also statistically quantum UC secure.

Unconditionally secure quantum bit commitment is impossible

- Computer Science, Mathematics
- 1997

It is shown that the claim that quantum cryptography can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space, or technology available to the cheaters, does not hold for any quantum bit commitment protocol.

Insecurity of Quantum Secure Computations

- Computer Science, MathematicsArXiv
- 1996

This work shows that all one-sided two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure, and constructs a class of functions that cannot be computed securely in any two-sidedTwo-party computation.

Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority

- Computer Science2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
- 2006

This paper presents a verifiable quantum secret sharing protocol (VQSS), and a general secure multiparty quantum computation (MPQC) protocol, which can tolerate any cheaters among n players.

Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

- MathematicsCRYPTO
- 2010

We describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of…

Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes

- Computer SciencePhysical review letters
- 2012

A new unconditionally secure bit commitment scheme based on Minkowski causality and the properties of quantum information is proposed based on Bennett-Brassard 1984 qubits and the impossibility of superluminal signalling.

Symmetric quantum fully homomorphic encryption with perfect security

- Computer Science, MathematicsQuantum Inf. Process.
- 2013

The definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphicryption (QFHE) are presented, and a symmetric QFHE scheme is constructed, where the evaluate algorithm depends on the secret key.

Is Quantum Bit Commitment Really Possible?

- Computer ScienceArXiv
- 1996

At the heart of such optimism has been the widespread belief that unconditionally secure quantum bit commitment (QBC) schemes exist, which is put into very serious doubt by showing.

Reexamination of quantum bit commitment: The possible and the impossible

- Computer Science, Mathematics
- 2007

It is shown that any concealing protocol allows the sender to find a cheating strategy, which is universal in the sense that it works against any strategy of the receiver, and provides a natural characterization of protocols that fall outside the standard setting of unlimitedmore » available technology and thus may allow secure bit commitment.