Financial alliance chain-based data processing method, device, equipment and medium for a flash sale

Abstract

The application relates to a financial alliance chain-based data processing method and device for a second killing, computer equipment and a storage medium, and relates to the fields of blockchains and financial technologies. The method comprises the following steps: joining a second killing data processing group based on a financial alliance chain; acquiring a common public key of the financial alliance chain and a public key of a node of a first second killing data processing participant; determining a first routing path from an initial node to a target node; sending an encrypted tunnel establishment request message to the target node; receiving an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message are used for negotiating a symmetric key between the initial node and the target node; and based on the negotiated symmetric key, first routing information and second routing information, the initial node and the target node perform encrypted transmission of second killing data. The present scheme can realize safe and fast transmission of second killing data.

Description

Technical Field

[0001] The present application relates to the field of blockchain and financial technology, and in particular to a method, device, computer equipment, and storage medium for processing flash sale data based on a financial alliance chain. Background Art

[0002] With the development of blockchain technology, financial consortium chains, comprised of multiple financial institutions, have begun to emerge in the financial sector. Based on these chains, financial institutions can provide users with information on their own financial products and services, as well as those of other institutions on the chain, and support transactions. Furthermore, financial institutions can also conduct various marketing activities, including flash sales, to increase user engagement and satisfaction.

[0003] When a financial institution on a consortium chain organizes a flash sale, users can access it through any node corresponding to a financial institution on the consortium chain. The node that receives the user's flash sale request must securely and quickly transmit the flash sale data to the node of the financial institution organizing the flash sale to promptly respond to the user's needs. However, because blockchain is a distributed system, data transmission between the node servers of different financial institutions in the consortium chain currently requires broadcasting, resulting in slow data transmission and difficulty meeting the time requirements for flash sale data transmission. Furthermore, because flash sale data must be transmitted between nodes via the internet, there is a risk of mid-transmission modification, making it difficult to ensure data security. Summary of the Invention

[0004] Based on this, it is necessary to provide a flash sale data processing method, device, computer equipment, and computer-readable storage medium based on a financial alliance chain to address the above technical problems.

[0005] In a first aspect, the present application provides a method for processing flash sale data based on a financial alliance chain. The method comprises:

[0006] Join a flash sale data processing group based on the financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; each flash sale data processing participant's system corresponds to a node in the financial alliance chain;

[0007] Obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant;

[0008] Determine a first routing path from an initial node to a target node; the first routing path enables data from the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group;

[0009] Sending an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key, and first routing information; the first routing information is determined according to the first routing path;

[0010] receiving an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message including second routing information; the second routing information being determined based on a second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message being used by the initial node and the target node to negotiate a symmetric key;

[0011] Based on the negotiated symmetric key, the first routing information, and the second routing information, encrypted transmission of the flash sale data is performed with the target node.

[0012] In one embodiment, encrypted transmission of flash sale data with the target node is performed based on a negotiated symmetric key, first routing information, and second routing information, including: determining corresponding first flash sale transaction data based on a user's financial product flash sale request; encrypting the flash sale transaction data based on the negotiated symmetric key to obtain encrypted first flash sale transaction data, and transmitting the encrypted first flash sale transaction data to a node of a second flash sale data processing participant in accordance with a data transmission message format of a preset encryption tunnel protocol and the first routing information; receiving encrypted first flash sale result data sent by the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted first flash sale result data is obtained by encrypting the first flash sale result data corresponding to the first flash sale transaction data by the node of the second flash sale data processing participant based on the negotiated symmetric key; and obtaining the first flash sale result data based on the negotiated symmetric key and the encrypted first flash sale result data.

[0013] In one embodiment, before determining the corresponding first flash sale transaction data based on the user's financial product flash sale request, the method further includes: determining a flash sale filtering condition corresponding to the financial product flash sale activity based on the configuration parameters of the financial product flash sale activity synchronized from the financial alliance chain; and receiving a financial product flash sale request submitted by the user in the financial product flash sale activity that meets the flash sale filtering condition.

[0014] In one embodiment, determining the flash sale filtering conditions corresponding to the financial product flash sale activity based on the configuration parameters of the financial product flash sale activity synchronized from the financial alliance chain includes: determining the flash sale inventory quota and the flash sale concurrency parameters based on the configuration parameters of the financial product flash sale activity; setting the flash sale filtering conditions based on the token bucket algorithm based on the flash sale concurrency parameters and the flash sale inventory quota; receiving the financial product flash sale request submitted by the user in the financial product flash sale activity that meets the flash sale filtering conditions includes: using the flash sale filtering conditions to limit the user's access traffic in the financial product flash sale activity, and receiving the financial product flash sale request that meets the flash sale filtering conditions; determining the corresponding first flash sale transaction data based on the user's financial product flash sale request includes: matching the financial product flash sale request that meets the flash sale filtering conditions with the flash sale inventory quota to generate a flash sale qualification certificate corresponding to the user; and obtaining the first flash sale transaction data based on the flash sale qualification certificate and the financial product flash sale request.

[0015] In one embodiment, the encrypted transmission of flash sale data with the target node based on the negotiated symmetric key, the first routing information, and the second routing information includes: receiving encrypted second flash sale transaction data sent by the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted second flash sale transaction data is obtained by the node of the second flash sale data processing participant encrypting the second flash sale transaction data according to the negotiated symmetric key; obtaining the second flash sale transaction data based on the symmetric key and the encrypted second flash sale transaction data; determining second flash sale result data corresponding to the second flash sale transaction data based on preset financial product flash sale activity parameters corresponding to the second flash sale transaction data; encrypting the second flash sale result data according to the negotiated symmetric key to obtain encrypted second flash sale result data, and transmitting the encrypted second flash sale result data to the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the first routing information.

[0016] In one embodiment, the method further includes: obtaining first routing information corresponding to the first routing path based on a dynamic routing table stored on the financial alliance chain; the dynamic routing table includes the first routing path dynamically updated by an ant colony optimization algorithm.

[0017] In one embodiment, joining the flash sale data processing group based on the financial alliance chain includes: generating a first key based on a selected first security parameter; sending the first key to the node of the manager of the financial alliance chain; receiving a second security parameter returned by the node of the manager; the second security parameter is selected and returned by the node of the manager after checking the legitimacy of the first key; generating a second key based on the second security parameter and the first security parameter; sending the second key to the node of the manager; receiving a signature certificate returned by the node of the manager; the signature certificate is generated and returned by the node of the manager after checking the legitimacy of the second key; and joining the flash sale data processing group based on the financial alliance chain when the verification of the signature certificate is passed.

[0018] In a second aspect, the present application also provides a flash sale data processing device based on a financial alliance chain. The device includes:

[0019] A group joining module, configured to join a flash sale data processing group based on a financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; each flash sale data processing participant's system corresponds to a node in the financial alliance chain;

[0020] A public key acquisition module, used to obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant;

[0021] a path determination module, configured to determine a first routing path from an initial node to a target node; the first routing path enables data from the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group;

[0022] a request sending module, configured to send an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key, and first routing information; the first routing information is determined according to the first routing path;

[0023] a response receiving module, configured to receive an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message including second routing information; the second routing information being determined based on a second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message being used by the initial node and the target node to negotiate a symmetric key;

[0024] The flash sale transmission module is used to encrypt and transmit the flash sale data with the target node based on the negotiated symmetric key, the first routing information and the second routing information.

[0025] In a third aspect, the present application further provides a computer device. The computer device includes a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are performed:

[0026] Join a flash sale data processing group based on the financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; each flash sale data processing participant's system corresponds to a node in the financial alliance chain;

[0027] Obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant;

[0028] Determine a first routing path from an initial node to a target node; the first routing path enables data from the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group;

[0029] Sending an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key, and first routing information; the first routing information is determined according to the first routing path;

[0030] receiving an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message including second routing information; the second routing information being determined based on a second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message being used by the initial node and the target node to negotiate a symmetric key;

[0031] Based on the negotiated symmetric key, the first routing information, and the second routing information, encrypted transmission of the flash sale data is performed with the target node.

[0032] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the following steps:

[0033] Join a flash sale data processing group based on the financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; each flash sale data processing participant's system corresponds to a node in the financial alliance chain;

[0034] Obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant;

[0035] Determine a first routing path from an initial node to a target node; the first routing path enables data from the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group;

[0036] Sending an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key, and first routing information; the first routing information is determined according to the first routing path;

[0037] receiving an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message including second routing information; the second routing information being determined based on a second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message being used by the initial node and the target node to negotiate a symmetric key;

[0038] Based on the negotiated symmetric key, the first routing information, and the second routing information, encrypted transmission of the flash sale data is performed with the target node.

[0039] In a fifth aspect, the present application further provides a computer program product. The computer program product includes a computer program that, when executed by a processor, implements the following steps:

[0040] Join a flash sale data processing group based on the financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; each flash sale data processing participant's system corresponds to a node in the financial alliance chain;

[0041] Obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant;

[0042] Determine a first routing path from an initial node to a target node; the first routing path enables data from the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group;

[0043] Sending an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key, and first routing information; the first routing information is determined according to the first routing path;

[0044] receiving an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message including second routing information; the second routing information being determined based on a second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message being used by the initial node and the target node to negotiate a symmetric key;

[0045] Based on the negotiated symmetric key, the first routing information, and the second routing information, encrypted transmission of the flash sale data is performed with the target node.

[0046] The above-mentioned flash sale data processing method, device, computer equipment, and storage medium based on the financial alliance chain join the flash sale data processing group based on the financial alliance chain, obtain the common public key of the financial alliance chain and the public key of the first flash sale data processing participant node, determine the first routing path from the initial node to the target node, send an encrypted tunnel establishment request message including the common public key, the public key, and the first routing information determined according to the first routing path to the target node, and receive an encrypted tunnel establishment response message including the second routing information sent by the target node, wherein the encrypted tunnel establishment request message and the encrypted tunnel establishment response message are used for the initial node to negotiate a symmetric key with the target node, and based on the negotiated symmetric key, the first routing information and the second routing information, encrypt the flash sale data and transmit it with the target node. In this process, a first routing path is determined that enables the data of the initial node to be transmitted to the target node at the fastest speed. The initial node sends an encrypted tunnel establishment request message including a common public key, a public key, and first routing information determined by the first routing path to the target node, and receives an encrypted tunnel establishment response message including second routing information sent by the target node. In this way, while negotiating the symmetric key, the first routing path that can transmit data at the fastest speed between the initial node and the target node is determined. Based on the negotiated symmetric key, the first routing information and the second routing information, encrypted transmission of the flash sale data is performed with the target node. This allows the flash sale data to be transmitted according to the previously determined routing path with the fastest transmission speed, thereby ensuring both the transmission speed and security of the flash sale data. BRIEF DESCRIPTION OF THE DRAWINGS

[0047] Figure 1 This is a diagram of the application environment of a flash sale data processing method based on a financial alliance chain in one embodiment;

[0048] Figure 2 This is a flowchart of a method for processing flash sale data based on a financial alliance chain in one embodiment;

[0049] Figure 3 A flowchart illustrating the steps of adding a flash sale data processing group based on a financial alliance chain in one embodiment;

[0050] Figure 4 1. A flowchart illustrating the steps of encrypting and transmitting flash sale data with a target node based on a negotiated symmetric key, first routing information, and second routing information in one embodiment.

[0051] Figure 5 This is a flowchart of steps for encrypting and transmitting flash sale data with a target node based on a negotiated symmetric key, first routing information, and second routing information in another embodiment;

[0052] Figure 6 This is a structural block diagram of a flash sale data processing device based on a financial alliance chain in one embodiment;

[0053] Figure 7 FIG. 1 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0054] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0055] The following are some definitions used in this application:

[0056] Byte sequence concatenation: Let X and Y be byte sequences. Concatenation is the process of connecting two byte sequences X and Y to form another byte sequence Z, which is formally expressed as Z = X||Y.

[0057] Security parameters of group signature: Let ω>1, k,l p is a security parameter, let λ1, λ2, γ1, γ2 represent length variables, and satisfy λ1>ω(λ2+k)+2, λ1>4l p ,γ1>ω(γ2+k)+2,γ2>γ1+2. Define the range of integers Λ,Γ, respectively, as follows:

[0058]

[0059]

[0060] Let H denote a hash function, formally represented as: H: {0,1} * →{0,1} k .

[0061] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with the relevant laws, regulations and standards of relevant countries and regions.

[0062] The flash sale data processing method based on the financial alliance chain provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, the application environment may include: multiple nodes of the financial alliance chain, and user terminals. In the present application, a node in the financial alliance chain may serve as a flash sale data processing participant in the flash sale data processing group. After a flash sale data processing participant joins the flash sale data processing group based on the financial alliance chain, its system corresponds to a node in the financial alliance chain. The flash sale data processing group may include three or more participants, and the participants may be financial institutions such as banks that provide flash sale activities for financial products. Among them, the user terminal can be used to send and receive relevant information such as flash sale requests from users, and can be connected to a node such as one of the participants, and forward the flash sale data and other related information to the corresponding node such as another participant through the node of the participant. At the same time, it can also receive the flash sale data and other related information from the node of the participant and return it to the user.

[0063] like Figure 1 In the application environment shown, user terminals can include, but are not limited to, various personal computers, laptops, smartphones, tablets, IoT devices, and portable wearable devices. IoT devices can include smart speakers, smart TVs, smart air conditioners, and smart car devices. Portable wearable devices can include smart watches, smart bracelets, and head-mounted devices. The nodes of the financial alliance chain can be servers, which can be implemented as independent servers or server clusters consisting of multiple servers.

[0064] In one embodiment, Figure 2 As shown, a method for processing flash sale data based on a financial alliance chain is provided, comprising the following steps:

[0065] Step S201: Join a flash sale data processing group based on a financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; the system of each flash sale data processing participant corresponds to a node of the financial alliance chain.

[0066] Specifically, the first flash sale data processing participant can join the flash sale data processing group based on the financial alliance chain before the flash sale event is held. Figure 1As shown above, a flash sale data processing group may include three or more flash sale data processing participants, which may be financial institutions such as banks that offer flash sale activities for financial products. In this flash sale data processing group, the system of each flash sale data processing participant corresponds to a node in the financial alliance chain.

