Distributed flow information processing method and device

Abstract

The present invention provides a distributed circulation information processing method and device, which receives circulation information from a source end and a path end based on the distributed storage blockchain system, wherein the circulation information uniquely corresponds to an offline physical item code; the circulation information is packaged and processed according to the unique block-producing node to form a current block, as well as a decryption private key corresponding to decoding the current block, and the current block is linked and stored; in response to a query request from a user end, the decryption private key is sent to the user end, and the circulation information of the item is stored through a distributed storage blockchain system composed of Y trusted nodes and a unique block-producing node. The user can query in real time and can easily provide evidence when pursuing accountability. In addition, the stored data cannot be tampered with and has high security.

Description

Technical Field

[0001] The present invention relates to data processing technology, and in particular to a distributed flow information processing method and device. Background Art

[0002] Under the modern market mechanism, in order to develop and occupy the market, more and more products have emerged to provide products and services to users. However, since the products are relatively scattered, once there are defects, it will usually affect the consumer experience and health.

[0003] The existing regulatory mechanism uses acceptance rules to hold people accountable, which is a point-to-point offline confirmation method. However, with this acceptance method, information is separated between users and the various handling parties, and each entity is like an information island, making it difficult to provide evidence when accountability is required.

[0004] In summary, the current regulatory mechanism has the technical problem of information islands. Summary of the Invention

[0005] The embodiments of the present invention provide a distributed flow information processing method and device, aiming to solve the above technical problems.

[0006] A first aspect of an embodiment of the present invention provides a distributed flow information processing method, including:

[0007] An election committee consisting of M nodes is randomly generated from N nodes, and a unique block-producing node is elected from the M nodes according to the election committee, where M and N are both positive integers and M is less than N;

[0008] The election committee elects Y trusted nodes from the N nodes to form a distributed storage blockchain system together with the only block-producing node, where Y is greater than M and less than N;

[0009] The distributed storage blockchain system receives the flow information of the source end and the path end, wherein the flow information uniquely corresponds to the offline physical item code;

[0010] Packaging the flow information according to the unique block-producing node to form a current block, and a corresponding decryption private key for decoding the current block, and linking and storing the current block;

[0011] In response to the query request of the user terminal, the decryption private key is sent to the user terminal.

[0012] Optionally, in a possible implementation of the first aspect, the election committee elects Y trusted nodes from the N nodes, including:

[0013] The hardware parameters of the N nodes are obtained, and Y trusted nodes are selected from the nodes that meet the preset criteria.

[0014] Optionally, in a possible implementation of the first aspect, responding to a query request from a user terminal and sending the decryption private key to the user terminal includes:

[0015] In response to the query request from the user terminal and the equity-to-chain information, the decryption private key is sent to the user terminal.

[0016] Optionally, in a possible implementation of the first aspect, the method further includes:

[0017] Based on preset allocation rules and the unique block producing node, the rights and interests are allocated to the election committee.

[0018] Optionally, in a possible implementation of the first aspect, the method further includes:

[0019] Based on a preset allocation rule and the unique block-producing node, rights and interests are allocated to the election committee and the trusted node.

[0020] Optionally, in a possible implementation of the first aspect, the method further includes:

[0021] Receiving a false certificate uploaded by a user, wherein the false certificate is used to indicate the authenticity of the flow information;

[0022] Based on the unique block-producing node, the false certificate is linked and stored.

[0023] Optionally, in a possible implementation of the first aspect, before linking and storing the false certificate based on the unique block producing node, the method further includes:

[0024] Grant verification authority to the only block-producing node;

[0025] Based on the unique block producing node, the false proof is determined to be true.

[0026] Optionally, in a possible implementation of the first aspect, granting verification authority to a unique block-producing node includes:

[0027] The verification authority is granted to a unique block-producing node based on Y trusted nodes.

[0028] A second aspect of an embodiment of the present invention provides a distributed flow information processing device, including:

[0029] A node module is configured to randomly generate an election committee consisting of M nodes from N nodes, and elect a unique block-producing node from the M nodes according to the election committee, where M and N are both positive integers and M is less than N;

