Quantum Signature Scheme Based on Secret Sharing

International Journal of Theoretical Physics - In quantum wavelet transform, the pixel values of an image may appear signed decimal instead of integer. Consequently, a generalized representation to...     

Authenticable Quantum Scheme for Secret Sharing Based on Local Distinguishability

The main defects of the existing quantum secret sharing schemes are as follows: (1) The identity of the secret sender cannot be confirmed. Receivers of shared secret information may be vulnerable to Trojan attacks; (2) If a malicious attacker Eve impersonates the identity of the receiver, she can finally obtain all the information of the secret that Alice shared; (3) In the process of secret recovery, it is necessary to transmit qubits among all participants involved in secret recovery. Sometimes, the same particle needs to be operated on by all participants to achieve secret sharing, which increases the possibility of eavesdropping and also increases the probability of errors. In this work, we proposed a quantum secret sharing scheme with authentication, the receiver performs corresponding operations on qubits of Greenberger-Horne-Zeilinger(GHZ) state based on the key string calculated by the shared identity number and random Error Correction Code(ECC), the secret sender can calculate the corresponding measurement basis(MB) through the information she has, and then inform the measurement party. This process realizes the mutual authentication between the sender and the receiver. It can protect against identity impersonation attacks, through the ECC verification, it also can resist intercept-resend attacks.

     

Quantum Ramp Secret Sharing Scheme and Quantum Operations

In order to improve the efficiency of quantum secret sharing, quantum ramp secret sharing schemes were proposed (Ogawa et al., Phys. Rev. A 72, 032318 [2005]), which had a trade-off between security and coding efficiency. In quantum ramp secret sharing, partial information about the secret is allowed to leak to a set of participants, called an intermediate set, which cannot fully reconstruct the secret. This paper revisits the size of a share in the quantum ramp secret scheme based on a relation between the quantum operations and the coherent information. We also propose an optimal quantum ramp secret sharing scheme.     

Multi-party d-Level Quantum Secret Sharing Scheme

We develop a multiparty quantum secret sharing (QSS) scheme of classical messages based on arbitrary dimensional multi-particle Greenberger-Horne-Zeilinger (GHZ) states. This scheme can be implemented using only local operations, e.g. generalized Z gate and Hadamard gate, and classical communication (LOCC) between participants. The security of the present scheme against exterior eavesdropping and interior dishonest party has been analyzed and confirmed. Moreover, we discuss the possibility of successful sharing of classical messages in the realistic situation where our QSS scheme is carried out in generalized Pauli channels.     

Quantum Secret Sharing Based on Quantum Search Algorithm

Quantum secret sharing (QSS) and quantum search algorithm (QSA) are considered as two important but different research topics in quantum information science. This paper recognizes an important feature in the well-known Grover’s QSA and then applies it to propose a QSS protocol. In contrast to the existing QSA-based QSS protocols, the newly proposed protocol has the following two advantages: (1)?no quantum memory is required by the agents, whereas the agents in the existing QSA-based QSS protocols need long-term quantum memories to store their secret shadows; (2)?the agents can cooperate to recover the boss’s secret by using shadows in classical bits, whereas, the others have to combine their shadows in photons and perform a unitary operation on the retained photons. The proposed QSS protocol is also shown to be secure against eavesdroppers or malicious agents.     

Eavesdropping on Multiparty Quantum Secret Sharing Scheme Based on the Phase Shift Operations

In a recent paper (Du and Bao in Opt. Commun. 308:159, 2013), a scheme of multiparty quantum secret sharing based on the phase shift operations was presented. We study the security of this scheme and find that it is not secure for dishonest participants, who can illegally elicit all of the dealer’s secret message without any error.     

Secret Sharing Based Multiparty Quantum Computation for Multiplication

International Journal of Theoretical Physics - In secure multiparty quantum computation (SMQC), the multiplication is one of the fundamental operations that can be used to assemble the complex...     

Verifiable Quantum Secret Sharing Scheme Using d-dimensional GHZ State

International Journal of Theoretical Physics - In this paper we propose two verifiable threshold quantum secret sharing protocols with d-dimensional GHZ state. In the proposed protocol, the dealer...     

基于N个有序纠缠光子对的量子机密共享方案

提出了一种基于N个有序纠缠光子对量子机密共享方案.用纠缠光子作为信息的载体,密钥管理者Alice将纠缠光子对分成两个序列,其中一个序列直接发送给合作者之一Bob,在确保第一个序列发送安全后,再对第二个序列进行编码,发送给另一个合作者Charlie.Bob和Charlie分别对他们所接收到的光子序列进行Bell基联合测量...     

基于N个有序纠缠光子对的量子机密共享方案

提出了一种基于N个有序纠缠光子对量子机密共享方案.用纠缠光子作为信息的载体,密钥管理者Alice将纠缠光子对分成两个序列,其中一个序列直接发送给合作者之一Bob,在确保第一个序列发送安全后,再对第二个序列进行编码,发送给另一个合作者Charlie.Bob和Charlie分别对他们所接收到的光子序列进行Bell基联合测量,从而得到Alice所发布的密钥,完整密钥的获得需要管理者和所有合作者共同实现.本方案采用两体纠缠态,相对三体纠缠态来说,在实验上更容易实现,仅需要线性光学元件和简单的纠缠源.     

