Related papers: Secure Multi-Party Computation with a Dishonest Ma…
We describe scalable protocols for solving the secure multi-party computation (MPC) problem among a large number of parties. We consider both the synchronous and the asynchronous communication models. In the synchronous setting, our…
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its…
In this work, we present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the…
Multiparty quantum communication provides delightful applications including quantum cryptographic communication and quantum secret sharing. Measurement-Device-Independent (MDI) quantum communication based on the Greenberg-Horne-Zeilinger…
We present a three-party simultaneous quantum secure direct communication (QSDC) scheme by using Greenberger-Horne-Zeilinger (GHZ) states. This scheme can be directly generalized to $N$-party QSDC by using $n$-particle GHZ states. We show…
An authentic digital signature scheme based on the correlation of Greenberger-Horne-Zeilinger (GHZ) states was presented. In this scheme, by performing a local unitary operation on the third particles of each GHZ triplet, Alice can encode…
A quantum protocol for sharing an arbitrary two-qubit state between N parties is introduced. Any of the members, can retrieve the state, only with collaboration of the other parties. We will show that in terms of resources, i.e. the number…
In modern distributed computing applications, such as federated learning and AIoT systems, protecting privacy is crucial to prevent adversarial parties from colluding to steal others' private information. However, guaranteeing the utility…
We propose a new three-party quantum private comparison protocol using genuinely maximally entangled six-qubit states. In our protocol, three participants can determine whether their private information are equal or not without an external…
We present an experimental demonstration of a modified version of the entanglement-assisted "Guess my Number" protocol for the reduction of communication complexity among three separated parties. The results of experimental measurements…
A circular quantum secret sharing protocol is proposed, which is useful and efficient when one of the parties of secret sharing is remote to the others who are in adjacent, especially the parties are more than three. We describe the process…
We introduce a new protocol for secure two-party computation of linear functions in the semi-honest model, based on coding techniques. We first establish a parallel between the second version of the wire-tap channel model and secure…
The recognition of entanglement states is a notoriously difficult problem when no prior information is available. Here, we propose an efficient quantum adversarial bipartite entanglement detection scheme to address this issue. Our proposal…
In this work, we consider the problem of secure multi-party computation (MPC), consisting of $\Gamma$ sources, each has access to a large private matrix, $N$ processing nodes or workers, and one data collector or master. The master is…
We introduce relativistic multi-party biased die rolling protocols, generalizing coin flipping to $M \geq 2$ parties and to $N \geq 2$ outcomes for any chosen outcome biases, and show them unconditionally secure. Our results prove that the…
Sharing genuine multipartite entanglement by considering collective use of copies of biseparable states, which are entangled across all bipartitions but lack genuine multipartite entanglement at the single-copy level, plays a central role…
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single $d-$ level state…
We consider the discrimination of two-party quantum states and provide a quantum data-hiding scheme using two-qubit separable states. We first provide a bound on the optimal local discrimination of two-party quantum states, and establish a…
In a conventional quantum (k,n) threshold scheme, a trusted party shares a secret quantum state with n participants such that any k of those participants can cooperate to recover the original secret, while fewer than k participants obtain…
In a recent paper [S. Bagherinezhad and V. Karimipour, Phys. Rev. A 67, 044302 (2003)], a quantum secret sharing protocol based on reusable GHZ states was proposed. However, in this comment, it is shown that this protocol is insecure…