[0030] An election module, configured for the election committee to select Y trusted nodes from the N nodes to form a distributed storage blockchain system together with the sole block-producing node, where Y is greater than M and less than N;

[0031] An information module, configured to receive flow information from a source end and a path end based on the distributed storage blockchain system, wherein the flow information uniquely corresponds to an offline physical item code;

[0032] A storage module, configured to package the flow information according to the unique block-producing node to form a current block, and a corresponding decryption private key for decoding the current block, and link and store the current block;

[0033] The query module is used to respond to the query request of the user terminal and send the decryption private key to the user terminal.

[0034] According to a third aspect of an embodiment of the present invention, a distributed flow information processing device is provided, comprising: a memory, a processor, and a computer program, wherein the computer program is stored in the memory, and the processor runs the computer program to execute the first aspect of the present invention and various methods that may be involved in the first aspect.

[0035] According to a fourth aspect of an embodiment of the present invention, a readable storage medium is provided, in which a computer program is stored. When the computer program is executed by a processor, it is used to implement the first aspect of the present invention and various methods that may be involved in the first aspect.

[0036] The present invention provides a distributed circulation information processing method and device, which stores the circulation information of items through a distributed storage blockchain system composed of Y trusted nodes and a unique block-producing node. Users can query it in real time and easily provide evidence when holding someone accountable. In addition, the stored data cannot be tampered with and has high security. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 This is a flow chart of a distributed flow information processing method provided by an embodiment of the present invention;

[0038] Figure 2 is a schematic diagram of multiple nodes provided by an embodiment of the present invention;

[0039] Figure 3 This is a structural diagram of a distributed flow information processing device provided by an embodiment of the present invention;

[0040] Figure 4 This is a hardware structure diagram of a distributed flow information processing device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0041] To make the objectives, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.

[0042] See also Figure 1 , is a flow chart of a distributed flow information processing method provided by an embodiment of the present invention, Figure 1 The execution subject of the method shown may be a software and / or hardware device. The execution subject of the present application may include but is not limited to at least one of the following: user equipment, network equipment, etc. Among them, user equipment may include but is not limited to computers, smart phones, personal digital assistants (PDAs) and the electronic devices mentioned above. Network equipment may include but is not limited to a single network server, a server group consisting of multiple network servers, or a cloud based on cloud computing consisting of a large number of computers or network servers, wherein cloud computing is a type of distributed computing, a super virtual computer consisting of a group of loosely coupled computers. This embodiment does not limit this. The distributed flow information processing method includes steps S101 to S105, as follows:

[0043] S101, randomly generate an election committee including M nodes from N nodes, and elect a unique block producing node from the M nodes according to the election committee, where M and N are both positive integers and M is less than N.

[0044] Understandably, see Figure 2 A blockchain has multiple nodes. This embodiment packages data into blocks by finding a unique block-producing node from these multiple nodes. First, an election committee consisting of M nodes is randomly generated. This election committee then selects a unique block-producing node from these M nodes. The unique block-producing node then packages the data. This reduces computational complexity compared to existing packaging methods and significantly improves efficiency.

[0045] In some embodiments, the election committee comprising M nodes randomly generated from N nodes may be selected according to a preset election model, which is as follows:

[0046] First, set the participating N nodes to Nodes:={node i |i=1,2,…,n},{PrivateKey i, PublicKey i} is a node i The private key and public key, seed i T It is a node i The random number generator seed proposed in round T, S i (Message):=σ(Message,PrivateKey i ) is a node i Before the random number generation algorithm starts to sign the message, {PublicKey i} i＝1，2…n Has been broadcast to each node. Each round of node i Broadcast information M i T =(Address i , seed i T , S i (seed i T ), S i (ζ T )), S i (ζ T ) is to receive M i T The node confirms M i T It is the basis for information participation in round T.

[0047] It should be noted that the above is an advance setting for this preset election model.

[0048] After the preset election model is set, in round T, each node i A binary seed of fixed length L will be proposed i T , the choice of L depends on the total number of nodes n, Each round is based on the random number ζ of this round T and {seed i T |i=1,2,…,n} Sort the nodes by the following step P1 to select the first M nodes. Then generate the random number ζ for round T+1 by step P2 T+1 , that is, the random number ζ T+1 It is the random number of T+1 rounds, and the random number of each round is a binary number of fixed length R.