[0067] In some embodiments, as Figure 3 As shown, step S201 of joining the flash sale data processing group based on the financial alliance chain may include:

[0068] Step S301: Generate a first key according to a selected first security parameter.

[0069] In this step, the node of the first flash sale data processing participant can apply to the manager of the financial alliance chain (or called the public key manager) to join the flash sale data processing group. The node of the first flash sale data processing participant selects a first security parameter, such as a random number, and generates a first key based on the selected first security parameter. Specifically, the first security parameter selected by the node of the first flash sale data processing participant can be expressed as: The first key c1 can be expressed as:

[0070]

[0071] Where, the modulus n = pq, and p and q are both prime numbers, g, It can be a random element selected, the order of QR is p′q′, p′,q′ can be a length of l p A random prime number of bits, where p = 2p′+1, q = 2q′+1.

[0072] Step S302: Send the first key to the node of the manager of the financial alliance chain.

[0073] Step S303: Receive a second security parameter returned by the management node; the second security parameter is selected and returned by the management node after checking the validity of the first key.

[0074] In the above steps S302 and S303, the node of the first flash sale data processing participant can send the first key c1 to the node of the management party. After receiving the first key c1, the node of the management party checks the legitimacy of the first key c1, that is, determines c1∈QR(n). After the node of the management party passes the legitimacy check of the first key c1, it can select the second security parameter and return it to the node of the first flash sale data processing participant. Specifically, the node of the management party can select the second security parameters α1, β1, where The second security parameters α1, β1 are returned to the node of the first flash sale data processing participant.

[0075] Step S304: Generate a second key according to the second security parameter and the first security parameter.

[0076] Step S305: Send the second key to the management node.

[0077] In the above steps S304 and S305, the node of the first flash sale data processing participant can be based on the second security parameters α1, β1 and the first security parameters Generate the second key c2. Specifically, the node of the first flash sale data processing participant can first calculate the key parameter Then calculate the second key c2=a based on the key parameter x x modn, and then sends the second key c2 to the management node for verification.

[0078] Step S306: Receive the signature certificate returned by the management node; the signature certificate is generated and returned by the management node after checking the legitimacy of the second key.

[0079] In this step, after receiving the second key c2, the management node can verify the legitimacy of the second key c2, specifically verifying c2∈QR(n). If the verification is successful, it indicates that the above proof is correct. Then the management node can select a random prime number e∈Γ and calculate the signature certificate (A, e), where A: = (c2a0) 1 / e Then the management node returns the signature certificate (A, e) to the node of the first flash sale data processing participant.

[0080] Step S307: When the verification of the signature certificate is passed, join the flash sale data processing group based on the financial alliance chain.

[0081] In this step, after the node of the first flash sale data processing participant receives the signature certificate (A, e), it can verify the signature certificate (A, e) in the following ways: a x a0=A e modn, when the verification of the signature certificate (A, e) is passed, the node of the first flash sale data processing participant joins the flash sale data processing group based on the financial alliance chain.

[0082] Step S202: Obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant.

[0083] In this step, when the node of the first flash sale data processing participant needs to transmit data, it can obtain the common public key PK of the financial alliance chain and the public key PK of this node. i .

[0084] Exemplarily, a method for obtaining the common public key PK of the financial alliance chain may include: selecting a third security parameter and storing it in the financial alliance chain; after the signatures of the third security parameters by each participant in the flash sale data processing group are stored in the financial alliance chain, obtaining the common public key generated by the node of the manager of the financial alliance chain based on the third security parameter.

[0085] Among them, the node of the first flash sale data processing participant can select the third security parameter including: length l p The random prime numbers p′,q′ of bits are set, let p=2p′+1,q=2q′+1, and both p and q are prime numbers, modulus n=pq, a,a0,g,h∈QR(n), the order of QR is p′q′, and the security parameter y=g x modn, where x∈Z* p′q′ The node of the first flash sale data processing participant can then upload the third security parameter to the financial alliance chain for evidence storage. The nodes of other flash sale data processing participants in the flash sale data processing group can call the smart contract to read the third security parameter stored in the financial alliance chain. The nodes of each participant can then use their own private key to sign the third security parameter and store it in the financial alliance chain. The signature processing steps are as follows:

[0086] Generate a random number w∈{0,1}2l p , and calculate:

[0087] T1=A1y w modn

[0088] T2=g w modn

[0089] T3=g e h w modn

[0090] Random selection And calculate the following operator:

[0091] (1)

[0092] (2)c=H(g||h||y||a0||a||T1||T2||T3||d1||d2||d3||d4||m)

[0093] (3) s3=r3-cew,s4=r4-cw

[0094] The signature information (c, s1, s2, s3, s4, T1, T2, T3) obtained by signing the third security parameter is stored on the financial consortium chain. After the signatures of the third security parameters by each participant in the flash sale data processing group are stored on the financial consortium chain, the node of the financial consortium chain manager can generate a common public key PK based on the third security parameters. This common public key PK can also be stored on the financial consortium chain, and the node of the first flash sale data processing participant can thereby obtain the common public key PK.

[0095] Step S203, determining a first routing path from the initial node to the target node; the first routing path enables the data of the initial node to be transmitted to the target node at the fastest speed; the initial node is the node of the first flash sale data processing participant, and the target node is the node of the second flash sale data processing participant in the flash sale data processing group.

[0096] In this step, when the first flash sale data processing participant needs to transmit data to the second flash sale data processing participant in the flash sale data processing group, a first routing path is determined from the first flash sale data processing participant's node as the initial node and the second flash sale data processing participant as the target node. This first routing path enables data from the initial node to be transmitted to the target node at the fastest speed.

[0097] Step S204: Send an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes a common public key, a public key, and first routing information; the first routing information is determined according to the first routing path.

[0098] In this step, the initial node may send an encrypted tunnel establishment request message to the target node according to the first message format of the preset encrypted tunnel protocol.

[0099] Among them, the preset encryption tunnel protocol can refer to the wireguard tunnel protocol. The preset encryption tunnel protocol is a protocol that works at the third layer (network layer) of the network protocol and executes the kernel virtual network interface (which can mainly serve the Linux operating system). The preset encryption tunnel protocol can associate the public key of the node with the source tunnel address, and can realize key exchange, connection, connection termination, reconnection, node discovery and other service capabilities. From the manager's perspective, the kernel virtual network interface has a stateless feature, and the data packets penetrating the interface can be encrypted and authenticated. Among them, the preset encryption tunnel protocol can include a first message format, a second message format and a data transmission message format. The first message format and the second message format are message formats used for the node of the flash sale data processing participant to negotiate a symmetric key with the nodes of other participants in the flash sale data processing group. The data transmission message format is a message format used for the node of the flash sale data processing participant to transmit data with the nodes of other participants in the flash sale data processing group.

[0100] In this step, the node of the first flash sale data processing participant, i.e., the initial node, can send an encrypted tunnel establishment request message to the node of the second flash sale data processing participant in the flash sale data processing group, i.e., the target node, in accordance with the first message format of the preset encrypted tunnel protocol. The encrypted tunnel establishment request message can include the common public key of the financial alliance chain and the public key of the initial node, as well as the first routing information determined according to the first routing path obtained in step S203, and can also include the initial node's signature on the common public key. Specifically, the first message format is as follows:

