Network architecture based on quantum business protocol
Through the network architecture of the quantum business protocol, user nodes are used as verifiers, verifiers are selected based on link length and credibility, and credibility is dynamically adjusted. This solves the problems of large data traffic and slow transaction speeds caused by the high security of the notary party, and achieves faster and safer business transactions.
Patent Information
- Application Number
- CN202510819448.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-06-18
- Publication Date
- 2025-09-19
AI Technical Summary
In existing business networks, notaries have high security requirements, which leads to large data traffic, slow transaction speeds, and the risk of transaction failure.
It adopts a network architecture based on the quantum business protocol, uses user nodes as verifiers, generates a shared key pool through QKD, selects verifiers based on link length and credibility, and dynamically adjusts credibility to reduce security requirements on the platform.
It reduces the security requirements for the verifier, increases transaction speed, reduces data traffic pressure, and ensures transaction security when the transaction fails, enabling faster business transactions.
Smart Images
Figure CN120675708A_ABST
Abstract
Description
Technical Field
[0001] The present invention proposes a network architecture based on a quantum business protocol, which relates to the fields of quantum communication and quantum information technology. Background Art
[0002] In existing business networks, ensuring smooth transactions requires a notary to verify that both parties are executing the contract. This notary is typically provided by the platform. However, this notarization method places high demands on the notary, who must be honest to ensure the smooth operation of transactions. This places high demands on the notary's security. If the notary is eavesdropped on or data is tampered with, both parties risk being compromised and the transaction failing. Furthermore, these high security requirements can lead to high data traffic, potentially slowing transaction verification and processing times.
[0003] Nanjing University has proposed a solution for e-commerce that resists repudiation and counterfeiting. The protocol involves three parties: user node A, user node B, and a verifier (TP). Each of these parties uses measurement-independent quantum key distribution (MDI-QKD) to obtain a shared key. User node B uses the shared key k1 between user nodes A and B and the shared key k2 between user node B and the verifier (TP) to generate the contract signature (Sig) based on the contract (Cont) containing the transaction details, using the universal hash function (OTUH). User node B sends the contract (Cont) and signature (Sig) to user node A. If user node A agrees to the contract, it sends the contract (C), signature (Sig), and key k1 to the verifier (TP). Upon receiving the key, the verifier (TP) sends key k2 to user node B. The client and verifier (TP) each perform hash operations on the contract (Cont) and the shared key, comparing them with the key (Sig). If the results are consistent, the signature verification is successful, and user node A pays the funds to the verifier TP, which then transfers the funds to user node B. If the verification fails, the verifier TP returns the funds to user node A and declares the agreement terminated.
[0004] Compared to previous protocols, this paper proposes a quantum commerce network architecture based on the quantum commerce protocol, which allows for the construction of a quantum commerce network. This business network architecture effectively reduces the security requirements for verifiers, enabling some user nodes to become verifiers. This provides verifiers with more options, expediting transactions without compromising security. Summary of the Invention
[0005] The present invention proposes a network architecture based on quantum business protocol, including: user nodes, measurement nodes, and scheduling nodes;
[0006] The user node sends a communication request to the scheduling node, which records the timestamp T1 at this time and selects the target measurement node based on the location of the user node;
[0007] The scheduling node searches for all potential verification nodes near the target measurement node and selects the potential verification nodes that meet the conditions as the verification party TP;
[0008] A shared key pool is generated between user nodes and between user nodes and verifiers through QKD. User nodes and verifiers execute business transactions according to the quantum business protocol, and independently send transaction information to the scheduling node after the transaction is completed. The scheduling node adjusts the credibility of user nodes and verifiers based on the transaction information, and broadcasts the latest credibility to all user nodes every T time.
[0009] In a preferred embodiment, the process of selecting the target measurement node according to the position of the user node is as follows: user node A and user node B send a communication request to the scheduling node, and the scheduling node records the timestamp T1 at this time;
[0010] The scheduling node searches all measurement nodes and selects The smallest measurement node E is used as the target measurement node, where d AE d BE are the link lengths between user node A and measurement node E, and between user node B and measurement node E, respectively.
[0011] In a preferred embodiment, the scheduling node searches all user nodes near the target measurement node to find a node that satisfies a credibility higher than a credibility threshold and satisfies [1000(1-exp(-d E，C ))]M C The largest user node C is used as the verifier, where d E，C The link length from target measurement node E to user node C, M C is the credibility of user node C.
[0012] In a preferred embodiment, the credibility threshold is 0.9 times the highest credibility of user node A and user node B.
[0013] In a preferred embodiment, if the transaction is successful, the asset changes correspond, and the difference between the timestamps fed back by user node A, user node B, and verifier TP and timestamp T1 is less than the preset time T0, the scheduling node updates the accounts of the three parties to the transaction and records the asset changes of each account, thereby increasing the credibility of user node A, user node B, and verifier TP.
[0014] In a preferred embodiment, the credibility of user node A, user node B, and verifier TP is increased as follows:
[0015] Assume that the original credibility of any node among the three parties is M0, and the time since the last successful transaction is t, then the increased credibility is exp(-t)+M0(1-exp(-t));
[0016] If the transaction fails, and the difference between the timestamps of the three parties’ feedback, user node A, user node B, and validator TP, and timestamp T1 is less than the preset time T0, and according to the three-party vote, the credibility of the node that is considered to have no problem remains unchanged; the credibility of the node that is considered to have a problem is reduced to
[0017] When a transaction fails, the assets in the accounts of the three parties involved in the transaction remain unchanged.
[0018] In a preferred embodiment, the scheduling node settles accounts with the user node when the following three situations occur:
[0019] (1) When the total assets of the user node are less than 0;
[0020] (2) The user node requests settlement execution;
[0021] (3) System regular settlement.
[0022] In a preferred embodiment, the scheduling node initializes the credibility of the user node, and the user node determines whether to become a potential verification node based on the initialized credibility.
[0023] In a preferred embodiment, the user node includes: a light source, a classical channel communication device, a quantum state encoding device, and an information processing module; wherein the light source emits light pulses, the quantum state encoding device is connected to the quantum channel and encodes light pulses with quantum state information; the classical channel communication device is connected to the classical channel and performs classical communication; the information processing module performs operations and sends control signals to the classical channel communication device and the quantum state encoding device to control the generation of classical and quantum state information.
[0024] In a preferred embodiment, the measurement node has a measurement device for quantum state light pulses, can perform measurements on quantum state information sent by multiple user nodes, send an event sequence of measurement results to multiple user nodes, and multiple user nodes perform QKD through the measurement node.
[0025] Compared with the prior art, the present invention has the following beneficial technical effects:
[0026] 1. The quantum commerce protocol-based network architecture of the present invention comprises user nodes, measurement nodes, and scheduling nodes. By using user nodes as verifiers in the quantum commerce protocol, the platform no longer needs to serve as the verifier for every transaction, reducing its data bandwidth and security burden. Furthermore, trustworthiness is incorporated to measure the reliability of notaries, allowing for the selection of more reliable notaries, thereby ensuring transaction security.
[0027] 2. Based on the business process of the business network architecture, the measurement node is selected based on the link length, and the verifier is selected based on the link length and credibility. The credibility is dynamically adjusted according to the results of the three-party business agreement, and the credibility is increased or decreased according to the transaction results. The credibility is broadcast regularly, so that the security status of the network nodes can be reflected in real time.
[0028] 3. Through the specific calculation method of credibility and the method of selecting the verifier TP based on credibility, the security requirements for the verifier can be effectively reduced, allowing some user nodes to become verifiers, thereby giving verifiers more options and enabling business transactions to proceed faster without compromising security.
[0029] 4. Compared to existing business networks, the business network proposed in this application allows users to act as verifiers. Network administrators no longer need to perform transaction verification, but only need to schedule user nodes. This reduces the administrator's data traffic pressure and enables faster transactions. Furthermore, the security of quantum protocols ensures that transactions proceed safely, and even if a transaction fails, neither party will suffer a loss. Furthermore, the network proposed in this application incorporates a dynamic trustworthiness assessment of node security, ensuring a secure transaction environment and accelerating transactions. BRIEF DESCRIPTION OF THE DRAWINGS
[0030] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0031] Figure 1 Schematic diagram of user node structure;
[0032] Figure 2 This is a schematic diagram of the scheduling node structure;
[0033] Figure 3 A flowchart of the steps involved in executing transactions on a business network;
[0034] Figure 4 The workflow diagram of the scheduling node. DETAILED DESCRIPTION
[0035] To make the purpose, technical solutions, and advantages of the embodiments of this application more clear, the technical solutions in the embodiments of this application will be clearly and completely described below in conjunction with the drawings in the embodiments of this application. Obviously, the described embodiments are part of the embodiments of this application, not all of the embodiments. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.
[0036] In the drawings of the specific embodiments of the present invention, in order to better and more clearly describe the working principles of the various components in the system, the connection relationship of the various parts in the device is shown, which only clearly distinguishes the relative position relationship between the various components, and does not constitute a limitation on the signal transmission direction, connection sequence and structural size, size and shape of each part within the component or structure.
[0037] Secondly, the term "one embodiment" or "embodiment" herein refers to a specific feature, structure, or characteristic that may be included in at least one implementation of the present invention. The phrase "in one embodiment" appearing in various places throughout this specification does not necessarily refer to the same embodiment, nor does it refer to a separate or selective embodiment that is mutually exclusive of other embodiments.
[0038] The network architecture of the present invention includes the following nodes: user node, measurement node, and scheduling node.
[0039] User nodes are both parties in the business transaction and the verification party, and are participants in the business. Figure 1 As shown, the user node includes a light source, a classical channel communication device, a quantum state encoding device, and an information processing module, which can perform classical communication, encode quantum state information, and calculate the OTUH function.
[0040] The light source can emit light pulses, the quantum state encoding device is connected to the quantum channel and can encode light pulses with quantum state information; the classical channel communication device is connected to the classical channel and can perform classical communication; the information processing module can perform operations and send control signals to the classical channel communication device and the quantum state encoding device to control the generation of classical and quantum state information.
[0041] In the protocol, merchants (user nodes A), customers (user nodes B), and verifiers TP are all user nodes. Optionally, some highly trustworthy nodes are deployed in the network as verifiers.
[0042] The measurement node, equipped with a device for measuring quantum state light pulses, measures the quantum state information sent by two user nodes and sends a sequence of events containing the measurement results to user nodes A and B. The two user nodes can perform QKD via the measurement node. This allows user nodes to perform QKD with fewer measurement nodes without quantum state measurement equipment. Furthermore, based on the security of measurement device-independent (MDI) QKD, QKD remains secure even when the measurement nodes are compromised.
[0043] The scheduling node has classic channel communication equipment and information processing modules, such as Figure 2 As shown in the figure, the scheduling node can calculate and assign a suitable measurement node based on the locations of two nodes with business needs. Based on the given measurement node, it can further assign a suitable user node as the Validator (TP). The scheduling node can set a credibility level and dynamically adjust it based on transaction feedback.
[0044] Specifically, if the transaction is successful, then after receiving and confirming the transaction success information, the scheduling node will enhance the credibility of the three user nodes involved in the transaction (two user nodes and the verifier); if the transaction fails, the scheduling node will reduce the credibility of the node with problems based on the comprehensive feedback from the three parties.
[0045] In a specific embodiment, the network architecture is constructed by a scheduling node. The scheduling node creates accounts for all user nodes and internally records changes in user assets.
[0046] When a user joins the business network, they become a user node. The scheduling node creates an account for the user node, and the initial assets of the account are set to 0.
[0047] Optionally, when establishing a user node, the user can transfer an initial amount to the bank account of the scheduling node. The scheduling node sets the initial assets to the corresponding value when setting up the account, that is, the initial transfer amount.
[0048] The transactions between user nodes in the business network are carried out through the following steps: Figure 3 As shown:
[0049] S101. The user node sends a communication request to the scheduling node. The scheduling node records the timestamp T1 at this time and selects a measurement node based on the location of the user node.
[0050] The merchant (user node A) and the customer (user node B) send a communication request to the scheduling node, and the scheduling node records the timestamp T1 at this time.
[0051] The scheduling node selects the target measurement node E according to the positions of user nodes A and B in the following manner:
[0052] The scheduling node searches all measurement nodes and selects The smallest measurement node E is used as the target measurement node, where d AE d BE are the link lengths between user node A and measurement node E, and between user node B and measurement node E, respectively.
[0053] S102. The scheduling node searches for all potential verification nodes near the target measurement node and selects a potential verification node that meets the conditions as a verifier.
[0054] The scheduling node initializes the credibility of the user node, and the initial credibility is M. The user node can determine whether to become a potential verification node based on the initial credibility. Preferably, the initial credibility M is 0.5.
[0055] The scheduling node searches all potential verification nodes near the measurement node E, looking for a node with a credibility higher than 0.9 times the highest credibility of the user nodes A and B, and satisfies [1000(1-exp(-d E，C ))]M C The largest user node C is used as the verifier TP, where d E，C The link length from target measurement node E to user node C, M C is the credibility of user node C.
[0056] S103. A shared key pool is generated between user nodes and between user nodes and the verifier through QKD.
[0057] The client (user node A) and the merchant (user node B), the merchant (user node B) and the authenticator TP, and the client (user node A) and the authenticator TP all perform QKD via measurement node E. Due to the characteristics of MDI-QKD, the security of measurement node E does not affect the security of the key. This means that even if measurement node E is potentially vulnerable to eavesdroppers or saboteurs, both parties involved in QKD can still obtain a correct and secure shared key. A shared key pool is generated through QKD between user nodes A and B, user node B and the authenticator TP, and user node A and the authenticator TP.
[0058] Optionally, for users who frequently execute protocols, a one-time key pool can be generated in advance through QKD, which can save time in executing the protocol.
[0059] S104. The user node and the verifier execute business transactions according to the quantum business protocol.
[0060] User Node A, User Node B, and Verifier TP execute a business transaction according to the Quantum Business Tripartite Agreement. The transfer in a business transaction refers to the corresponding change in the assets in the corresponding user account.
[0061] Optionally, the additional information of the contract includes a timestamp and a characteristic identifier of the user node A, such as a network address code; the additional information of the contract includes integrity verification information, such as a hash value of the entire file.
[0062] Optionally, in order to prevent the leakage of contract content, during the information transmission process, plain text transmission is not used, but key encryption transmission in the QKD key pool is used.
[0063] S105. After the transaction is completed, the user node and the verifier independently send transaction information to the scheduling node, and the scheduling node adjusts the credibility.
[0064] After the transaction is completed, the user node performs the following operations:
[0065] If the transaction is successful, user node A, user node B, and validator TP will independently send a transaction success message to the scheduling node, attaching the changes in personal assets and a timestamp; if the transaction fails, user node A, user node B, and validator TP will independently indicate the problematic node to the scheduling node, indicating the changes in personal assets and a timestamp.
[0066] The scheduling node performs the following operations:
[0067] The scheduling node records the transaction in the log. If the transaction is successful, the asset changes are consistent, and the difference between the timestamps reported by user node A, user node B, and the validator TP and T1 is less than the preset time T0, the accounts of the three parties will be updated, and the asset changes of each account will be recorded to increase the credibility of the three parties. The increase method is as follows (taking A as an example):
[0068] The credibility of user node A, user node B, and verifier TP is increased as follows:
[0069] Assume that the original credibility of the node is M0, and the time since the last successful transaction is t, then the increased credibility is exp(-t)+M0(1-exp(-t));
[0070] If the transaction fails, and the difference between the timestamps reported by user node A, user node B, and validator TP and T1 is less than the preset time T0, and according to the three-party vote, the node is not the problematic node, then the credibility of the node remains unchanged;
[0071] If a node transaction fails, and the three parties involved in the transaction vote that the node is a problematic node, the credibility of the user node will be reduced to
[0072] When a transaction fails, the assets in the accounts of the three parties involved in the transaction remain unchanged.
[0073] The workflow of the scheduling node is as follows Figure 4 shown.
[0074] If the three parties to the transaction are still dissatisfied with the processing results, they can submit an arbitration request to the scheduling node based on the scheduling node's log.
[0075] S106. The scheduling node broadcasts the latest credibility to all user nodes every T time.
[0076] The time T is pre-set by the network.
[0077] Optionally, the scheduling node sets a credibility threshold M1. If the credibility of a user node is lower than M1, the scheduling node immediately broadcasts the node to the entire network and declares that the node is unsafe.
[0078] Settlement: The scheduling node settles the user node when the following three situations occur: (1) the total assets of the user node are less than 0; (2) the user node requests settlement; (3) the system settles at scheduled times.
[0079] If the total assets of the user node are less than 0 at the time of settlement, the user node needs to transfer the amount corresponding to the total assets to the bank account of the scheduling node, and then the scheduling node will clear the total assets of the user node to zero.
[0080] If the total assets of the user node are greater than 0 at the time of settlement, the user node can apply for withdrawal and request the scheduling node's bank account to transfer a certain amount (not greater than the total assets) to the user node. The scheduling node then deducts the corresponding amount from the user node's total assets.
[0081] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, database or other media used in the embodiments provided in this application may include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory may include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in the various embodiments provided herein may include at least one of a relational database and a non-relational database. Non-relational databases may include, but are not limited to, distributed databases based on blockchains. The processor involved in the various embodiments provided herein may be, but are not limited to, a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, and the like.
[0082] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0083] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present application. It should be noted that a person of ordinary skill in the art may make various modifications and improvements without departing from the spirit of the present application, and these modifications and improvements fall within the scope of protection of the present application. Therefore, the scope of protection of the present application shall be determined by the appended claims.
Claims
1. A network architecture based on quantum business protocol, characterized by: include: User nodes, measurement nodes, and scheduling nodes; The user node sends a communication request to the scheduling node, which records the timestamp T1 at this time and selects the target measurement node based on the location of the user node; The scheduling node searches for all potential verification nodes near the target measurement node and selects the potential verification nodes that meet the conditions as the verification party TP; A shared key pool is generated between user nodes and between user nodes and verifiers through QKD. User nodes and verifiers execute business transactions according to the quantum business protocol, and independently send transaction information to the scheduling node after the transaction is completed. The scheduling node adjusts the credibility of user nodes and verifiers based on the transaction information, and broadcasts the latest credibility to all user nodes every T time.
2. The network architecture based on the quantum business protocol according to claim 1 is characterized in that: The process of selecting the target measurement node according to the position of the user node is as follows: user node A and user node B send a communication request to the scheduling node, and the scheduling node records the timestamp T1 at this time; The scheduling node searches all measurement nodes and selects The smallest measurement node E is used as the target measurement node, where d AE d BE are the link lengths between user node A and measurement node E, and between user node B and measurement node E, respectively.
3. The network architecture based on the quantum business protocol according to claim 2 is characterized in that: The scheduling node searches all user nodes near the target measurement node and finds the nodes that meet the reliability higher than the reliability threshold and [1000(1-exp(-d E，C ))]M C The largest user node C is used as the verifier, where d E，C The link length from target measurement node E to user node C, M C is the credibility of user node C.
4. The network architecture based on the quantum business protocol according to claim 3 is characterized in that: The credibility threshold is 0.9 times the highest credibility of user node A and user node B.
5. The network architecture based on the quantum business protocol according to claim 2 is characterized in that: If the transaction is successful, the asset changes correspond, and the difference between the timestamps fed back by user node A, user node B, and verifier TP and timestamp T1 is less than the preset time T0, the scheduling node updates the accounts of the three parties in the transaction and records the asset changes of each account, thereby increasing the credibility of user node A, user node B, and verifier TP.
6. The network architecture based on the quantum business protocol according to claim 5 is characterized in that: The credibility of user node A, user node B, and verifier TP is increased as follows: Assume that the original credibility of any node among the three parties is M0, and the time since the last successful transaction is t, then the increased credibility is exp(-t)+M0(1-exp(-t)); If the transaction fails, and the difference between the timestamps of the three parties’ feedback, user node A, user node B, and validator TP, and timestamp T1 is less than the preset time T0, and according to the three-party vote, the credibility of the node that is considered to have no problem remains unchanged; the credibility of the node that is considered to have a problem is reduced to When a transaction fails, the assets in the accounts of the three parties involved in the transaction remain unchanged.
7. The network architecture based on the quantum business protocol according to claim 1 is characterized in that: When the following three situations occur, the scheduling node settles the user node: (1) When the total assets of the user node are less than 0; (2) The user node requests settlement execution; (3) System regular settlement.
8. The network architecture based on the quantum business protocol according to claim 1 is characterized in that: The scheduling node initializes the credibility of the user node, and the user node determines whether it becomes a potential verification node based on the initialized credibility.
9. The network architecture based on the quantum business protocol according to claim 1 is characterized in that: The user node includes: a light source, a classical channel communication device, a quantum state encoding device, and an information processing module; wherein the light source emits light pulses, the quantum state encoding device is connected to the quantum channel and encodes the light pulses with quantum state information; the classical channel communication device is connected to the classical channel and performs classical communication; the information processing module performs operations and sends control signals to the classical channel communication device and the quantum state encoding device to control the generation of classical and quantum state information.
10. The network architecture based on the quantum business protocol according to claim 1 is characterized in that: The measurement node has a measurement device for quantum state light pulses, can perform measurements on quantum state information sent by multiple user nodes, and send an event sequence of measurement results to the multiple user nodes, and the multiple user nodes perform QKD through the measurement node.