[0049] It should be noted that the above is the framework of this preset election model.

[0050] It can be understood that after the above multiple rounds of random elections, the top M nodes can be selected as the election committee.

[0051] Among them, step P1 (according to the random number ζ of the current round) T Sorting Nodes) Specifically includes: each node receives and confirms the seeds proposed by all nodes i T , according to the agreed hash function Hash (the hash function Hash can be selected according to the required hash result length, and the selection range of Hash is not limited here), the length of the hash result is agreed to be a constant L h , qConstant is an arbitrary constant that can be agreed upon by the consensus network, calculated as:

[0052] GS i T :=Hash(Trunked(AppendR(ζ T ,R,seed i T ),R))

[0053] Count ＃1 (a)=number of 1s in a

[0054] Reflection((b m-1 b m-2 …b0)2)=(b0b1…b m-1 )2

[0055] Dist i T :=Count #1 (XOR(upperCR(GS i T ),Reflection(lowerCR(GS i T ))))

[0056] Among them, Trunked(s,l) is the operation of removing the leftmost l bits of the binary number s, and XOR(a,b) is the bit-by-bit exclusive OR of binary numbers a and b of the same length.

[0057] CircularRotation((b m -1b m -2…b0) 2， 1)=(b0b m -1b m -2…b1)2

[0058] CircularRotation((bm -1b m -2…b0) 2， q)

[0059] =CircularRotation(CircularRotation((b m-1 b m-2 …b0)2,q-1),1)

[0060]

[0061] AppendR(s, r, d):=LeftShift(s, r)+d

[0062] Among them, LeftShift(s,r) is the operation of shifting s left by r bits, s[a:b] is the result of intercepting s from the ath bit to the b-1th bit, and mod is the modulus function.

[0063] Finally, according to Dist i T Sort in ascending order and select the first M as the committee for the current round. If the same situation occurs, compare M i T The order of arrival at most nodes determines the sorting, and the node with the earlier average arrival time (different nodes will rebroadcast the signature of the address with higher priority) has higher priority.

[0064] Step P2 (combine the first and last digits in the order in P1 to form the random number ζ for the next round) T+1 ) specifically include:

[0065] In step P1, we record the last node in ascending order and call the corresponding generated node Last. The first node in ascending order is First. α is the mixing ratio:

[0066]

[0067] It is understandable that this step can generate the random number ζ for round T+1. T+1 .

[0068] It should be noted that this scheme uses a preset election model and adopts multiple rounds of random selection to randomly select M nodes from any N nodes as the committee. All N nodes participate in the selection process, and the selection process will not be manipulated by a small number of participants.

[0069] S102, the election committee elects Y trusted nodes from the N nodes to form a distributed storage blockchain system together with the only block-producing node, where Y is greater than M and less than N.

[0070] It can be understood that this solution forms a distributed storage blockchain system, which consists of Y trusted nodes and a unique block-producing node, and subsequent data is stored using the distributed storage blockchain system.

[0071] In practical applications, the Y trusted nodes may be selected by obtaining the hardware parameters of the N nodes and selecting the Y trusted nodes from the nodes that meet the preset criteria.

[0072] It is understandable that the nodes that do not meet the hardware requirements among the N nodes can be deleted, and Y trusted nodes can be selected from the remaining nodes that meet the hardware requirements to ensure the stability of the trusted nodes.

[0073] S103, receiving the flow information from the source end and the path end based on the distributed storage blockchain system, wherein the flow information uniquely corresponds to the offline physical item code.

[0074] It should be noted that this step uses the distributed storage blockchain system obtained in steps S101-S102 to store the flow information.

[0075] Among them, the circulation information is the circulation information of an item through the source end and the path end. The source end can be the production end of the item, and the path end can be the sales end or the resale end. If the item passes through multiple ends, it is necessary to obtain the circulation information of multiple ends.