[0101]

[0102] Among them, the IP header represents the data packet header, the first routing information may include Next hop, type represents the message type, type=0X1 represents sending a message, type=0x2 represents receiving a message, etc., reserved represents a reserved field, sender represents the sender's public key, receiver represents the receiver's public key, ephemeral represents a temporary credential, timestamp represents a sending timestamp, static represents static information, and the static information may include a common public key PK, mac1 and mac2 represent a message authentication algorithm (MAC, Message Authentication Codes), and the hashed header information Hi is formally expressed as: H i =Hash(Hash(Construct)||PK i ). Among them, Hash represents the hash algorithm SHA-256, Construct represents the content information of the structure, PKI represents the public key of communication node i (initial node), and || represents the byte sequence cascade operator.

[0103] Step S205, receiving an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message includes second routing information; the second routing information is determined based on the second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message are used for the initial node and the target node to negotiate a symmetric key.

[0104] In this step, after the initial node sends an encrypted tunnel establishment request message to the target node, the target node can verify the common public key and public key. After the verification of the common public key and public key is passed, the encrypted tunnel establishment response message can be returned in accordance with the second message format of the preset encrypted tunnel protocol. The initial node can receive the encrypted tunnel establishment response message sent by the target node in accordance with the second message format of the preset encrypted tunnel protocol. The encrypted tunnel establishment request message may include second routing information determined by a second routing path. The second routing path can enable the node of the second flash sale data processing participant, that is, the target node in this step, to send data to the node of the first flash sale data processing participant, that is, the initial node in this step, at the fastest speed. Among them, the encrypted tunnel establishment request message and the encrypted tunnel establishment response message are used for the initial node and the destination node to negotiate a symmetric key. Specifically, the second message format is as follows:

[0105]

[0106] The IP header indicates a data packet header, the second routing information may include a Next hop, and the Empty field indicates calculation of a Poly1035 authentication tag for 12 bytes of all-zero data.

[0107] After the initial node receives the encrypted tunnel establishment response message sent by the target node, it can indicate that the encrypted tunnel is successfully established and communication messages can be sent.

[0108] Exemplarily, the target node verifying the common public key and the public key may include: executing a preset signature verification function to verify the signature of the common public key, and executing a preset identity verification function to verify the public key.

[0109] Specifically, the target node can execute a preset signature verification function, bool=Verifysign(PK, sk(i)), to verify the signature of the shared public key. Where sk(i) represents the target node's private key, PK represents the shared public key, and bool represents the result of the signature verification, with bool=true indicating success and bool=false indicating failure. If signature verification fails, the target node can reject the communication connection.

[0110] The target node can also execute a preset authentication function (bool=AuthenKey(PK, pk(j)) to verify the public key, where PK(j) represents the public key of the initial node, PK represents the common public key, and bool represents the authentication result. bool=true indicates successful authentication, and bool=false indicates failed authentication. If authentication fails, the target node can reject the communication connection.

[0111] Step S206: Encrypted transmission of the flash sale data is performed with the target node based on the negotiated symmetric key, the first routing information, and the second routing information.

[0112] In this step, the initial node can use the negotiated symmetric key based on the encrypted tunnel that has been established between it and the target node to transmit the encrypted flash sale data to the target node through the first routing path corresponding to the first routing information, and receive the flash sale data encrypted and transmitted by the target node through the second routing path corresponding to the second routing information.

[0113] In the above-mentioned method for processing flash sale data based on the financial alliance chain, by joining the flash sale data processing group based on the financial alliance chain and obtaining the common public key of the financial alliance chain and the public key of the first flash sale data processing participant node, the first routing path from the initial node to the target node is determined, and an encrypted tunnel establishment request message including the common public key, the public key and the first routing information determined according to the first routing path is sent to the target node, and an encrypted tunnel establishment response message including the second routing information sent by the target node is received, wherein the encrypted tunnel establishment request message and the encrypted tunnel establishment response message are used for the initial node to negotiate a symmetric key with the target node, and based on the negotiated symmetric key, the first routing information and the second routing information, the flash sale data is encrypted and transmitted with the target node. In this process, a first routing path is determined that enables the data of the initial node to be transmitted to the target node at the fastest speed. The initial node sends an encrypted tunnel establishment request message including a common public key, a public key, and first routing information determined by the first routing path to the target node, and receives an encrypted tunnel establishment response message including second routing information sent by the target node. In this way, while negotiating the symmetric key, the first routing path that can transmit data at the fastest speed between the initial node and the target node is determined. Based on the negotiated symmetric key, the first routing information and the second routing information, encrypted transmission of the flash sale data is performed with the target node. This allows the flash sale data to be transmitted according to the previously determined routing path with the fastest transmission speed, thereby ensuring both the transmission speed and security of the flash sale data.

[0114] In one embodiment, Figure 4 As shown, the above step S206, based on the negotiated symmetric key, the first routing information and the second routing information, performs encrypted transmission of the flash sale data with the target node, including:

[0115] Step S401: Determine corresponding first flash sale transaction data according to the user's flash sale request for a financial product.

[0116] In this step, when the second flash sale data processing participant in the flash sale data processing group organizes a flash sale activity for a financial product, the first flash sale data processing participant in the flash sale data processing group can receive a flash sale request for the financial product sent by the user and determine the corresponding first flash sale transaction data based on the flash sale request for the financial product.

[0117] For example, the node of the first flash sale data processing participant can determine the user's corresponding flash sale qualification certificate based on the user's financial product flash sale request, and further generate a transaction unique identifier, a contract unique identifier and call parameters to assemble into a transaction message, call the smart contract transaction to calculate the result, and use it as the first flash sale transaction data.

[0118] Step S402: Encrypt the flash sale transaction data using the negotiated symmetric key to obtain encrypted first flash sale transaction data, and transmit the encrypted first flash sale transaction data to the node of the second flash sale data processing participant according to the data transmission message format of the preset encryption tunnel protocol and the first routing information.

[0119] In this step, the first flash sale data processing participant may use the symmetric key negotiated with the second flash sale data processing participant during the encryption tunnel establishment process to encrypt the first flash sale transaction data obtained in the previous step, thereby obtaining encrypted first flash sale transaction data. The first flash sale data processing participant may then transmit the encrypted first flash sale transaction data to the second flash sale data processing participant via the first routing path corresponding to the first routing information, in accordance with the data transmission message format of the preset encryption tunnel protocol.

[0120] For example, P represents the data packet of the encrypted first flash sale transaction data to be transmitted, ||P|| represents the length of the data packet P, and the data transmission message format can be expressed as follows:

[0121]

[0122] The IP header represents a data packet header, the first routing information may include Next hop, type=0x4 may represent a communication transmission message, counter represents "salt" information, and P is defined as follows:

[0123] P:=P||0 16.[||P|| / 16]-||P||

[0124]

[0125] Among them, AEAD is the calculation formula of the ChaCha20-Poly1305 algorithm. Represents the symmetric key for sending data, Indicates the random number counter used to send transmission data messages.

[0126] Step S403: Receive the encrypted first flash sale result data sent by the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted first flash sale result data is obtained by encrypting the first flash sale result data corresponding to the first flash sale transaction data by the node of the second flash sale data processing participant according to the negotiated symmetric key.

[0127] In this step, the node of the first flash sale data processing participant may receive the encrypted first flash sale result data sent by the node of the second flash sale data processing participant.

[0128] Among them, the encrypted first flash sale result data can be obtained by the second flash sale data processing participant determining the corresponding first flash sale result data based on the received first flash sale transaction data, and encrypting the first flash sale result using the negotiated symmetric key, and the node of the second flash sale data processing participant is transmitted to the node of the first flash sale data processing participant via the second routing path corresponding to the second routing information in accordance with the data transmission message format of the preset encryption tunnel protocol.

[0129] Step S404: Obtain the first flash sale result data according to the negotiated symmetric key and the encrypted first flash sale result data.

[0130] In this step, the first flash sale data processing participant can use the negotiated symmetric key to decrypt the encrypted first flash sale result data to obtain the first flash sale result data.

[0131] This embodiment enables the node of the first flash sale data processing party to send data to the node of the second flash sale data processing party at the fastest speed along the first routing path after receiving a user's flash sale request for a financial product. It also receives data sent by the node of the second flash sale data processing party at the fastest speed along the second routing path, effectively increasing the transmission speed of flash sale data. Furthermore, during this process, all transmitted data is encrypted with a symmetric key, effectively ensuring the security of data transmission.

[0132] In one embodiment, in the above step S401, before determining the corresponding first flash sale transaction data based on the user's financial product flash sale request, it also includes: determining the flash sale filtering conditions corresponding to the financial product flash sale activity based on the configuration parameters of the financial product flash sale activity synchronized from the financial alliance chain; receiving the financial product flash sale request submitted by the user in the financial product flash sale activity that meets the flash sale filtering conditions.

[0133] Specifically, before launching a flash sale, the organizer, the second flash sale data processing participant, can pre-set configuration parameters for the financial product flash sale and synchronize these parameters with all flash sale data processing participants in the flash sale data processing group via the financial alliance chain. These configuration parameters may include flash sale start and end times, flash sale quotas, flash sale concurrency parameters, flash sale qualification parameters, maximum number of connections, and timeout periods.

[0134] The first flash sale data processing participant in the flash sale data processing group can determine the flash sale filtering conditions applied to its own node based on the configuration parameters of the financial product flash sale activities synchronized from the financial alliance chain, and filter the financial product flash sale requests submitted by users according to the set flash sale filtering conditions during the flash sale activities, and only accept the parts that meet the flash sale filtering conditions.

[0135] This embodiment determines the corresponding flash sale filtering conditions based on the configuration parameters of the financial product flash sale activity, and applies the filtering conditions to filter the requests submitted by the user. It can limit the user's flash sale requests based on the actual situation of the financial product flash sale activity, and avoid receiving requests that exceed the flash sale data processing capacity of this financial product flash sale activity.

[0136] In one embodiment, the above steps determine the flash sale filtering conditions corresponding to the financial product flash sale activity based on the configuration parameters of the financial product flash sale activity synchronized from the financial alliance chain, including: determining the flash sale inventory quota and the flash sale concurrency parameters based on the configuration parameters of the financial product flash sale activity; setting the flash sale filtering conditions based on the token bucket algorithm based on the flash sale concurrency parameters and the flash sale inventory quota; the above steps receive the financial product flash sale request submitted by the user in the financial product flash sale activity that meets the flash sale filtering conditions, including: using the flash sale filtering conditions to limit the user's access traffic in the financial product flash sale activity, and receiving the financial product flash sale request that meets the flash sale filtering conditions; the above steps determine the corresponding first flash sale transaction data based on the user's financial product flash sale request, including: matching the financial product flash sale request that meets the flash sale filtering conditions with the flash sale inventory quota, and generating a flash sale qualification certificate corresponding to the user; and obtaining the first flash sale transaction data based on the flash sale qualification certificate and the financial product flash sale request.

[0137] In this embodiment, taking into account the situation in which a large number of users may submit flash sale requests in a short period of time during a flash sale activity for financial products, access traffic is restricted by setting flash sale filtering conditions based on a token bucket algorithm.

[0138] Specifically, the first flash sale data processing participant can determine the flash sale inventory quota and flash sale concurrency parameters for the financial product flash sale based on the configuration parameters of the financial product flash sale. The participant can then set the parameters of the token bucket algorithm based on the flash sale inventory quota and the flash sale concurrency parameters, and further set flash sale filtering conditions based on the token bucket algorithm. Specifically, the total number of tokens can be set based on the flash sale inventory quota, and the token bucket capacity can be set based on the flash sale concurrency parameters.

[0139] Therefore, in a flash sale activity, the node of the first flash sale data processing participant can use the above-mentioned flash sale filtering conditions to filter the flash sale requests submitted by users. The token bucket capacity set according to the flash sale concurrency parameters can limit the instantaneous traffic threshold of the flash sale requests submitted by users, thereby preventing the node from being impacted by a huge amount of flash sale request data; and the total number of tokens is set according to the flash sale inventory quota. When the total number of flash sale requests is greater than the flash sale inventory quota, the flash sale requests are blocked. Then, each of the flash sale requests can be filtered, and valid flash sale requests that meet the preset flash sale inventory quota are retained.

[0140] Furthermore, for financial product flash sale requests that meet the flash sale filtering conditions, the node of the first flash sale data processing participant can match them with the flash sale inventory quotas one by one, bind the user corresponding to the financial product flash sale request with the inventory quota that matches the flash sale request, generate a flash sale qualification certificate corresponding to the user, and further obtain the corresponding first flash sale transaction data based on the flash sale qualification certificate and the financial product flash sale request.

[0141] This embodiment filters flash sale requests through flash sale filtering conditions based on the token bucket algorithm, which can limit the instantaneous traffic of user access, maintain the normal operation of this node, and avoid receiving flash sale requests that exceed the flash sale inventory quota, thereby ensuring the normal development of flash sale activities.

[0142] In one embodiment, Figure 5 As shown, the above step S206, based on the negotiated symmetric key, the first routing information and the second routing information, performs encrypted transmission of the flash sale data with the target node, including:

[0143] Step S501: Receive the encrypted second flash sale transaction data sent by the node of the second flash sale data processing participant according to the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted second flash sale transaction data is obtained by the node of the second flash sale data processing participant encrypting the second flash sale transaction data according to the negotiated symmetric key.

[0144] Step S502: Obtain the second flash sale transaction data according to the symmetric key and the encrypted second flash sale transaction data.

[0145] In steps S501 and S502, the first flash sale data processing participant, acting as the organizer of a financial product flash sale event, may receive encrypted second flash sale transaction data transmitted by a second flash sale data processing participant. The second flash sale data processing participant may receive a user's flash sale request for a financial product during the financial product flash sale event, determine the corresponding second flash sale transaction data based on the request, and then encrypt the second flash sale transaction data using the symmetric key negotiated with the first flash sale data processing participant during the encryption tunnel establishment process to obtain the encrypted second flash sale transaction data. The second flash sale data processing participant may then transmit the encrypted second flash sale transaction data to the first flash sale data processing participant via the second routing path corresponding to the second routing information in accordance with the data transmission message format of the preset encryption tunnel protocol.

[0146] After receiving the encrypted second flash sale transaction data, the first flash sale data processing participant can use the negotiated symmetric key to decrypt it and obtain the second flash sale transaction data.

[0147] Step S503: determining second flash sale result data corresponding to the second flash sale transaction data according to preset parameters of the financial product flash sale activity corresponding to the second flash sale transaction data.

[0148] In this step, the first flash sale data processing participant can preset the corresponding financial product flash sale activity parameters in the server node before organizing the financial product flash sale activity, so that after decrypting the second flash sale transaction data, the corresponding second flash sale result data can be determined according to the corresponding financial product flash sale activity parameters.

[0149] Exemplarily, the node of the first flash sale data processing participant can obtain content such as financial product flash sale requests, user flash sale qualification certificates, etc. in the second flash sale transaction data, and store the user's flash sale qualification certificates. Then, based on the financial product flash sale activity parameters corresponding to the second flash sale transaction data preset in this node, such as the financial product name, price, type, etc., a reserved order for the corresponding user can be generated, and the reserved order can be settled to generate a corresponding settlement order. The reserved order can include the financial product name, price, type, flash sale time, financial product reservation number, etc., and the settlement order can include the financial product name, price, type, flash sale time, settlement time, financial product order number, etc. The node of the first flash sale data processing participant can further obtain the corresponding second flash sale result data based on the settlement order.

[0150] Step S504: Encrypt the second flash sale result data using the negotiated symmetric key to obtain encrypted second flash sale result data, and transmit the encrypted second flash sale result data to the node of the second flash sale data processing participant according to the data transmission message format of the preset encryption tunnel protocol and the first routing information.

[0151] In this step, the node of the first flash sale data processing participant may encrypt the second flash sale result data obtained in the previous step using the negotiated symmetric key to obtain encrypted second flash sale result data. The encrypted second flash sale result data is then transmitted to the node of the second flash sale data processing participant via the first routing path corresponding to the first routing information in accordance with the data transmission message format of the preset encryption tunnel protocol.

[0152] This embodiment enables the first flash sale data processing participant who organizes a financial product flash sale activity to receive the encrypted second flash sale transaction data at the fastest speed, and after obtaining the corresponding second flash sale result data, send the encrypted second flash sale result data to the second flash sale data processing participant at the fastest speed. This process can ensure the secure and rapid transmission of flash sale data.

[0153] In one embodiment, the above-mentioned flash sale data processing method based on the financial alliance chain also includes: obtaining first routing information corresponding to the first routing path according to a dynamic routing table stored on the financial alliance chain; the dynamic routing table includes the first routing path dynamically updated by the ant colony optimization algorithm.

[0154] In this embodiment, before the initial node sends an encrypted tunnel establishment request message to the target node, the initial node can obtain first routing information corresponding to the first routing path from the initial node to the target node from a dynamic routing table stored on the financial alliance chain. Specifically, the dynamic routing table can include routing information corresponding to the optimal routing path between each participant in the flash sale data processing group. Thus, when any flash sale data processing participant in the flash sale data processing group needs to transmit data to another participant, the corresponding first routing information can be determined from the dynamic routing table.

[0155] The routing information corresponding to the optimal routing path for each pair of initial nodes and target nodes stored in the dynamic routing table can be dynamically updated. Specifically, in this embodiment, the routing path between each pair of initial nodes and target nodes can be detected and calculated in real time using an ant colony optimization algorithm, and the optimal routing path that enables the initial node to transmit data to the target node at the fastest speed can be determined. Taking initial node a and target node b as an example, in this embodiment, the optimal routing path determined by the ant colony optimization algorithm may include:

[0156] Step S601: Initialize the parameters of the ant colony optimization algorithm. Set the initial node to a and the target node to b. Each routing process between the initial node and the target node is considered an ant colony. For each ant colony k (k∈[1,n]), loop through the state transition rules.

[0157] Step S602: For each ant colony k, add an initialization state transition rule for each path search process (ant colony). The state transition rule is defined as follows:

[0158]

[0159] Among them, ant colony k is a routing path search process from the initial node a to the target node b, τ represents pheromone, μ = 1 / δ represents the inverse of the path distance δ(a, b) between a and b, J k (r) is the set of nodes that can be selected by ant colony k (from a to b), β is a parameter that determines the relative importance of pheromone and distance, and usually β>0.

[0160] Step S603: updating pheromones for each ant colony.

[0161] For all ant colonies k (k∈[1,n]), the pheromone number is updated cyclically. The specific method of updating pheromone is: according to the path distance L k And pheromone "concentration" updates pheromone τ, and the pheromone update rule is as follows:

[0162]

[0163] in:

[0164]

[0165] In the above formula, 0<α<1 represents the pheromone attenuation factor, L k represents the length of the path traveled by ant colony k, and m represents the number of ant colonies.

[0166] Step S604: Execute the optimization path selection function to select the optimal path. The following operations are performed: According to the "concentration" of pheromone, select the best path s:

[0167]

[0168] Where q is a random number distributed in [0...1], q0 (0≤q0≤1) is a constant parameter, and S is a randomly selected variable that follows the state transition rule.

[0169] Step S605: Collect the optimized combined path nodes and update the corresponding routing information in the dynamic routing table.

[0170] It is understandable that each time a flash sale data processing participant in the flash sale data processing group transmits data, it can obtain the updated first routing information from the dynamic routing table and transmit data according to the corresponding first routing path.

[0171] This embodiment uses an ant colony optimization algorithm to perform real-time calculations on the optimal routing paths in the flash sale data processing group and dynamically updates the routing information in the dynamic routing table. As a result, when transmitting data, the flash sale data processing participants in the flash sale data processing group can obtain the current optimal routing path through the dynamic routing table stored on the financial alliance chain, effectively ensuring the rapid transmission of data.

[0172] To further illustrate the present invention's flash sale data processing method based on the financial alliance chain, the following describes it through a specific embodiment. Specifically, the method may include the following steps:

[0173] Step S701: A flash sale data processing participant joins a flash sale data processing group based on a financial alliance chain, and obtains the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant.

[0174] In step S702, the second flash sale data processing participant that organizes the flash sale activity in the flash sale data processing group prepares the financial product flash sale activity in advance, determines the configuration parameters and parameters of the financial product flash sale activity, and synchronizes the configuration parameters of the financial product flash sale activity to the nodes of each flash sale data processing participant in the flash sale data processing group through the financial alliance chain.

[0175] In step S703, after the flash sale begins, the user submits a flash sale transaction request to the first flash sale data processing participant on the user terminal. New users who wish to participate in a flash sale on a financial product can apply to join the financial alliance chain through their user terminal. After verification, the initialization process is completed and the key is downloaded to the user terminal.

[0176] In step S704, the node of the first flash sale data processing participant sets the flash sale filtering conditions based on the token bucket algorithm according to the configuration parameters of the financial product flash sale activity, receives financial product flash sale requests that meet the flash sale filtering conditions, and matches each financial product flash sale request with each inventory quota one by one, generates the user's corresponding flash sale qualification certificate, and further obtains the corresponding first flash sale transaction data.

[0177] In step S705, the node of the first flash sale data processing participant uses itself as the initial node and the node of the second flash sale data processing participant as the target node, and obtains first routing information corresponding to a first routing path from the dynamic routing table stored on the financial alliance chain. The first routing path is dynamically updated by an ant colony optimization algorithm, which can ensure that the data of the initial node is transmitted to the target node as quickly as possible.

[0178] In step S706, the node of the first flash sale data processing participant sends an encrypted tunnel establishment request message including the common public key, the public key, and the first routing information to the node of the second flash sale data processing participant. The encrypted tunnel establishment request message may be transmitted along the first routing path.

[0179] In step S707, the node of the first flash sale data processing participant receives an encrypted tunnel establishment response message including second routing information, sent by the node of the second flash sale data processing participant. The encrypted tunnel establishment response message may be transmitted via a second routing path corresponding to the second routing information, and the second routing information may be obtained by the node of the second flash sale data processing participant from a dynamic routing table. The node of the first flash sale data processing participant and the node of the second flash sale data processing participant negotiate a symmetric key based on the encrypted tunnel establishment request message and the encrypted tunnel establishment response message.

[0180] In step S708, the node of the first flash sale data processing participant encrypts the first flash sale transaction data according to the negotiated symmetric key to obtain the encrypted first flash sale transaction data, and transmits the encrypted first flash sale transaction data to the node of the second flash sale data processing participant via the first routing path in accordance with the data transmission message format of the preset encryption tunnel protocol and the first routing information.

[0181] In step S709, the node of the second flash sale data processing participant uses the negotiated symmetric key to decrypt the encrypted first flash sale transaction data to obtain the first flash sale transaction data, and determines the first flash sale result data corresponding to the first flash sale transaction data based on the financial product flash sale activity parameters preset in this node.

[0182] In step S710, the node of the second flash sale data processing participant encrypts the first flash sale result data according to the negotiated symmetric key to obtain the encrypted first flash sale result data, and transmits the encrypted first flash sale result data to the node of the first flash sale data processing participant via the second routing path in accordance with the data transmission message format of the preset encryption tunnel protocol and the second routing information.

[0183] In step S711, the node of the first flash sale data processing participant decrypts the encrypted first flash sale result data according to the negotiated symmetric key to obtain the first flash sale result data, and sends the first flash sale result data to the user terminal of the user.

[0184] The solution of this embodiment conducts flash sale activities for financial products through a flash sale data processing group based on the financial alliance chain, allowing users to conduct flash sale transactions of financial products across financial institutions. By setting flash sale filtering conditions to filter flash sale requests submitted by users, access traffic is effectively controlled. The time consumption of secure communication during the flash sale data processing process is shortened through dynamically updated routing information. The flash sale data is transmitted through an encrypted tunnel, effectively ensuring the security of flash sale data transmission.

[0185] It should be understood that, although the various steps in the flowcharts involved in the various embodiments described above are displayed in sequence according to the instructions of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowcharts involved in the various embodiments described above can include multiple steps or multiple stages, and these steps or stages are not necessarily executed and completed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of steps or stages in other steps.

[0186] Based on the same inventive concept, the embodiments of the present application also provide a device for processing flash sale data based on a financial alliance chain, which is used to implement the aforementioned method for processing flash sale data based on a financial alliance chain. The implementation solution provided by this device is similar to the implementation solution described in the aforementioned method. Therefore, the specific limitations of one or more embodiments of the device for processing flash sale data based on a financial alliance chain provided below can be found in the above-mentioned limitations of the method for processing flash sale data based on a financial alliance chain, and will not be repeated here.

[0187] In one embodiment, Figure 6 As shown, a flash sale data processing device 800 based on a financial alliance chain is provided, comprising:

[0188] The group joining module 801 is used to join a flash sale data processing group based on the financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; and the system of each flash sale data processing participant corresponds to a node of the financial alliance chain.

[0189] The public key acquisition module 802 is used to obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant.

[0190] The path determination module 803 is used to determine a first routing path from an initial node to a target node; the first routing path enables the data of the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group.

[0191] The request sending module 804 is used to send an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key and the first routing information; the first routing information is determined according to the first routing path.

[0192] The response receiving module 805 is used to receive the encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message includes second routing information; the second routing information is determined according to the second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message are used by the initial node and the target node to negotiate a symmetric key.

[0193] The flash sale transmission module 806 is configured to perform encrypted transmission of the flash sale data with the target node based on the negotiated symmetric key, the first routing information, and the second routing information.

[0194] In one embodiment, the above-mentioned flash sale transmission module 806 is also used to determine the corresponding first flash sale transaction data based on the user's financial product flash sale request; encrypt the flash sale transaction data according to the negotiated symmetric key to obtain encrypted first flash sale transaction data, and transmit the encrypted first flash sale transaction data to the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the first routing information; receive the encrypted first flash sale result data sent by the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted first flash sale result data is obtained by the node of the second flash sale data processing participant encrypting the first flash sale result data corresponding to the first flash sale transaction data according to the negotiated symmetric key; and obtain the first flash sale result data according to the negotiated symmetric key and the encrypted first flash sale result data.

[0195] In one embodiment, the above-mentioned flash sale transmission module 806 is also used to determine the flash sale filtering conditions corresponding to the financial product flash sale activity based on the configuration parameters of the financial product flash sale activity synchronized from the financial alliance chain; and receive the financial product flash sale request submitted by the user in the financial product flash sale activity that meets the flash sale filtering conditions.

[0196] In one embodiment, the above-mentioned flash sale transmission module 806 is also used to determine the flash sale inventory quota and flash sale concurrency parameters based on the configuration parameters of the financial product flash sale activity; use the flash sale filtering conditions to limit the user's access traffic in the financial product flash sale activity, and receive financial product flash sale requests that meet the flash sale filtering conditions; match the financial product flash sale requests that meet the flash sale filtering conditions with the flash sale inventory quota, and generate a flash sale qualification certificate corresponding to the user; obtain the first flash sale transaction data based on the flash sale qualification certificate and the financial product flash sale request.

[0197] In one embodiment, the above-mentioned flash sale transmission module 806 is also used to receive the encrypted second flash sale transaction data sent by the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted second flash sale transaction data is obtained by the node of the second flash sale data processing participant encrypting the second flash sale transaction data according to the negotiated symmetric key; the second flash sale transaction data is obtained according to the symmetric key and the encrypted second flash sale transaction data; the second flash sale result data corresponding to the second flash sale transaction data is determined according to the preset financial product flash sale activity parameters corresponding to the second flash sale transaction data; the second flash sale result data is encrypted according to the negotiated symmetric key to obtain the encrypted second flash sale result data, and the encrypted second flash sale result data is transmitted to the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the first routing information.

[0198] In one embodiment, the above-mentioned device also includes a routing path acquisition module, which is used to obtain the first routing information corresponding to the first routing path based on the dynamic routing table stored on the financial alliance chain; the dynamic routing table includes the first routing path dynamically updated by the ant colony optimization algorithm.

[0199] In one embodiment, the above-mentioned group joining module 801 is also used to generate a first key based on a selected first security parameter; send the first key to the node of the manager of the financial alliance chain; receive a second security parameter returned by the node of the manager; the second security parameter is selected and returned by the node of the manager after checking the legitimacy of the first key; generate a second key based on the second security parameter and the first security parameter; send the second key to the node of the manager; receive a signature certificate returned by the node of the manager; the signature certificate is generated and returned by the node of the manager after checking the legitimacy of the second key; when the verification of the signature certificate is passed, join the flash sale data processing group based on the financial alliance chain.

[0200] Each module in the aforementioned flash sale data processing device based on the financial alliance chain can be implemented in whole or in part through software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in the computer device in the form of software, so that the processor can call and execute the corresponding operations of each module.

[0201] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 7 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, abbreviated as I / O) and a communication interface. The processor, memory and input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the computer device is used to store data such as flash sale data and configuration parameters of flash sale activities. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a flash sale data processing method based on a financial alliance chain is implemented.

[0202] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0203] In one embodiment, a computer device is further provided, including a memory and a processor. The memory stores a computer program, and the processor implements the steps in the above method embodiments when executing the computer program.

[0204] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0205] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

[0206] 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.

[0207] 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.

[0208] 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 flash sale data processing method based on a financial alliance chain, characterized in that: The method comprises: Join a flash sale data processing group based on the financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; each flash sale data processing participant's system corresponds to a node in the financial alliance chain; Obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant; Determine a first routing path from an initial node to a target node; the first routing path enables data from the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group; Sending an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key, and first routing information; the first routing information is determined according to the first routing path; receiving an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message including second routing information; the second routing information being determined based on a second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message being used by the initial node and the target node to negotiate a symmetric key; Based on the negotiated symmetric key, the first routing information, and the second routing information, encrypted transmission of the flash sale data is performed with the target node.

2. The method according to claim 1, characterized in that The encrypted transmission of the flash sale data with the target node based on the negotiated symmetric key, the first routing information, and the second routing information includes: Determine the corresponding first flash sale transaction data based on the user's request for a flash sale of a financial product; Encrypting the flash sale transaction data using the negotiated symmetric key to obtain encrypted first flash sale transaction data, and transmitting the encrypted first flash sale transaction data to a node of the second flash sale data processing participant according to a data transmission message format of a preset encryption tunnel protocol and the first routing information; Receiving the encrypted first flash sale result data sent by the node of the second flash sale data processing participant in accordance with the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted first flash sale result data is obtained by the node of the second flash sale data processing participant encrypting the first flash sale result data corresponding to the first flash sale transaction data using the negotiated symmetric key; The first flash sale result data is obtained according to the negotiated symmetric key and the encrypted first flash sale result data.

