
TL;DR
This paper examines a quantum telecommunication protocol for creating quantum e-cheques, enabling secure digital transactions between customers and bank branches using quantum technology.
Contribution
It introduces a method for producing quantum e-cheques based on multiparty quantum telecommunication, expanding secure banking applications.
Findings
Proposes a quantum telecommunication protocol for e-cheques
Enhances security in digital banking transactions
Builds on previous quantum cheque schemes
Abstract
We analyze the procedure providing quantum cheques of S. R. Moulick and P. K. Panigrahi to produce quantum e-cheques, based on multiparty quantum telecommunication between customer and cooperated branches of bank.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
Quantum E-Cheques
Do Ngoc Diep1,3
1 Instittute of Mathematics, Vietnam Academy of Science and Technology, 18 Hoang Quoc Viet road, 10307 Hanoi, Vietnam
and
Nguyen Van Minh2
2 Department of Mathematics, Thuong Tin High School, Tran Phu Road, Thuong Tin town, Thuong Tin District, Hanoi Vietnam.
3 Institute of Mathematics and Applied Sciences, Thang Long University, Nghiem Xuan Yem road, Hoang Mai district, Ha Noi, Vietnam
Abstract.
We analyze the procedure providing quantum cheques of S. R. Moulick and P. K. Panigrahi [4] to produce quantum e-cheques, based on multiparty quantum telecommunication between custumer and cooperated branches of bank.
Key words and phrases:
Keywords and Terms:
1991 Mathematics Subject Classification:
AMS Mathematics Subject Classification:
15A06; 15A99
quantum secret sharing scheme; quantum multivariate interpolation, quantum cheques, quantum e-cheques
1. Introduction
The problem of providing a quantum code of classical cheques is a central problem of the so called quantum money problem. The question is to provide a scheme of quantum code in such a way that it should be similar to the classical ones but with absolute high secrecy. In the work [4], the authors gave an adequate survey of development of the problem and constructed a scheme for quantum cheques. The scheme is covered the classical version of cheques: The quantum cheque will use the schemes of the form .
Some customer Alice and bank make initialation by the
Gen scheme: namely Alice came to some bank branch to open an account with secret key as a binary -digit number to provide an electronique signature in the future, by using some secret key generation scheme for Alice and bank. The bank later gives her a cheque book serial number . For secrecy, Alice produces some public key and store a secret key . The bank produces 3 entangled qubits in GHZ states
[TABLE]
and send two of them, namely and to Alice. Therefore Alice holds and the bank branch holds .
The next step is the
Sign scheme:. Alice chooses a random number with use a random number generation procedure , a numeration of orthogonal base and certainly an amount she likes to make some transaction with bank (debit or credit), and then evaluate the one-way funtion at the concatennation of the data as to provide a state . Alice encodes the data with the , making them entangled and measuring the Bell states:
[TABLE]
. The system is in the states of form
[TABLE]
[TABLE]
Then Alice performs Pauli transforms
[TABLE]
[TABLE]
and make correction to Alice makes signature by using the procedure and produces the quantum cheque then publicly send through Abby to an arbitrary of the valid branches of the bank.
The final step is the verification
Vrfy scheme: A valid bank branch after received the cheque, informs to the main branch in order to check the signature . For this one uses namely the well-known Fredkin gate ([4], Picture 1). If the or is invalid, the bank destroy the cheque, otherwise the bank continue the measurement in Hadamard basis . If the result is or the main branch communicates to the acting banch to continue. The acting branch perform transformation and . The bank accepts the cheque if it passes the swap test then destroy it.
The schemes are summarized as in the Figure 1 of [4]:
We remark that the quantum cheque is produced and used quite similar to the classical one. We propose therefore to use the multipartite quantum key distribution to make quantum cheques become quantum e-cheques of high secrecy [2]. Our main result is Theorem 2.1 stating that a code for quantum e-cheques can be provided with high secrecy by the multipartite public key distribution of quantum share. The feature of our approach is that (i) Alice does not need to go to a bank branch to do a transaction, but divides her data to a disjoint union of parts and connects with acting branches to send to each one part of her data, (ii) the bank can record the Alice’s data only if all acting branches cooperate together and therefore (iii) they defense the origin of data and Alice prevents some dishonest branches to change the data.
We separately consider the problem of e-cheque transfering in the situation of absolute secured channel in order to point out the main idea of e-chequering. The more complicated problem of e-cheque transfering in presence of eavesdroppers in a nonserured channel or dishonest participants will be separately considered in a subsequent paper.
We thank Prof. S. R. Moulick and Prof. P. K. Panigrahi for carefully reading the first draft of this paper, for valuable comments and for reminding the authors about mediator.
The paper is devoted to this construction in the next Section 2 and finishes with some conclusion.
2. Quantum e-cheques as multiparty quantum secrete sharing
Consider the following modified problem for the situation when Alice does not send the quantum cheques via Abby, but could online connect with acting branches of a bank. To prevent the fact that some distrusted branches could change the cheque. The bank could discover the informations from the quantum cheques only if all acting branches cooperate togheter and in that case the other branches prevent the some untrusted branches to change the contents of the cheque. The quantum cheques in that case are what we call e-cheques.
Solution to this problem is the following scheme of code.
After the first step Gen scheme, in the second step
Sign Scheme one keeps the same as in the previous section, only now, Alice divides the provided concatened information into parts, , where is an appropriate number of branches in action. Then she produces the corresponding states by using a one-way function to have , for all . Following the multiparty secret sharing, when the branches cooperate together and inform to the main branch, one discover the states
Theorem 2.1**.**
The quantum cheques could be with higher secrecy electronically transfered from Alice to the acting bank branches by a code of multiparty quantum telecommunication problem of secret sharing with quantum public key distribution.
Proof. The theorem is proved by the following
Procedure, which is similar to the one in the 3 persons case by Cabello [1], following which the system states are changing as follows.
[TABLE]
Let us consider it in more details.
Transfer Step 1. Initialization of 3n qubits. For a fixed , Alice uses qubits, named: : qubits 1 and 2 are entangled in Bell state, qubits are entangled in GHZ state with acting bank branches: Branch 1, Branch 2, …., Branch n-1, each has 2 entangled qubits namely in null state. Alice produces a Bell state measurement on qubit 1 and 2 and a Fourier measurement on qubits . Each of acting branch makes a Bell state Fourier measurement of entangled . At the end of this step 1, the system is in the state —ψ_i⟩= —0…0⟩_3D_1…D_n-1 ⊗—00⟩_12 ⊗—00⟩_4C_1⊗…⊗—00⟩_n+2,C_n-1
Transfer Step 2. Entangled Bell-state measurements. Alice sends each qubit of her GHZ state out to each acting bank branch of the other branches. The system is in the state —ψ_ii⟩= —AP⟩_3D_1…D_n-1 ⊗—BP⟩_1C_1 ⊗—CP⟩_2C_2 ⊗…⊗—NP⟩_n+2,C_n-1
Transfer Step 3. Secret Bell-state measurement. Next, Alice and each user performs a Bell-state Fourier measurement on the received qubit and one of their qubits. After these measurements the state of the system becomes —ψ_iii⟩= —AP⟩_3D_1…D_n-1 ⊗—AS⟩_2,3⊗—BS⟩_4,D_1 ⊗…⊗—NS⟩_n+2,D_n-1, where is -qubit GHZ state of the standard orthonormal basis.
Transfer Step 4. Secret sharing. The acting branches send a qubit (the one they have not used) to Alice, and she performs a Fourier measurement to discriminate between the GHZ states, and publicly announces the result . After these measurements the state of the system becomes —ψ_iv⟩= —AP⟩_1C_1…C_n-1 ⊗—AS⟩_2,3⊗—BS⟩_4,D_1 ⊗…⊗—NS⟩_n+2,D_n-1, The result AP, and the result of their own secret measurement allow each legitimate acting branch to infer the first bit of Alice’s secret result . To find out the second bit of Alice’s secret , all users (except Alice) must cooperate.
In case there is an illustration of Cabello [1] as in Figure 2.
The proof therefore is achieved.
The 4 steps scheme of public key secret sharing distribution can be generalized to the case of two levels groupped secret sharing as illustrated in the work of A. Jaffe, Z.-W. Liu, and A. Wozniakowsk[3] in Figure 3:
After discovered the e-cheque, bank continue to procede the same procedure Vrfy Scheme as in the quantum cheques scheme above to verify the validity of the e-cheque and accept of destroy it.
3. Conclusion
We show that the quantum cheques can be electronically transfered with higher secrecy by a code of multiparty quantum telecommunication problem of secret sharing with quantum public key distribution. The problem of transfering e-cheques in nonsecured channel is separately considered in a subsequent paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Cabello , Multiparty key distribution and secret sharing based on entanglement swapping , ar Xiv:quant-ph/0009025 v 1, 2000.
- 2[2] Do Ngoc Diep , Multiparty quantum telecommunication using quantum Fourier transforms , ar Xiv: 1705.02608[quant-ph]
- 3[3] A. Jaffe, Z.-W. Liu, and A. Wozniakowsk , Holographic Software for Quantum Networks , https://www.researchgate.net/publication/301818865
- 4[4] S. R. Moulick, P. K. Panigrahi , Quantum cheques , Quantum Inf Process 15 (2016), 2475-2486.
