• Corpus ID: 117960623

Secure multiparty quantum computation based on bit commitment

  title={Secure multiparty quantum computation based on bit commitment},
  author={Min Liang},
  journal={arXiv: Quantum Physics},
  • Min Liang
  • Published 3 June 2013
  • Computer Science, Mathematics
  • arXiv: Quantum Physics
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… 

Figures from this paper

Security Analysis of Quantum Obfuscation

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

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.



Secure multi-party quantum computation

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).

Unconditionally secure quantum bit commitment is impossible

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

  • H. Lo
  • Computer Science, Mathematics
  • 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 Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

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

  • A. Kent
  • Computer Science
    Physical 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

  • Min Liang
  • Computer Science, Mathematics
    Quantum 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?

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

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.

The Impossibility Of Secure Two-Party Classical Computation

We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols.

Complete insecurity of quantum protocols for classical two-party computation Buhrman,

This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate.