Quantum security computation on shared secrets

Quantum security computation on shared secrets

Hai-Yan Bai Hai-Yan Bai, Zhi-Hui Lifi,Na Hao School of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710119, China
22email: lizhihui@snnu.edu.cn
   Zhi-Hui Li Hai-Yan Bai, Zhi-Hui Lifi,Na Hao School of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710119, China
22email: lizhihui@snnu.edu.cn
   Na Hao Hai-Yan Bai, Zhi-Hui Lifi,Na Hao School of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710119, China
22email: lizhihui@snnu.edu.cn
Received: date / Accepted: date
Abstract

Ouyang et al. proposed an threshold quantum secret sharing scheme, where the number of participants is limited to , and the security evaluation of the scheme was carried out accordingly. In this paper, we propose an threshold quantum secret sharing scheme for the number of participants in any case ( ). The scheme is based on a quantum circuit, which consists of Clifford group gates and Toffoli gate. We study the properties of the quantum circuit in this paper and use the quantum circuit to analyze the security of the scheme for dishonest participants.

Keywords:
Secret sharing scheme Quantum circuit Quantum computation Unitary matrix

1 Introduction

Quantum computing is a new type of computing mode that regulates quantum information and follows the laws of quantum mechanics. That is, it enables quantum bits to achieve the purpose of programming in different quantum logic gates sequentially, and all kinds of quantum algorithms can be realized by combining different quantum logic gates. From the perspective of computational efficiency, because of the existence of quantum mechanical superposition, some quantum algorithms are faster than the conventional general computer when solving problems.

In the field of quantum cryptography, aside from the quantum key distribution[1,2], the quantum computation of security computing has attracted the attention of people, such as secure multiparty computation [3], blind computation [4-7] and verifiable delegated computation [8-12]. The earliest quantum algorithm is proposed by Jozsa and Deutsch. This quantum algorithm shows the computing power that classical computers do not have [13]. Ouyang et al. give a different way of security computing quantum algorithm [14], and the security evaluation of quantum secret sharing circuit.

In 1999, Hillery [15] and others proposed a quantum secret sharing scheme firstly. The emergence of this concept provides an effective way for the security of quantum state secrets. After that, the quantum secret sharing scheme has received rapid attention and development [16-22]. The so-called -threshold quantum secret sharing scheme will mean the quantum state secret distributed to participants such that no group fewer than participants can reconstruct the secret quantum state [23-25], and any participants can reconstruct the secret quantum state.

In the quantum circuits, the implementation of the unitary transformation of the quantum state is equivalent to the role of the logic gate in the quantum state. In any dimension Hilbert space, if the unitary transformation of the corresponding quantum state can be realized through the combination of elements in a logic gate group, we call such a logic gate group a universal logic gate group (universal gate), hereinafter referred to as universal gate. It has been proved that Toffoli gates can realize all unitary transformation [26] in any dimension Hilbert space, but it is a 3 qubits quantum gate, which is difficult from the perspective of physical realization. However, in any case, the universal gates of quantum computing, like the classical logic gate group, have different forms of expression, as the Ref.[27] points out that any of the gate, the controlled phase gate and the Toffoli gate and Clifford group gates can form a group of universal gate. In this regard, Ouyang et al. considers the universal gate composed of discrete Clifford group gates and gate [14].

In this paper, we consider the situation that Clifford group gates and Toffoli gate constitute a universal gate, and propose an threshold quantum secret sharing scheme for any positive integer . Then we use the quantum circuit composed of discrete Clifford group gates and Toffoli gate to evaluate the security.

2 Quantum circuit and its related conclusions

In this section,we introduce a quantum circuit (See Fig.1, Fig.2) with a proof of security and give corresponding conclusions of the quantum circuit.

In Fig.1, the first qubits of the first column qubits are the quantum state secrets to be shared, and the later qubits are the ancilla to help implement the Toffoli gate. The notation labels the qubit on the -th row and the -th column, and labels the qubits in the -th row, where

Figure 1: Secret sharing process corresponding to participants

In Fig.2, represents the unitary matrix on the -th row of qubits in Fig.1. When represents the corresponding unitary matrix of the column, and we order . represents the corresponding unitary matrix of the column, and we order , then .

Figure 2: Schematic diagram of the corresponding circuit of participants

According the quantum circuit given in Fig.1 and Fig.2, we give the following two properties.

Property 1 when is an odd number,

where

Prove For we give a proof of (1) respectively. That is, we prove the following equations are set up

Firstly, by , it is easy to know that the above Eq.(2) is clearly established when . Next, the cases of are proved by mathematical induction.

When , we prove Eq.(3) to be established. First,the following Eq.(6) is established.

where  

It is easy to know that when Eq.(3) is held, so we assumed that Eq.(3) is established when , next certificate that Eq.(3) is also established when . According hypothesis and Eq.(6) we know that

When

where

then

It is known that the Eq.(3) holds according the inductive hypothesis.

When , we prove Eq.(4) to be established. Firstly, we suppose , and it is clear from that it is also true. The same reason has the next form

It is easy to know that when Eq.(4) is held, so we assumed that Eq.(4) is established when , next certificate that Eq.(4) is also established when . According hypothesis and Eq.(7) wo know that

When

It is known that the Eq.(4) holds according the inductive hypothesis.

When we prove Eq.(5) to be established. The same reason has the next form

It is easy to know that when Eq.(5) is held, so assumed that Eq.(5) is established when , next certificate that Eq.(5) is also established when . According hypothesis and Eq.(8) we know that

When

It is known that the Eq.(5) holds according the inductive hypothesis.
To sum up: the Property 1 has to be proved.

Property 2  when is an even number,

Prove For we give a proof of (9) respectively. That is, we prove the following equations are set up

Firstly, by , it is easy to know that the above Eq.(10) is clearly established when . Next, the cases of are proved by mathematical induction.

When , it is easy to know that when Eq.(11) is held, so we assumed that Eq.(11) is established when , next certificate that Eq.(11) is also established when . According hypothesis and Eq.(6) we know that

when

where

then

It is known that the Eq.(11) holds according the inductive hypothesis.

When , it is easy to know that when Eq.(12) is held, so we assumed that Eq.(12) is established when , next certificate that Eq.(12) is also established when . According hypothesis and Eq.(7) we know that

when

then

It is known that the Eq.(12) holds according the inductive hypothesis.

When , it is easy to know that when Eq.(12) is held, so we assumed that Eq.(13) is established when , next certificate that Eq.(13) is also established when . According hypothesis and Eq.(8) we know that

when

then

It is known that the Eq.(13) holds according the inductive hypothesis.
To sum up, the Property 2 is proved.

3 Secret sharing scheme

In the Ref.[14], an threshold quantum secret sharing scheme is proposed, in which the number of participants is limited to , and the scheme use quantum circuits to evaluate security after the participants get their own quantum states. In this section, we discuss the number of participants in any case ( ). The specific scheme is as follows:

Input procedure

The first bits in the first column are initialized as a quantum secret, and the later bits are auxiliary state: let The rest of the column is initialized to the maximum mixed state , where are common Pauli operator, and is a Toffoli gate.

Encoding procedure

When , acts on -th qubit , so act on bit quantum state and encodes the quantum state secret into a highly mixed state.

Sharing procedure

Prepared encrypted column mixed quantum state, Alice holding first column quantum state, -th column quantum state send to the participant, where

Decoding procedure

(a) Collecting the shared state of participants;

(b) The unitary matrix acts on the mixed quantum state shared by the column, discards the rest of the columns, and the remaining first column bits are quantum state secrets.

4 Scheme analysis

In order to analyze quantum circuits acting on shared secrets, each participant performs quantum computation on his own share only, and its computation is carried out between sharing and decryption procedure. In Ref. [27], it is shown that any gate in and Clifford group gates can form a set of universal gate. In this paper, we consider a set of discrete gate sets consisting of Clifford group gates and Toffoli gate. where Quantum circuit consists of any multiple Clifford gates and a constant Toffoli gates. Now we consider a sequence gate that acts on the bit quantum state secret, where gates are all unitary and are known to the participants.

When is a Clifford gate, each participant implements on a list of its own qubit subsets, so party participants jointly implement . When is a single-qubit Clifford gates, as shown in Fig.3, when is a double-qubit CNOT gate, as shown in Fig.4.

Figure 3: Schematic diagram of Clifford gate action
Figure 4: Schematic diagram of CONT gate action

When is a Toffoli gate, each participant can perform a constant Toffoli gates on its own quantum secret. To implement the -th Toffoli gate at the bit qubit, each participant operates like Fig.5, where

Figure 5: Toffoli gate diagram

Here the frame represents the measuring device, when the result is classic bit 1, the operation in the above box is implemented, and the Toffoli gate is finally realized. Here is the quantum state of the bit, is an auxiliary particle. From Fig.5, it can be seen that each implementation of a Toffoli gate consumes an auxiliary particle

In order to better understand the above scheme and analyze the implementation of quantum gates on the shared quantum secret, we give two examples of

Example Suppose that the shared quantum state secret is After the action of the unitary matrix in the scheme, the final state is as follows

is the result state of the auxiliary particle after the action of the unitary matrix . Assuming that the first three participants (excluding Alice) are dishonest, and the fourth participant are honest, they trace the quantum state held by fourth participant, namely, find the reduced density matrix corresponding to the four dimensional subsystems including Alice

is the first four column entangled states of , and is the fifth column quantum state of . The rest of the three participants and the Alice did not get any information about the quantum secret. We consider a sequence gates on the bits quantum state secret, where are Clifford gates, and are Toffoli gates, frame and in the diagram as in Fig.5; Each unitary gate is known to the participants. The operations performed by each participant are shown in Fig.6.

Figure 6: Quantum diagram of a sequence gates

Example Suppose that the shared quantum state secret is After the action of the unitary matrix in the scheme, the final state is as follows

is the result state of the auxiliary particle after the action of the unitary matrix. Assuming that the first four participants (excluding Alice) try to get secret information, then they trace the quantum state held by fourth participant, namely, find the reduced density matrix corresponding to the five dimensional subsystems including Alice

is the first four column entangled states of , and is the sixth column quantum state of . The rest of the four participants and the Alice did not get any information about the quantum secret. In the same way, we consider a sequence gates on the bits quantum state secret, each unitary gate is known to the participants. The operations performed by each participant are shown in Fig.6.

5 Security discussion

Dishonest participants attack: A -threshold quantum secret sharing scheme satisfies two properties: (1) any or more parties can perfectly reconstruct the secret quantum state, (2) any or fewer parties can collectively deduce no information at all about the secret quantum state. In this paper, when the first property is clearly hold, it can be seen that the coding program is completely reversible in the encryption phase. Next, we discuss the second property. The secret quantum state before encrypting is

where it is coefficient for the non-trivial Pauli oprators in , and when is the trivial Pauli oprator.

When is odd, it is known by the Property 1 that the final state of the encrypted post is£º

Assuming that the -th participant is honest, the other participants can not get any information about the quantum secret, because we can get the reduced density matrix on the dimension subsystem by tracing the quantum state held by the -th participant

where

then

When is even, it is known by the Property 2 that the final state of the encrypted is£º

Where is the product state of the first column of quantum bits held by Alice. Similarly, assuming that the -th participant is honest, the other participants can not get any information about the quantum secret, because we can get the reduced density matrix on the dimension subsystem by tracing the quantum state held by the -th participant

Where

then

In the two cases, the dishonest participant can only get a highly mixed state, so there is no information about the quantum secret.

Second property is also satisfied when the set of discrete gates composed of Clifford group gates and Toffoli gate act on shared quantum state secret. Suppose that only one of the participants is honest, while the remaining participants can perform any operation, which proves that the result of the honest party’s announcement is uniformly random and independent of the behavior of other participants [14]. According to the effect of the gate evaluation, after the evaluation of the -th gate the state of the system has the form

where is an auxiliary particle that is not destroyed, is a set of ccalars, is a column of quantum states held by Alice, and is a set of operators on the dishonest parties¡¯ system. Honesty and other systems exist in the form of the product state, therefore, the results of the honest measure do not convey any useful information .

6 Conclusions

In this paper, we have constructed an threshold quantum secret sharing scheme for with arbitrary number () of participants, which is based on a quantum circuit composed of Clifford group gates and Toffoli gate. Because of the universal quantum logic gate has different forms, looking for general quantum gate model set and consider other types of universal quantum circuit gate construction, and more secure quantum secret sharing scheme based on these quantum circuits is a problem to be studied in the future.

