CN113922993B - Distributed acquisition data control method and device - Google Patents
Distributed acquisition data control method and device Download PDFInfo
- Publication number
- CN113922993B CN113922993B CN202111113147.8A CN202111113147A CN113922993B CN 113922993 B CN113922993 B CN 113922993B CN 202111113147 A CN202111113147 A CN 202111113147A CN 113922993 B CN113922993 B CN 113922993B
- Authority
- CN
- China
- Prior art keywords
- nodes
- private key
- online
- user
- round
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 52
- 238000011156 evaluation Methods 0.000 claims abstract description 55
- 230000007246 mechanism Effects 0.000 claims abstract description 14
- 238000012856 packing Methods 0.000 claims abstract description 7
- 230000004044 response Effects 0.000 claims abstract description 6
- 238000012795 verification Methods 0.000 claims description 16
- 238000012545 processing Methods 0.000 claims description 8
- 238000004806 packaging method and process Methods 0.000 claims description 6
- 230000008901 benefit Effects 0.000 claims description 4
- 238000004590 computer program Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 238000007726 management method Methods 0.000 description 4
- 230000001174 ascending effect Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000013500 data storage Methods 0.000 description 2
- 230000036772 blood pressure Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
- H04L63/0807—Network architectures or network communication protocols for network security for authentication of entities using tickets, e.g. Kerberos
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
According to the distributed acquired data control method and device, acquired information of a mobile terminal is acquired, the label uniquely corresponds to an offline entity identity, the acquired information is obtained by packing acquired data of the mobile terminal according to a common mechanism through each node and is read by a private key, the acquired information is linked and stored, the private key at the upper end of the line is received, the acquired information is sent to the upper end of the line to be read, an online evaluation result at the upper end of the line is received and stored, the online evaluation result is sent to a technical scheme of the user terminal in response to a downloading request of the user terminal, a plurality of mobile terminals are connected together by using block chain nodes to form a block chain system which is communicated with each other and is used for storing data acquired by the mobile terminals, so that the user data are managed and stored in a decentralization mode, the user can control the acquired data, and meanwhile the safety of the user data can be improved.
Description
Technical Field
The present invention relates to data processing technologies, and in particular, to a distributed collected data control method and apparatus.
Background
With the development of internet of things, more and more user data are collected, and the collected user data are often used for commercial processing, so that the data which belongs to the user originally is out of control, and is gratuitously used by an operation server, and even is illegally resale.
Therefore, the user cannot control his own user data in the related art.
Disclosure of Invention
The embodiment of the invention provides a distributed acquisition data control method and device, which can enable a user to control own user data and improve the safety of the user data.
In a first aspect of an embodiment of the present invention, a distributed collected data control method is provided, including:
acquiring labeled acquisition information of a mobile terminal, wherein the label uniquely corresponds to an offline entity identity, and the acquisition information is obtained by packing acquisition data of the mobile terminal by each node according to a consensus mechanism and is read by a private key;
performing link storage on the acquired information;
receiving a private key at the upper end of the line, and sending the acquired information to the upper end of the line for reading;
receiving and storing an online evaluation result of the online upper end;
responding to a downloading request of a user terminal, and sending the online evaluation result to the user terminal;
wherein the consensus mechanism comprises:
randomly generating an election committee comprising M nodes from the N nodes, wherein M is less than N;
generating unique block-out nodes from M nodes based on election committee, and generating Y trusted nodes from N nodes, wherein Y is greater than M and less than N, and the unique block-out nodes and Y trusted nodes form a distributed storage block chain;
based on the unique block-out node, packaging the acquired data of the mobile terminal, and acquiring a current block of the acquired information;
and broadcasting the current block through the unique block-out node, and storing the current block and the previous block in a link way by all nodes.
Optionally, in one possible implementation manner of the first aspect, the method further includes:
receiving the token paid by the user side to the unique block-out node, and opening an acquisition channel of a private key to the user side;
and the user side acquires and controls the private key of the acquired information based on the acquisition channel.
Optionally, in a possible implementation manner of the first aspect, before the acquiring a private key that controls the collected information, the method further includes:
generating a random dynamic password and the effective time of the random dynamic password;
the private key is generated based on the random dynamic password and the validity time.
Optionally, in one possible implementation manner of the first aspect, before the receiving the private key at the upper end of the line, the method further includes:
and responding to the control request of the user terminal agreeing to the online terminal, and sending the private key of the user terminal to the online terminal.
Optionally, in a possible implementation manner of the first aspect, the acquired data includes a plurality of types;
the response to the control request of the user terminal agreeing to the online terminal, the private key of the user terminal is sent to the online terminal, including:
and responding to the control request of the online end agreed by the user end, and sending the private key of the type corresponding to the user end to the online end.
Optionally, in one possible implementation manner of the first aspect, the method further includes:
and receiving a first comparison result uploaded by the user side based on the online evaluation result and the offline evaluation result, and storing the first comparison result in a linked mode, wherein the first comparison result is published in a whole network.
Optionally, in one possible implementation manner of the first aspect, the method further includes:
and receiving a second comparison result uploaded by the offline terminal based on the online evaluation result and the offline evaluation result, and storing the second comparison result in a linked manner, wherein the whole network is published.
Optionally, in one possible implementation manner of the first aspect, the method further includes:
performing verification processing on the first comparison result or the second comparison result to obtain a verification result;
and if the verification result indicates poor evaluation, storing the verification result in a link mode, and publishing the verification result in a whole network.
Optionally, in a possible implementation manner of the first aspect, the service side of the mobile end provides benefits to the unique out-block node.
In a second aspect of the embodiment of the present invention, there is provided a distributed acquired data control apparatus, including:
the acquisition module is used for acquiring the labeled acquisition information of the mobile terminal, wherein the label uniquely corresponds to the off-line entity identity, and the acquisition information is obtained by packing the acquisition data of the mobile terminal by each node according to a consensus mechanism and is read by a private key;
the storage module is used for storing the acquired information in a linked manner;
the private key module is used for receiving a private key at the upper end of the line and sending the acquired information to the upper end of the line for reading;
the evaluation module is used for receiving and storing an online evaluation result of the upper end of the line;
the downloading module is used for responding to a downloading request of a user terminal and sending the online evaluation result to the user terminal;
wherein the consensus mechanism comprises:
randomly generating an election committee comprising M nodes from the N nodes, wherein M is less than N;
generating unique block-out nodes from M nodes based on election committee, and generating Y trusted nodes from N nodes, wherein Y is greater than M and less than N, and the unique block-out nodes and Y trusted nodes form a distributed storage block chain;
based on the unique block-out node, packaging the acquired data of the mobile terminal, and acquiring a current block of the acquired information;
and broadcasting the current block through the unique block-out node, and storing the current block and the previous block in a link way by all nodes.
A third aspect of an embodiment of the present invention provides a distributed acquired data control apparatus, including: a memory, a processor and a computer program stored in the memory, the processor running the computer program to perform the first aspect of the invention and the methods that the first aspect may relate to.
In a fourth aspect of embodiments of the present invention, there is provided a readable storage medium having stored therein a computer program for implementing the method of the first aspect and the various possible aspects of the first aspect when executed by a processor.
According to the distributed acquired data control method and device, the plurality of mobile terminals are connected together by using the blockchain nodes to form the blockchain system communicated with each other, and the blockchain system is used for storing data acquired by the mobile terminals, so that the user data are subjected to decentralized management and storage, the user can control the acquired data without being controlled by the management of other commercial servers, and the safety of the user data can be improved.
Drawings
Fig. 1 is a schematic flow chart of a distributed collected data control method according to an embodiment of the present invention;
FIG. 2 is a block chain system architecture diagram according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a distributed collected data control device according to an embodiment of the present invention;
fig. 4 is a schematic hardware structure of a distributed acquired data control device according to an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims and in the above drawings, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein.
It should be understood that, in various embodiments of the present invention, the sequence number of each process does not mean that the execution sequence of each process should be determined by its functions and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention.
It should be understood that in the present invention, "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements that are expressly listed or inherent to such process, method, article, or apparatus.
It should be understood that in the present invention, "plurality" means two or more. "and/or" is merely an association relationship describing an association object, and means that three relationships may exist, for example, and/or B may mean: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship. "comprising A, B and C", "comprising A, B, C" means that all three of A, B, C comprise, "comprising A, B or C" means that one of the three comprises A, B, C, and "comprising A, B and/or C" means that any 1 or any 2 or 3 of the three comprises A, B, C.
It should be understood that in the present invention, "B corresponding to a", "a corresponding to B", or "B corresponding to a" means that B is associated with a, from which B can be determined. Determining B from a does not mean determining B from a alone, but may also determine B from a and/or other information. The matching of A and B is that the similarity of A and B is larger than or equal to a preset threshold value.
As used herein, "if" may be interpreted as "at … …" or "at … …" or "in response to a determination" or "in response to detection" depending on the context.
The technical scheme of the invention is described in detail below by specific examples. The following embodiments may be combined with each other, and some embodiments may not be repeated for the same or similar concepts or processes.
Referring to fig. 1, a flowchart of a distributed collected data control method according to an embodiment of the present invention is shown, where an execution body of the method shown in fig. 1 may be a software and/or hardware device. The execution bodies of the present application may include, but are not limited to, at least one of: user equipment, network equipment, etc. The user equipment may include, but is not limited to, computers, smart phones, personal digital assistants (Personal Digital Assistant, abbreviated as PDA), and the above-mentioned electronic devices. The network device may include, but is not limited to, a single network server, a server group of multiple network servers, or a cloud of a large number of computers or network servers based on cloud computing, where cloud computing is one of distributed computing, and a super virtual computer consisting of a group of loosely coupled computers. This embodiment is not limited thereto. The method comprises the steps of S101 to S105, and specifically comprises the following steps:
s101, acquiring the labeled acquisition information of the mobile terminal by the block chain system, wherein the label uniquely corresponds to the off-line entity identity, and the acquisition information is obtained by packing the acquisition data of the mobile terminal by each node according to a consensus mechanism and is read by a private key.
Specifically, referring to fig. 2, in this embodiment, a plurality of mobile terminals are connected together by using a blockchain node to form a blockchain system that communicates with each other, and is used to store data collected by the mobile terminals, so as to implement decentralized management and storage of user data, so that a user can control the collected data of the user without being controlled by management of other commercial servers.
Each off-line entity identity can be provided with a mobile terminal, user data are collected to form collected data, then the collected data are packaged to form collected information, the collected information is uploaded to a blockchain system for storage, and a subsequent user can read by using the obtained private key.
Wherein the consensus mechanism comprises:
randomly generating an election committee comprising M nodes from the N nodes, wherein M is less than N;
generating unique block-out nodes from M nodes based on election committee, and generating Y trusted nodes from N nodes, wherein Y is greater than M and less than N, and the unique block-out nodes and Y trusted nodes form a distributed storage block chain;
based on the unique block-out node, packaging the acquired data of the mobile terminal, and acquiring a current block of the acquired information;
and broadcasting the current block through the unique block-out node, and storing the current block and the previous block in a link way by all nodes.
It can be understood that the election committee is generated from the plurality of nodes, the election committee elects the unique block-out node, and the unique block-out node is utilized to package the acquired data, so that the calculation amount can be reduced to a greater extent and the data storage efficiency can be improved compared with the consensus mechanism in the prior art.
In some embodiments, randomly generating an election committee comprising M nodes from the N nodes may be based on a pre-set election model.
Specifically, random numbers of the T-th round and the T+1-th round of elections can be obtained according to a preset election model, wherein the random numbers of the T+1-th round are generated by the random numbers of the T-th round and seeds proposed by each node of the T-th round;
and sorting N nodes of the current round based on the random number, and selecting the first M nodes as the election committee.
The method comprises the following steps:
first, setting the participating N Nodes as Nodes: = { node i |i＝1，2，...，n}，{PrivateKey i ，PublicKey i The } is mode i Private and public keys of (a), seed i T Is a mode i Seed generation of random number proposed in the T-th round, S i (Message)：＝σ(Message，PrivateKey i ) Is a mode i Signature of Message and { public Key before random number generation algorithm starts i } i＝1，2...n Has been broadcast to each node. Each wheel node i Broadcast information M i T ＝(Address i ，seed i T ，S i (seed i T )，S i (ζ T ))，S i (ζ T ) Let receive M i T Node determination M of (1) i T Is the basis for the information involved in the T-th round.
The foregoing is a preset selection model.
After the preset election model is set, at the T-th round, each node i A binary number seed of a fixed length L is proposed i T The choice of L depends on the total number of nodes n,each round is based on the random number ζ of the round T And { seed } i T I=1, 2,..n } the nodes are ordered by step P1 below, thereby selecting the first M nodes. Then generating a random number ζ of a T+1 round through the step P2 T+1 I.e. random number ζ T+1 Is a t+1 round of random numbers, each round of random numbers being a binary number of a fixed length bit R.
It should be noted that the above is a framework of the preset election model.
It will be appreciated that the first M nodes may be selected as the election committee after the above number of rounds of random election.
Wherein, step P1 (random number ζ according to current round T Ordering the Nodes) specifically includes: each node receives and acknowledges all the proposed seed i T According to the agreed Hash function Hash (the Hash function Hash can be selected according to the required Hash result length, the selection range of the Hash is not limited here), the agreed result length Ha Xihou is L h ：
GS i T ：＝Hash(Trunked(AppendR(ζ T ，R，seed i T )，R))
(1 at the same position can be multiplexed once every time '11' counts occur in a, e.g. +.>
Wherein, trunk (s, l) is an operation of removing the leftmost l bits from the binary number s, AND (a, b) is a bitwise AND operation of the binary numbers a, b of the same length.
AppendR(s，r，d)：＝LeftShift(s，r)+d
Wherein, the LeftShift (s, r) is an operation of shifting s left by r bits; trunk (s, l) is an operation to remove the leftmost l bits from the binary number s, s [ a: b is the result after intercepting the s a bit to the b-1 bit.
Finally according to Dist i T The first m are selected as committees of current rounds by ascending sort. If the same occurs, compare M i T The order is determined in the order of arrival of most nodes, with higher priority for the average arrival time (different nodes will rebroadcast the higher priority Address signature).
Step P2 (combining the first and last bits ordered in P1 to form the random number ζ of the next round T+1 ) The method specifically comprises the following steps:
in the step P1, the Last node of the ascending sort is called Last, the First node of the ascending sort is First, and α is the mixing ratio:
it will be appreciated that this step may generate a random number ζ of the T+1 round T+1 。
It should be noted that, in the scheme, multiple rounds of random selection are adopted through the preset election model, M nodes are randomly selected from any N nodes to serve as committee, all N nodes have a process of participating in selection, and the selection process cannot be controlled by a few participants in a combined manner to select a result.
In practical application, the service end of the mobile end provides benefits for the unique block-out node.
S102, the blockchain system links and stores the acquired information.
It can be understood that the blockchain system of the scheme links and stores the formed current block, so that the data uplink storage can be realized.
S103, receiving a private key of the upper end of the line, and sending the acquired information to the upper end of the line for reading.
It will be appreciated that steps S101-S102 may enable storage of user collected data, and may allow a user to control the stored data using a private key.
The step enables the user to utilize the acquired information of the user to enable the online evaluation operation to be performed on the online end, and in order to enable the online end to evaluate the acquired information, the user can send the private key of the user to the online end, and the online end reads the acquired information to perform the evaluation operation based on the private key sent by the user.
The mobile terminal may be, for example, a smart wearable device, for example, a smart bracelet, and the acquired data may be, for example, heart rate, blood pressure, exercise status, and the like of the user. The on-line end can be, for example, an on-line doctor, and the acquired data is evaluated, so that an evaluation result is uploaded to the blockchain system.
It can be understood that before the online upper end uses the private key to view the collected information, the user needs to acquire the private key first, and the step of acquiring the private key can be:
receiving tokens paid by the user side to the candidate nodes generating the consensus block, and opening an acquisition channel of a private key to the user side; and the user side acquires and controls the private key of the acquired information based on the acquisition channel.
It can be understood that after the user obtains the private key, the private key can be forwarded to the online end, and the online end can utilize the private key to check corresponding acquired information.
Specifically, before the private key at the upper end of the receiving line, the method further includes:
and responding to the control request of the user terminal agreeing to the online terminal, and sending the private key of the user terminal to the online terminal.
In some embodiments, the collected data may include multiple types;
the sending the private key of the user terminal to the online terminal in response to the control request of the online terminal agreed by the user terminal may include:
and responding to the control request of the online end agreed by the user end, and sending the private key of the type corresponding to the user end to the online end.
It can be understood that if the user only wants to acquire one of the acquired information from the online end, the user only needs to send the private key of the corresponding type to the online end. For example, the heart rate data in the user collected data may correspond to the first private key, and the motion data corresponds to the second private key, and if the user only wants the online end to obtain the heart rate data, only the first private key needs to be sent to the online end.
In an actual application, before the acquiring the private key for controlling the acquired information, the method further includes:
generating a random dynamic password and the effective time of the random dynamic password, and generating the private key based on the random dynamic password and the effective time.
It can be understood that the private key in this embodiment is a random dynamic password, so that the security of the private key is improved, and meanwhile, an effective time is also attached, for example, the user triggers to generate the private key at 9:00 am, the effective time can be 1 hour, then the private key can be invalid at 10:00 am, after 10:00 am, the user can not access the collected information by carrying the private key, so that the security of the collected information is improved.
S104, receiving and storing an online evaluation result of the upper end of the line.
It can be understood that the on-line terminal reads the collected information based on the private key sent by the user to perform evaluation operation, and the obtained on-line evaluation result is uploaded to the blockchain system to be stored, so that the downloading and viewing of the subsequent user are facilitated.
S105, responding to a downloading request of the user terminal, and sending the online evaluation result to the user terminal.
It can be understood that when the user side wants to learn the evaluation result of the user side, the user side needs to download the evaluation result from the blockchain system, and the blockchain system sends the corresponding online evaluation result to the user side after receiving the download request of the user.
The embodiment not only can realize the safe storage of the private data of the user, but also can control the stored data to carry out online evaluation, and the evaluation result related to the private data of the user is obtained.
On the basis of the above embodiment, in order to verify the on-line evaluation result, the evaluation of the on-line end evaluation capability is achieved, and the evaluation can be performed in the following two ways:
mode one:
and receiving a first comparison result uploaded by the user side based on the online evaluation result and the offline evaluation result, and storing the first comparison result in a linked mode, wherein the first comparison result is published in a whole network.
It can be understood that the user can get the offline evaluation result based on the private data by the offline entity terminal, wherein the entity terminal can be, for example, an entity hospital, and then compare with the online evaluation result, upload the online evaluation result to the blockchain by using the user terminal, check whether the result is consistent or not, and publish the result on the whole network.
Mode two:
and receiving a second comparison result uploaded by the offline terminal based on the online evaluation result and the offline evaluation result, and storing the second comparison result in a linked manner, wherein the whole network is published.
The offline end can be, for example, an entity hospital, and the method can support the entity hospital to access the blockchain system, directly compare the online evaluation result to obtain a second comparison result, and upload the second comparison result to the blockchain system for storage and publication in the whole network.
In addition, the first comparison result or the second comparison result can be subjected to verification processing to obtain a verification result; and if the verification result indicates poor evaluation, storing the verification result in a link mode, and publishing the verification result in a whole network.
It can be understood that the method can also perform verification processing on the first comparison result or the second comparison result, judge whether the comparison result is a poor evaluation, and if so, link the poor evaluation, publish the whole network, and the subsequent user can inquire about the evaluation of each node.
The poor evaluation may be determined by a user score, for example, when verifying the first comparison result or the second comparison result, the user may score according to the comparison consistency degree, specifically, for example, if the consistency degree is higher, the score may be 90 score, and if the consistency degree is lower, the score may be 30 score, and then the poor evaluation may be uploaded, and at the same time, a reference value, for example, 60 score, may be set, and the score is lower than 60 score.
Referring to fig. 3, a result schematic diagram of a distributed collected data control device according to an embodiment of the present invention includes:
the acquisition module is used for acquiring the labeled acquisition information of the mobile terminal, wherein the label uniquely corresponds to the off-line entity identity, and the acquisition information is obtained by packing the acquisition data of the mobile terminal by each node according to a consensus mechanism and is read by a private key;
the storage module is used for storing the acquired information in a linked manner;
the private key module is used for receiving a private key at the upper end of the line and sending the acquired information to the upper end of the line for reading;
the evaluation module is used for receiving and storing an online evaluation result of the upper end of the line;
the downloading module is used for responding to a downloading request of a user terminal and sending the online evaluation result to the user terminal;
wherein the consensus mechanism comprises:
randomly generating an election committee comprising M nodes from the N nodes, wherein M is less than N;
generating unique block-out nodes from M nodes based on election committee, and generating Y trusted nodes from N nodes, wherein Y is greater than M and less than N, and the unique block-out nodes and Y trusted nodes form a distributed storage block chain;
based on the unique block-out node, packaging the acquired data of the mobile terminal, and acquiring a current block of the acquired information;
and broadcasting the current block through the unique block-out node, and storing the current block and the previous block in a link way by all nodes.
The apparatus of the embodiment shown in fig. 3 may be correspondingly used to perform the steps in the embodiment of the method shown in fig. 1, and the implementation principle and technical effects are similar, and are not repeated here.
Referring to fig. 4, a schematic hardware structure of a distributed collected data control device according to an embodiment of the present invention is provided, where the distributed collected data control device 40 includes: a processor 41, a memory 42 and a computer program; wherein the method comprises the steps of
A memory 42 for storing the computer program, which may also be a flash memory (flash). Such as application programs, functional modules, etc. implementing the methods described above.
A processor 41 for executing the computer program stored in the memory to implement the steps executed by the apparatus in the above method. Reference may be made in particular to the description of the embodiments of the method described above.
Alternatively, the memory 42 may be separate or integrated with the processor 41.
When the memory 42 is a device separate from the processor 41, the apparatus may further include:
a bus 43 for connecting the memory 42 and the processor 41.
The present invention also provides a readable storage medium having stored therein a computer program for implementing the methods provided by the various embodiments described above when executed by a processor.
The readable storage medium may be a computer storage medium or a communication medium. Communication media includes any medium that facilitates transfer of a computer program from one place to another. Computer storage media can be any available media that can be accessed by a general purpose or special purpose computer. For example, a readable storage medium is coupled to the processor such that the processor can read information from, and write information to, the readable storage medium. In the alternative, the readable storage medium may be integral to the processor. The processor and the readable storage medium may reside in an application specific integrated circuit (Application Specific Integrated Circuits, ASIC for short). In addition, the ASIC may reside in a user device. The processor and the readable storage medium may reside as discrete components in a communication device. The readable storage medium may be read-only memory (ROM), random-access memory (RAM), CD-ROMs, magnetic tape, floppy disk, optical data storage device, etc.
The present invention also provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the device may read the execution instructions from the readable storage medium, the execution instructions being executed by the at least one processor to cause the device to implement the methods provided by the various embodiments described above.
In the above embodiment of the apparatus, it should be understood that the processor may be a central processing unit (english: central Processing Unit, abbreviated as CPU), or may be other general purpose processors, digital signal processors (english: digital Signal Processor, abbreviated as DSP), application specific integrated circuits (english: application Specific Integrated Circuit, abbreviated as ASIC), or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor for execution, or in a combination of hardware and software modules in a processor for execution.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention.
Claims (10)
1. A distributed acquisition data control method, comprising:
acquiring labeled acquisition information of a mobile terminal, wherein the label uniquely corresponds to an offline entity identity, and the acquisition information is obtained by packing acquisition data of the mobile terminal by each node according to a consensus mechanism and is read by a private key;
performing link storage on the acquired information;
receiving a private key at the upper end of the line, and sending the acquired information to the upper end of the line for reading;
receiving and storing an online evaluation result of the online upper end;
responding to a downloading request of a user terminal, and sending the online evaluation result to the user terminal;
wherein the consensus mechanism comprises:
randomly generating an election committee comprising M nodes from the N nodes, wherein M is less than N;
generating unique block-out nodes from M nodes based on election committee, and generating Y trusted nodes from N nodes, wherein Y is greater than M and less than N, and the unique block-out nodes and Y trusted nodes form a distributed storage block chain;
based on the unique block-out node, packaging the acquired data of the mobile terminal, and acquiring a current block of the acquired information;
broadcasting the current block through the unique block-out node, and storing the current block and the previous block in a link way by all nodes;
wherein randomly generating an election committee comprising M nodes from the N nodes comprises:
acquiring random numbers of T-th round and T+1-th round elections according to a preset election model, wherein the random numbers of the T+1-th round are generated by the random numbers of the T-th round and seeds proposed by each node of the T-th round;
and sorting N nodes of the current round based on the random number, and selecting the first M nodes as the election committee.
2. The method as recited in claim 1, further comprising:
receiving the token paid by the user side to the unique block-out node, and opening an acquisition channel of a private key to the user side;
and the user side acquires and controls the private key of the acquired information based on the acquisition channel.
3. The method of claim 2, further comprising, prior to said obtaining a private key that controls said collected information:
generating a random dynamic password and the effective time of the random dynamic password;
the private key is generated based on the random dynamic password and the validity time.
4. The method of claim 1, further comprising, prior to receiving the private key at the upper end of the line:
and responding to the control request of the user terminal agreeing to the online terminal, and sending the private key of the user terminal to the online terminal.
5. The method of claim 4, wherein the acquired data comprises a plurality of types;
the response to the control request of the user terminal agreeing to the online terminal, the private key of the user terminal is sent to the online terminal, including:
and responding to the control request of the online end agreed by the user end, and sending the private key of the type corresponding to the user end to the online end.
6. The method as recited in claim 1, further comprising:
and receiving a first comparison result uploaded by the user side based on the online evaluation result and the offline evaluation result, and storing the first comparison result in a linked mode, wherein the first comparison result is published in a whole network.
7. The method as recited in claim 6, further comprising:
and receiving a second comparison result uploaded by the offline terminal based on the online evaluation result and the offline evaluation result, and storing the second comparison result in a linked manner, wherein the whole network is published.
8. The method as recited in claim 7, further comprising:
performing verification processing on the first comparison result or the second comparison result to obtain a verification result;
and if the verification result indicates poor evaluation, storing the verification result in a link mode, and publishing the verification result in a whole network.
9. The method of claim 1, wherein the server of the mobile terminal provides benefits to the unique out-of-block node.
10. A distributed acquisition data control device, comprising:
the acquisition module is used for acquiring the labeled acquisition information of the mobile terminal, wherein the label uniquely corresponds to the off-line entity identity, and the acquisition information is obtained by packing the acquisition data of the mobile terminal by each node according to a consensus mechanism and is read by a private key;
the storage module is used for storing the acquired information in a linked manner;
the private key module is used for receiving a private key at the upper end of the line and sending the acquired information to the upper end of the line for reading;
the evaluation module is used for receiving and storing an online evaluation result of the upper end of the line;
the downloading module is used for responding to a downloading request of a user terminal and sending the online evaluation result to the user terminal;
wherein the consensus mechanism comprises:
randomly generating an election committee comprising M nodes from the N nodes, wherein M is less than N;
generating unique block-out nodes from M nodes based on election committee, and generating Y trusted nodes from N nodes, wherein Y is greater than M and less than N, and the unique block-out nodes and Y trusted nodes form a distributed storage block chain;
based on the unique block-out node, packaging the acquired data of the mobile terminal, and acquiring a current block of the acquired information;
broadcasting the current block through the unique block-out node, and storing the current block and the previous block in a link way by all nodes;
wherein randomly generating an election committee comprising M nodes from the N nodes comprises:
acquiring random numbers of T-th round and T+1-th round elections according to a preset election model, wherein the random numbers of the T+1-th round are generated by the random numbers of the T-th round and seeds proposed by each node of the T-th round;
and sorting N nodes of the current round based on the random number, and selecting the first M nodes as the election committee.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111113147.8A CN113922993B (en) | 2021-09-18 | 2021-09-18 | Distributed acquisition data control method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111113147.8A CN113922993B (en) | 2021-09-18 | 2021-09-18 | Distributed acquisition data control method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113922993A CN113922993A (en) | 2022-01-11 |
| CN113922993B true CN113922993B (en) | 2024-04-12 |
Family
ID=79235826
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111113147.8A Active CN113922993B (en) | 2021-09-18 | 2021-09-18 | Distributed acquisition data control method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113922993B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109831425A (en) * | 2019-01-25 | 2019-05-31 | 中国联合网络通信集团有限公司 | Block chain common recognition method, apparatus, equipment and computer readable storage medium |
| WO2019213867A1 (en) * | 2018-05-09 | 2019-11-14 | 合肥达朴汇联科技有限公司 | Method and device for reaching consensus in blockchain |
| CA3108398A1 (en) * | 2018-08-02 | 2020-02-06 | Neuralia Technologies Inc. | Method and system for proof of election on a blockchain |
| CN111125250A (en) * | 2019-12-20 | 2020-05-08 | 北京艾摩瑞策科技有限公司 | Method and device for storing internet evaluation data on block chain |
| CN113067707A (en) * | 2021-06-02 | 2021-07-02 | 腾讯科技（深圳）有限公司 | Data processing method, device and equipment based on block chain and readable storage medium |
| CN113098689A (en) * | 2021-02-25 | 2021-07-09 | 西安电子科技大学 | Trust-establishing cross-chain consensus method, system, storage medium and application |
-
2021
- 2021-09-18 CN CN202111113147.8A patent/CN113922993B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019213867A1 (en) * | 2018-05-09 | 2019-11-14 | 合肥达朴汇联科技有限公司 | Method and device for reaching consensus in blockchain |
| CA3108398A1 (en) * | 2018-08-02 | 2020-02-06 | Neuralia Technologies Inc. | Method and system for proof of election on a blockchain |
| CN109831425A (en) * | 2019-01-25 | 2019-05-31 | 中国联合网络通信集团有限公司 | Block chain common recognition method, apparatus, equipment and computer readable storage medium |
| CN111125250A (en) * | 2019-12-20 | 2020-05-08 | 北京艾摩瑞策科技有限公司 | Method and device for storing internet evaluation data on block chain |
| CN113098689A (en) * | 2021-02-25 | 2021-07-09 | 西安电子科技大学 | Trust-establishing cross-chain consensus method, system, storage medium and application |
| CN113067707A (en) * | 2021-06-02 | 2021-07-02 | 腾讯科技（深圳）有限公司 | Data processing method, device and equipment based on block chain and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113922993A (en) | 2022-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111625593B (en) | Block chain-based data processing method and device and computer equipment | |
| CN113095510B (en) | Federal learning method and device based on block chain | |
| CN111865587B (en) | Data processing method, block link point device, electronic device, and computer program | |
| CN110430045B (en) | Random number generation method based on distributed consensus algorithm | |
| CN111698094B (en) | Common identification method based on block chain system and block chain system | |
| WO2023071373A1 (en) | Blockchain consensus method, apparatus, and device, and storage medium | |
| CN113987431A (en) | Internet of things terminal identity authentication method based on block chain | |
| CN110990790B (en) | Data processing method and equipment | |
| CN115883076A (en) | Method, system, medium, device and terminal for protecting privacy of federated learning | |
| CN115759289A (en) | Federal learning method, system and device based on user grouping cooperation | |
| CN113922993B (en) | Distributed acquisition data control method and device | |
| US11782758B2 (en) | Distributed computing system and method of operation thereof | |
| US20230291656A1 (en) | Operation of a distributed deterministic network | |
| CN112131602B (en) | Method, device and related product for quickly expanding trust relationship between nodes based on trusted computing | |
| CN113596182B (en) | Distributed multi-terminal service method and device | |
| CN113596180B (en) | Distributed multi-end docking method and device | |
| CN113556405B (en) | Distributed management method and device for private information | |
| CN113949711B (en) | Distributed process data processing method and device | |
| CN113973119B (en) | Distributed management method and device | |
| End et al. | Adaption of the n-way dissemination algorithm for gaspi split-phase allreduce | |
| CN113949508B (en) | Process data processing method and device based on random number consensus mechanism | |
| CN114547186A (en) | Decentralized service supervision method and device | |
| CN113901137A (en) | Distributed flow information processing method and device | |
| CN113542439B (en) | Distributed data storage access method and device | |
| CN113612619B (en) | Distributed multi-terminal supervision method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |