Semi-quantum secret sharing is an important research issue in quantum cryptography. In this paper, we propose a (t, n) threshold semi-quantum secret sharing protocol, which combines the practicality of semi-quantum secret sharing protocols and the flexibility of (t, n) threshold quantum secret sharing protocols. Participants prepare and transmit single particles in a circular way, and then any t out of n participants can recover the secret according to Shamir’s secret sharing scheme. As quantum resources, single particles are easy to prepare. Furthermore, classical participants only need to possess the capability to prepare and insert particles. The security analysis shows our protocol has security against most attacks. Except decoy particles, all particles are useful to carry the secret message, so the efficiency of the proposed protocol can achieve 100%.
Secure multi-party computational geometry is a branch of secure multi-party computation, which is applied in many important fields. But up to now, the research on how to solve this problem with quantum methods has just started. Therefore, we study the design of quantum secure multi-party computational geometry (QSMCG) protocols in this paper. As the foundation, we extend the two-party summation and multiplication protocols proposed by Sutradhar and Om to multi-party protocols. Then we propose three new QSMCG protocols. Our proposed quantum secure two-party distance computation protocol has improvement in efficiency and accuracy. And the proposed quantum secure multi-party polytope volume computation protocol as well as the quantum secure circle–circle intersection area computation protocol are designed for the first time. Moreover, these protocols are designed to use multi-third parties, which solves the problem of intermediate value leakage in computation. The correctness, security and performance of all these protocols are analyzed.
We propose an efficient quantum private comparison protocol firstly based on one direction quantum walks. With the help of one direction quantum walk, we develop a novel method that allows the semi-honest third party to set a flag to judge the comparing result, which improves the qubit efficiency and the maximum quantity of the participants’ secret messages. Besides, our protocol can judge the size of the secret messages, not only equality. Furthermore, the quantum walks particle is disentangled in the initial state. It only requires a quantum walks operator to move, making our proposed protocol easy to implement and reducing the quantum resources. Through security analysis, we prove that our protocol can withstand well-known attacks and brute-force attacks. Analyses also reveal that our protocol is correct and practical.
Quantum secure multi-party computation (SMC) is a vital field in quantum cryptography. In this paper, we try to resolve SMC problems universally via graph states. Firstly, three kinds of quantum SMC protocols are investigated, which are quantum private comparison protocol, quantum millionaire protocol and quantum multi-party summation protocol. Secondly, three proposed protocols are reviewed, and then the core of them is summarized. We further find that the computation, deduced as modulo subtraction, can be resolved by using graph state. This implies that our protocols are universal in part and will be widely applicable. Thirdly, analyses show that the proposed protocols are correct and secure. Our research will promote the development of quantum secure multi-party computation.
A rational quantum state sharing protocol with the semi-off-line dealer is proposed. Firstly, the dealer Alice shares an arbitrary two-particle entangled state with the players by Einstein–Podolsky–Rosen (EPR) pairs and Greenberger–Horne–Zeilinger (GHZ) states. The EPR pairs are prepared by Charlie instead of the dealer, reducing the workload of the dealer. Secondly, all players have the same probability of reconstructing the quantum state, guaranteeing the fairness of the protocol. In addition, the dealer is semi-off-line, which considerably reduces the information exchanging between the dealer and the players. Finally, our protocol achieves security, fairness, correctness, and strict Nash equilibrium.