Multi-Party Quantum Secret Sharing Based on GHZ State

In this paper, we propose an efficient multi-party quantum secret sharing scheme based on GHZ entangled state. The participants in this scheme are divided into two groups, and share secrets as a group. There is no need to exchange any measurement information between the two groups, reducing the security problems caused by the communication process. Each participant holds one particle from each GHZ state; it can be found that the particles of each GHZ state are related after measuring them, and the eavesdropping detection can detect external attacks based on this characteristic. Furthermore, since the participants within the two groups encode the measured particles, they can recover the same secrets. Security analysis shows that the protocol can resist the intercept-and-resend attack and entanglement measurement attack, and the simulation results show that the probability of an external attacker being detected is proportional to the amount of information he can obtain. Compared with the existing protocols, this proposed protocol is more secure, has less quantum resources and is more practical.     

Scheme for Quantum Dense Coding with Secret Sharing in Cavity QED

Quantum dense coding （QDC） is a process originally proposed to send two classical bits information from a sender to a receiver by sending only one qubit. Our scheme of QDC is proposed following some ideas on secret sharing with entanglement in cavity QED. Based on the theory of secret sharing the QDC process can be more secure.     

Quantum Secret Sharing Based on Chinese Remainder Theorem

A novel quantum secret sharing (QSS) scheme is proposed on the basis of Chinese Remainder Theorem (CRT). In the scheme, the classical messages are mapped to secret sequences according to CRT equations, and distributed to different receivers by different dimensional superdense-coding respectively. CRT's secret sharing function,together with high-dimensional superdense-coding, provide convenience, security, and large capability quantum channel forsecret distribution and recovering. Analysis shows the security of the scheme.     

A Privacy Scheme for Digital Images Based on Quantum Particles

International Journal of Theoretical Physics - Quantum processing inspired every field of science and technology. Quantum digital content privacy schemes usually employs photons to communicate a...     

A Quantum Blind Signature Scheme Based on Block Encryption and Quantum Fourier Transfer

International Journal of Theoretical Physics - Motivated by the block encryption and quantum Fourier transfer, a quantum blind signature scheme is proposed. Alice encodes the original message into...     

Quantum Color Image Encryption Algorithm Based on A Hyper-Chaotic System and Quantum Fourier Transform

To improve the slow processing speed of the classical image encryption algorithms and enhance the security of the private color images, a new quantum color image encryption algorithm based on a hyper-chaotic system is proposed, in which the sequences generated by the Chen’s hyper-chaotic system are scrambled and diffused with three components of the original color image. Sequentially, the quantum Fourier transform is exploited to fulfill the encryption. Numerical simulations show that the presented quantum color image encryption algorithm possesses large key space to resist illegal attacks, sensitive dependence on initial keys, uniform distribution of gray values for the encrypted image and weak correlation between two adjacent pixels in the cipher-image.     

Improved Three-Party Quantum Secret Sharing Based on Bell States

Hwang et al. (Phys. Scr. 83:045004, 2011) proposed a high efficient multiparty quantum secret sharing by using Greenberger-Horne-Zeilinger (GHZ) states. But Liu et al. (Phys. Scr. 84:045015, 2011) analyzed the security of Hwang et al.’s protocol and found that it was insecure for Charlie who might obtain half of information about the dealer’s secret directly. They put forward an improved protocol by adding operation on photons in sequence S ₃. However, we point out Liu et al.’s protocol is not secure too if a dishonest participant Charlie carries out intercept-resend attack. And a further improved quantum secret sharing protocol is proposed based on Bell states in this paper. Our newly proposed protocol can stand against participant attack, provide a higher efficiency in transmission and reduce the complexity of implementation.     

A Novel General (n,n)-Threshold Multiple Secret Images Sharing Scheme Based on Information Hiding in the Sharing Domain

(k,n)-threshold secret image sharing (SIS) protects an image by dividing it into n shadow images. The secret image will be recovered as we gather k or more shadow images. In complex networks, the security, robustness and efficiency of protecting images draws more and more attention. Thus, we realize multiple secret images sharing (MSIS) by information hiding in the sharing domain (IHSD) and propose a novel and general (n,n)-threshold IHSD-MSIS scheme (IHSD-MSISS), which can share and recover two secret images simultaneously. The proposed scheme spends less cost on managing and identifying shadow images, and improves the ability to prevent malicious tampering. Moreover, it is a novel approach to transmit important images with strong associations. The superiority of (n,n)-threshold IHSD-MSISS is in fusing the sharing phases of two secret images by controlling randomness of SIS. We present a general construction model and algorithms of the proposed scheme. Sufficient theoretical analyses, experiments and comparisons show the effectiveness of the proposed scheme.