[0076] For example, item X flows from source end A to pathway end B, and then to pathway end C. Then the flow information related to item X needs to have records of source end A, pathway end B, and pathway end C.

[0077] In practical applications, when an item is produced, it should have a corresponding code as its own unique label. For example, it can be a barcode or QR code in the existing technology, or a digital code that can be distinguished from other items.

[0078] S104: Packaging the flow information according to the unique block-producing node to form a current block and a corresponding decryption private key for decoding the current block, and linking and storing the current block.

[0079] Specifically, the distributed storage blockchain system receives the flow information and uses the elected unique block-producing node to link and store the flow information, thereby realizing the public disclosure of the flow information in the distributed storage blockchain system. On the one hand, it avoids the data storage security issues of the centralized platform, and on the other hand, it can retain the flow evidence and better prove and hold accountable.

[0080] S105 , responding to the query request of the user terminal and sending the decryption private key to the user terminal.

[0081] Specifically, the user terminal can initiate a query request to the distributed storage blockchain system. The distributed storage blockchain system responds to the query request of the user terminal and can send the decryption private key to the user terminal. The user terminal can use the received decryption private key to query the flow information.

[0082] In actual applications, when users obtain the decryption private key for querying flow information, they need to pay rights to the distributed storage blockchain system. Correspondingly, after receiving the user's query information, the distributed storage blockchain system can determine in real time whether the user has paid the rights. If paid, the decryption private key will be sent to the user end.

[0083] In some embodiments, rights and interests may also be allocated to the election committee based on preset allocation rules and the unique block-producing node, that is, rights and interests may be allocated to the election committee that has made contributions.

[0084] In other embodiments, the rights and interests may be allocated to the election committee and the trusted nodes based on preset allocation rules and the unique block-producing node, that is, the rights and interests may be allocated to the election committee and the trusted nodes that have made contributions.

[0085] In actual applications, some ports may upload false flow information for fraudulent purposes. To monitor this, the distributed flow information processing method also includes:

[0086] Receiving a false certificate uploaded by a user, wherein the false certificate is used to indicate the authenticity of the flow information;

[0087] Based on the unique block-producing node, the false certificate is linked and stored.

[0088] It is understandable that when a user discovers that a port is falsified, he or she can upload a false certificate through the user terminal to indicate the authenticity of the flow information, and then use the only block-producing node to link and store the false certificate, that is, perform an on-chain storage operation.

[0089] In some embodiments, in order to ensure that the uploaded false certificate is authentic and to prevent malicious uploading by the user, this embodiment further includes granting verification authority to the unique block-producing node before linking and storing the false certificate based on the unique block-producing node, and determining that the false certificate is true based on the unique block-producing node.

[0090] It is understandable that the only block producing node can verify the false proof and ensure that the false proof is true before uploading it. Among them, the only block producing node can be given verification authority based on Y trusted nodes.

[0091] See also Figure 3, is a schematic diagram of the structure of a distributed flow information processing device provided by an embodiment of the present invention, the distributed flow information processing device comprising:

[0092] A node module is configured to randomly generate an election committee consisting of M nodes from N nodes, and elect a unique block-producing node from the M nodes according to the election committee, where M and N are both positive integers and M is less than N;

[0093] An election module, configured for the election committee to select Y trusted nodes from the N nodes to form a distributed storage blockchain system together with the sole block-producing node, where Y is greater than M and less than N;

[0094] An information module, configured to receive flow information from a source end and a path end based on the distributed storage blockchain system, wherein the flow information uniquely corresponds to an offline physical item code;

[0095] A storage module, configured to package the flow information according to the unique block-producing node to form a current block, and a corresponding decryption private key for decoding the current block, and link and store the current block;

[0096] The query module is used to respond to the query request of the user terminal and send the decryption private key to the user terminal.

[0097] Figure 3 The apparatus of the embodiment shown can be used to perform Figure 1 The implementation principles and technical effects of the steps in the method embodiment shown are similar and will not be repeated here.

[0098] See also Figure 4 , is a hardware structure diagram of a distributed flow information processing device provided by an embodiment of the present invention, the distributed flow information processing device 40 includes: a processor 41, a memory 42 and a computer program; wherein