3. The method according to claim 2, characterized in that Before determining the first flash sale transaction data corresponding to the user's flash sale request for a financial product, the method further includes: Determine, based on the configuration parameters of the financial product flash sale activity synchronized from the financial alliance chain, a flash sale filtering condition corresponding to the financial product flash sale activity; Receive a financial product flash sale request submitted by a user in the financial product flash sale activity that meets the flash sale filtering conditions.

4. The method according to claim 3, characterized in that The determining of the flash sale filtering conditions corresponding to the financial product flash sale activity based on the configuration parameters of the financial product flash sale activity synchronized from the financial alliance chain includes: Determine the flash sale inventory quota and flash sale concurrency parameters based on the configuration parameters of the financial product flash sale activity; According to the flash sale concurrency parameter and the flash sale inventory quota, setting a flash sale filtering condition based on a token bucket algorithm; The receiving of a financial product flash sale request submitted by a user in the financial product flash sale activity that meets the flash sale filtering conditions includes: Using the flash sale filtering conditions to limit the user's access traffic in the financial product flash sale activity, and receiving financial product flash sale requests that meet the flash sale filtering conditions; The determining, based on the user's request for a flash sale of a financial product, corresponding first flash sale transaction data includes: Matching the flash sale request for a financial product that meets the flash sale filtering conditions with the flash sale inventory quota to generate a flash sale qualification certificate corresponding to the user; and acquiring the first flash sale transaction data based on the flash sale qualification certificate and the financial product flash sale request.