References

  • (1) Bennett, C. H., Brassard, G., Systems and Signal Processing, In Proceedings of IEEE International Conference on Computers, (IEEE Press, New York), Vol. 175(1984)
  • (2) Ekert, A. K., Quantum Cryptography Based on Bell¡¯s Theorem ,Phys. Rev. Lett. 67, 661 (1991)
  • (3) Cr¨¦peau, C., Gottesman, D., Smith, A., Secure Multi-party Quantum Computing, The Thiry-Fourth ACM Symposium. ACM, 643-652(2002)
  • (4) Broadbent, A., Fitzsimons, J., Kashefi, E., Universal Blind Quantum Computation, Foundations of Computer Science, pp. 517¨C526(2009)
  • (5) Morimae, T., Fujii, K., Blind topological measurement-based quantum computation, Nat. Commun. 3, 1036 (2012)
  • (6) Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., Walther, P., Experimental demonstration of blind quantum computing, Science 335, 303(2012)
  • (7) Broadbent, A., Fitzsimons, J., Kashefi, E., Universal Blind Quantum Computation , Foundations of Computer Science, Vol.19, pp.517-526 (2009)
  • (8) Aharonov, D., Ben-Or, M., Eban, E., Mahadev, U., Interactive Proofs For Quantum Computations, Proceedings of Innovations in Computer Science, arXiv:1704.04487(2010)
  • (9) Reichardt, B., Unger, F., Vazirani, U., Classical command of quantum systems ,Nature (London) 496(7446), 456-460 (2013)
  • (10) Fitzsimons, J. F., Kashefi, E., Unconditionally verifiable blind quantum computation, Phys. Rev. A 96, 012303(2017)
  • (11) Morimae, T., Verification for measurement-only blind quantum computing , Phys. Rev. A 89, 060302 (2014)Morimae, T., Verification for measurement-only blind quantum computing , Phys. Rev. A 89, 060302 (2014)
  • (12) Hayashi, M., Morimae, T., Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing, Phys. Rev. Lett. 115, 220502(2015)
  • (13) Zhou, Z. W.,Tu,T.,Gong,M., et al, Progress and Prospect of quantum computing, Progress in Physics, 29, 127-165(2009)
  • (14) Ouyang, Y., Tan, S. H., Zhao, L., et al, Computing on quantum shared secrets, Phys.rev.a, 96(5) (2017)
  • (15) Hillery, M., Buzek, V., Berthiaume, A., Quantum secret sharing, Phys. Rev. A 59, 1829(1999)
  • (16) Bai, C. M., Li, Z. H., Xu, T. T., et al, A Generalized Information Theoretical Model for Quantum Secret Sharing, International Journal of Theoretical Physics, 55, 4972-4986 (2016)
  • (17) Deng, F. G., Gui, L. L., Zhou, H. Y., An efficient quantum secret sharing scheme with EinsteinPodolskyRosen pairs, Physics Letters A, 340, 43-50(2006)
  • (18) Bai, C. M., Li, Z. H., Liu, C. J., et al, Quantum secret sharing using orthogonal multi-qudit entangled states, Quantum Inf Process, 16, 304 (2017)
  • (19) Xiao, L., Long, G. L., Deng, F. G., et al, Efficient multiparty quantum-secret-sharing schemes, Physics, 69, 521-524(2004)
  • (20) Xu, T. T., Li, Z. H., Bai, C. M., et al, A New Improving Quantum Secret Sharing Scheme, International Journal of Theoretical Physics, 56,1-10(2017)
  • (21) Tittel W, Zbinden H, Gisin N. Experimental demonstration of quantum secret sharing, Physical Review A, 63, 42301 (2001)
  • (22) Bai, C. M., Li, Z. H., Xu, T. T., et al, Quantum secret sharing using the d-dimensional GHZ state, Quantum Inf Process, 16, 59 (2017)
  • (23) Cleve, R., Gottesman, D., Lo, H.-K., How to Share a Quantum Secret ,Phys. Rev. Lett. 83, 648 (1999)
  • (24) Gottesman,D., Theory of quantum secret sharing , Phys. Rev. A, 61(4), 192-193(2000)
  • (25) Markham, D., Sanders, B. C., Graph States for Quantum Secret Sharing, Phys. Rev. A 78, 042309 (2008)
  • (26) Deutsch, D., Barenco, A., Ekert, A., Universality in Quantum Computation, Proceedings Mathematical Physical Sciences, 449(1937):669-677(1995)
  • (27) Zhou, X., Leung, D. W., Chuang, I. L., Methodology for quantum logic gate constructions, Phys. Rev. A 62, 052316(2000)
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
305023
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description