[0099] The memory 42 is used to store the computer program, which may also be a flash memory. The computer program is, for example, an application program or a functional module for implementing the above method.

[0100] The processor 41 is configured to execute the computer program stored in the memory to implement the various steps performed by the device in the above method. For details, please refer to the relevant description in the above method embodiment.

[0101] Optionally, the memory 42 may be independent or integrated with the processor 41 .

[0102] When the memory 42 is a device independent of the processor 41, the device may further include:

[0103] The bus 43 is used to connect the memory 42 and the processor 41 .

[0104] The present invention also provides a readable storage medium, in which a computer program is stored. When the computer program is executed by a processor, it is used to implement the methods provided in the various embodiments described above.

[0105] Among them, the readable storage medium can be a computer storage medium or a communication medium. Communication media include any medium that facilitates the transmission of computer programs from one place to another. Computer storage media can be any available medium that can be accessed by a general-purpose or special-purpose computer. For example, a readable storage medium is coupled to a processor so that the processor can read information from the readable storage medium and write information to the readable storage medium. Of course, the readable storage medium can also be an integral part of the processor. The processor and the readable storage medium can be located in an application-specific integrated circuit (ASIC). In addition, the ASIC can be located in a user device. Of course, the processor and the readable storage medium can also exist in a communication device as discrete components. The readable storage medium can be a read-only memory (ROM), a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device, etc.

[0106] The present invention also provides a program product, which includes execution instructions stored in a readable storage medium. At least one processor of a device can read the execution instructions from the readable storage medium, and at least one processor executes the execution instructions so that the device implements the methods provided in the various embodiments described above.

[0107] In the embodiments of the above-mentioned devices, it should be understood that the processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), etc. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the method disclosed in the present invention may be directly implemented by a hardware processor or implemented by a combination of hardware and software modules in the processor.

[0108] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the above embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A distributed flow information processing method, characterized in that: include: An election committee consisting of M nodes is randomly generated from N nodes, and a unique block-producing node is elected from the M nodes according to the election committee, where M and N are both positive integers and M is less than N; The election committee elects Y trusted nodes from the N nodes to form a distributed storage blockchain system together with the only block-producing node, where Y is greater than M and less than N; The distributed storage blockchain system receives the flow information of the source end and the path end, wherein the flow information uniquely corresponds to the offline physical item code; Packaging the flow information according to the unique block-producing node to form a current block, and a corresponding decryption private key for decoding the current block, and linking and storing the current block; Allocate equity to the election committee and the trusted node based on preset allocation rules and the unique block-producing node; Receive a false certificate uploaded by a user, the false certificate being used to indicate the authenticity of the flow information; grant verification authority to a unique block-producing node based on Y trusted nodes; and determine, based on the unique block-producing node, that the false certificate is true; Based on the unique block producing node, the false certificate is linked and stored; In response to the query request from the user terminal and the equity-to-chain information, the decryption private key is sent to the user terminal.

2. The method according to claim 1, characterized in that The election committee elects Y trusted nodes from the N nodes, including: The hardware parameters of the N nodes are obtained, and Y trusted nodes are selected from the nodes that meet the preset criteria.

3. A distributed flow information processing device, used to implement the method according to any one of claims 1 to 2; characterized in that: include: A node module is configured to randomly generate an election committee consisting of M nodes from N nodes, and elect a unique block-producing node from the M nodes according to the election committee, where M and N are both positive integers and M is less than N; An election module, configured for the election committee to select Y trusted nodes from the N nodes to form a distributed storage blockchain system together with the sole block-producing node, where Y is greater than M and less than N; An information module, configured to receive flow information from a source end and a path end based on the distributed storage blockchain system, wherein the flow information uniquely corresponds to an offline physical item code; A storage module, configured to package the flow information according to the unique block-producing node to form a current block, and a corresponding decryption private key for decoding the current block, and link and store the current block; The query module is used to respond to the query request of the user terminal and send the decryption private key to the user terminal.

4. A readable storage medium, characterized in that The readable storage medium stores a computer program, which is used to implement the method according to any one of claims 1 to 2 when executed by a processor.

Images