5. The method according to claim 1, wherein The encrypted transmission of the flash sale data with the target node based on the negotiated symmetric key, the first routing information, and the second routing information includes: Receiving the encrypted second flash sale transaction data sent by the node of the second flash sale data processing participant according to the data transmission message format of the preset encryption tunnel protocol and the second routing information; the encrypted second flash sale transaction data is obtained by the node of the second flash sale data processing participant encrypting the second flash sale transaction data according to the negotiated symmetric key; Obtaining the second flash sale transaction data according to the symmetric key and the encrypted second flash sale transaction data; Determining second flash sale result data corresponding to the second flash sale transaction data based on preset financial product flash sale activity parameters corresponding to the second flash sale transaction data; The second flash sale result data is encrypted according to the negotiated symmetric key to obtain encrypted second flash sale result data, and the encrypted second flash sale result data is transmitted to the node of the second flash sale data processing participant according to the data transmission message format of the preset encryption tunnel protocol and the first routing information.

6. The method according to claim 1, characterized in that The method further comprises: The first routing information corresponding to the first routing path is obtained according to the dynamic routing table stored on the financial alliance chain; the dynamic routing table includes the first routing path dynamically updated by the ant colony optimization algorithm.

7. The method according to any one of claims 1 to 6, characterized in that Joining the flash sale data processing group based on the financial alliance chain includes: generating a first key according to the selected first security parameter; Sending the first key to the node of the manager of the financial alliance chain; Receiving a second security parameter returned by the management node; the second security parameter is selected and returned by the management node after checking the legitimacy of the first key; generating a second key according to the second security parameter and the first security parameter; Sending the second key to the node of the management party; Receiving a signature certificate returned by the node of the management party; the signature certificate is generated and returned by the node of the management party after checking the legitimacy of the second key; When the verification of the signature certificate is passed, the user will join the flash sale data processing group based on the financial alliance chain.

8. A flash sale data processing device based on a financial alliance chain, characterized in that: The device comprises: A group joining module, configured to join a flash sale data processing group based on a financial alliance chain; the flash sale data processing group includes at least three flash sale data processing participants; each flash sale data processing participant's system corresponds to a node in the financial alliance chain; A public key acquisition module, used to obtain the common public key of the financial alliance chain and the public key of the node of the first flash sale data processing participant; a path determination module, configured to determine a first routing path from an initial node to a target node; the first routing path enables data from the initial node to be transmitted to the target node at the fastest speed; the initial node is a node of a first flash sale data processing participant, and the target node is a node of a second flash sale data processing participant in the flash sale data processing group; a request sending module, configured to send an encrypted tunnel establishment request message to the target node; the encrypted tunnel establishment request message includes the common public key, the public key, and first routing information; the first routing information is determined according to the first routing path; a response receiving module, configured to receive an encrypted tunnel establishment response message sent by the target node; the encrypted tunnel establishment response message including second routing information; the second routing information being determined based on a second routing path from the target node to the initial node; the encrypted tunnel establishment request message and the encrypted tunnel establishment response message being used by the initial node and the target node to negotiate a symmetric key; The flash sale transmission module is used to encrypt and transmit the flash sale data with the target node based on the negotiated symmetric key, the first routing information and the second routing information.

9. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images