Most of Quantum Secret Sharing(QSS) are (n, n) threshold 2-level schemes, in which the 2-level secret cannot be reconstructed until all n shares are collected. In this paper, we propose a (t, n) threshold d-level QSS scheme, in which the d-level secret can be reconstructed only if at least t shares are collected. Compared with (n, n) threshold 2-level QSS, the proposed QSS provides better universality, flexibility, and practicability. Moreover, in this scheme, any one of the participants does not know the other participants’ shares, even the trusted reconstructor Bob1 is no exception. The transformation of the particles includes some simple operations such as d-level CNOT, Quantum Fourier Transform(QFT), Inverse Quantum Fourier Transform(IQFT), and generalized Pauli operator. The transformed particles need not to be transmitted from one participant to another in the quantum channel. Security analysis shows that the proposed scheme can resist intercept-resend attack, entangle-measure attack, collusion attack, and forgery attack. Performance comparison shows that it has lower computation and communication costs than other similar schemes when 2 < t < n − 1.
In order to reduce resource consumption and improve transmission efficiency, in this paper, using single-particle states, a multi-party quantum privacy comparison size relationship (QPCSR) protocol is proposed. Without leaking the compared private message, the blinded secret integer is encoded into the relative phase of single-particle by performing unitary operation. After each of the transformed quantum states has been measured, respectively, the comparison result of n participants’ secret integers is obtained. Security analysis shows that this protocol not only resists outside attack and participant attack, but also resists the semi-honest third-party (TP) attack. Compared with the other similar quantum privacy comparison equal relationship (QPCER) protocols, the proposed protocol has better flexibility and universality; compared with the other similar QPCSR protocols, it has lower resource consumption and higher communication efficiency.
To detect frauds by a dealer or some participants, researchers have proposed verifiable threshold quantum state sharing (VTQSTS) schemes. However, the existing VTQSTS schemes either have lowcomputation efficiency or weak security. In this paper, a verifiable (t, n) threshold quantum state sharing against denial attack (VTQSTS-ADA) scheme is proposed to overcome the above limitations, in which the dealer Alice encodes the quantum secret sequence into two quantum message sequences and a quantum signature sequence. First, for each participant in the authorization subset, the received quantum signature sequence is validated by a quantum verification algorithm, and then a unitary transformation with a rotation key is performed on the received quantum message sequence; next, a new quantum signature sequence is generated by a quantum signature algorithm with the signature key. Each participant sends the new message sequences and signature sequence to the next participant. The original quantum secret sequence can be reconstructed when t(t ≤ n) participants collaborate. The security analysis shows that the proposed VTQSTS-ADA scheme can detect the fraud instances raised by the dealer and participants and provide stronger security such as resisting denial attacks and man-in-middle attacks compared with the existing schemes. The performance analysis shows that the proposed VTQSTS-ADA scheme outperforms the earlier VTQSTS scheme and is comparable to the recent scheme.
As an important subtopic of classical cryptography, secure multiparty quantum computation allows multiple parties to jointly compute their private inputs without revealing them. Most existing secure multiparty computation protocols have the shortcomings of low computational efficiency and high resource consumption. To remedy these shortcomings, we propose a secure multiparty quantum computation protocol by using the Lagrange unitary operator and the Shamir (t, n) threshold secret sharing, in which the server generates all secret shares and distributes each secret share to the corresponding participant, in addition, he prepares a particle and sends it to the first participant. The first participant performs the Lagrange unitary operation on the received particle, and then sends the transformed particle to the next participant. Until the last participant’s computation task is completed, the transformed particle is sent back to the server. The server performs Lagrange unitary operation on the received particle by using a secret message, and then measures the transformed particle to obtain the sum of the calculations of multiple participants. Security analysis shows that the proposed protocol can resist intercept-measurement attack, intercept-resend attack, entanglement-swapping attack, entanglement-measurement attack and collusion attack. Performance comparison shows that it has higher computation efficiency and lower resource consumption than other similar protocols.