Related papers: Improvements on "Secure multi-party quantum summat…
In this paper, a novel multi-party quantum private comparison (MQPC) protocol with a semi-honest third party (TP) is proposed based on the entanglement swapping of d-level cat states and d-level Bell states. Here, TP is allowed to misbehave…
We introduce a new primitive for quantum communication that we term "state targeting" wherein the goal is to pass a test for a target state even though the system upon which the test is performed is submitted prior to learning the target…
We propose a quantum secret sharing scheme between $m$-party and $n$-party using three conjugate bases, i.e. six states. A sequence of single photons, each of which is prepared in one of the six states, is used directly to encode classical…
Secure multi-party computation (SMPC) protocols allow several parties that distrust each other to collectively compute a function on their inputs. In this paper, we introduce a protocol that lifts classical SMPC to quantum SMPC in a…
An efficient paradigm for multi-party computation (MPC) are protocols structured around access to shared pre-processed computational resources. In this model, certain forms of correlated randomness are distributed to the participants prior…
Two-party secure quantum remote sensing (SQRS) protocols enable quantum-enhanced measurements at remote locations with guaranteed security against eavesdroppers. This idea can be scaled up to networks of nodes where one party can directly…
In addition to secret splitting, secret reconstruction is another important component of secret sharing. In this paper, the first quantum secret reconstruction protocol based on cluster states is proposed. Before the protocol, a classical…
Secure two-party cryptography is possible if the adversary's quantum storage device suffers imperfections. For example, security can be achieved if the adversary can store strictly less then half of the qubits transmitted during the…
Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that…
Quantum Conference Key Agreement (QCKA) protocols are designed to allow multiple parties to agree on a shared secret key, secure against computationally unbounded adversaries. In this paper, we consider a high-dimensional QCKA protocol and…
Recently there were many quantum protocols devoted to solve the millionaire problem and private comparison problem by adding a semi-honest third party. They all require complicated quantum methods, while still leak a non-trivial amount of…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
The purpose of quantum private comparison (QPC) is to solve "Tierce problem" using quantum mechanics laws, where the "Tierce problem" is to judge whether the secret data of two participants are equal under the condition of protecting data…
Quantum secret sharing is one of the most important and interesting quantum information processing task. In quantum secret sharing, information is split among several parties such that only one of them is able to recover the qubit exactly…
Secure two-party computation considers the problem of two parties computing a joint function of their private inputs without revealing anything beyond the output. In this work, we consider the setting where the two parties (a classical…
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks through it's ability to preserve privacy and integrity of the highly valuable computations they would enable.…
The security of quantum exam [Phys. Lett. A 350 (2006) 174] is analyzed and it is found that this protocol is secure for any eavesdropper except for the "students" who take part in the exam. Specifically, any student can steal other…
In this paper, we investigate properties of some multi-particle entangled states and, from the properties applying the secret sharing present a new type of quantum key distribution protocols as generalization of quantum key distribution…
A protocol by Ishai et al.\ (FOCS 2006) showing how to implement distributed $n$-party summation from secure shuffling has regained relevance in the context of the recently proposed \emph{shuffle model} of differential privacy, as it allows…
Multipartite entangled states are a fundamental resource for a wide range of quantum information processing tasks. In particular, in quantum networks it is essential for the parties involved to be able to verify if entanglement is present…