CN109246206B - Generate and record the method and network of information - Google Patents
Generate and record the method and network of information Download PDFInfo
- Publication number
- CN109246206B CN109246206B CN201810985676.9A CN201810985676A CN109246206B CN 109246206 B CN109246206 B CN 109246206B CN 201810985676 A CN201810985676 A CN 201810985676A CN 109246206 B CN109246206 B CN 109246206B
- Authority
- CN
- China
- Prior art keywords
- information
- node
- data block
- generate
- network
- 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
Classifications
-
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/30—Decision processes by autonomous network management units using voting and bidding
-
- 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/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
Abstract
The embodiment of the present invention provides the method and network for generating and recording information.The method for generating and recording information, comprising: generate node by multiple information in network and generate information respectively;And information generation data block is based on by multiple nodes that represent in network.Data block includes the information of predetermined quantity, and data block is recorded in linked data structure, and linked data structure stores in a network in a distributed manner.Multiple quantity for representing node are less than the quantity that multiple information generate node.In an embodiment of the present invention, using it is multiple represent node and generate data block and be recorded in linked data structure, rather than handled and stored using specific server, this is conducive to improve the efficiency that data block is generated and recorded, and can be improved safety.The embodiment of the present invention is particularly suitable for the network system that there is bulk information to generate node.
Description
Technical field
The present invention relates to network systems, more particularly to generate and record the method and network of information.
Background technique
Network be widely used in society various aspects, a large amount of information all the time all in a network generate and
Record.Important information is desirable to by timely record and can not distort.As an example, such information can be
Vote information relevant to the campaigns of voter a large amount of in country or area.The throwing being connected in network can be used in voter
Ticket terminal is voted, to generate relevant vote information.Vote information is counted specified server is sent to.Service
The result of device statistics finally comes forth.Such system usually has the following problems: whether server is safe, if can be attacked
It hits, how to verify whether voting results are tampered.
There are improved spaces for traditional generation and the method and network for recording information.
Summary of the invention
The embodiment of the present invention provides the method and network of improved generation and record information.
The first aspect of the invention provides the method for a kind of generation and record information.The method for generating and recording information
It include: to generate node by multiple information in network to generate information respectively;And letter is based on by multiple nodes that represent in network
Breath generates data block.Data block includes the information of predetermined quantity, and data block is recorded in linked data structure, and chain type number
It is stored in a network according to structure distribution formula.Multiple quantity for representing node are less than the quantity that multiple information generate node.
In an embodiment of the present invention, data block includes multiple data portions.It is generated by multiple nodes that represent in network
Data block includes: to generate multiple data portions respectively by multiple nodes that represent;And the multiple data portions of integration, to generate data
Block.
In an embodiment of the present invention, multiple data portions are integrated by multiple predetermined nodes that represent represented in node.
In an embodiment of the present invention, method further include: send data blocks to it is multiple represent node, with verify data block
Whether effectively.
In an embodiment of the present invention, method further include: be greater than 2/3rds quantity in response to multiple represent in node
Representative node the verification result of affirmative is given for data block, determine that data block is effective.
In an embodiment of the present invention, multiple quantity for representing node are odd numbers.
In an embodiment of the present invention, information is vote information.
In an embodiment of the present invention, generating node to generate information respectively by multiple information includes: that multiple information are produced
The logical card of tight knot point distribution, logical card represent ballot paper;And logical card is transferred to and is voted-for object by multiple information generation nodes, leads to card
Shift vote by proxy.The record of the transfer of logical card is included in information.
In an embodiment of the present invention, method further include: generated from multiple information and select multiple to represent node in node.
In an embodiment of the present invention, being generated in node by way of ballot from multiple information selects multiple representatives to save
Point.
In an embodiment of the present invention, generating from multiple information and selecting multiple nodes that represent in node includes: by multiple letters
Breath generates node and is assigned in multiple areas;And it is generated respectively in multiple areas and represents node.
In an embodiment of the present invention, method further include: generated in node from multiple information and select at least one alternative generation
Table node.
In an embodiment of the present invention, linked data structure is stored in the distributed account book of network.
In an embodiment of the present invention, generating the step of node generates information respectively by multiple information in network includes:
Generate corresponding private key and public key;And generate information.Information at least partly uses private key encryption.Information includes using private
The signature that key generates.
In an embodiment of the present invention, method further include: the other information that will send information in network generates node;With
And node is generated according to public key by other information, information is verified.
The second aspect of the invention provides the network of a kind of generation and record information, for implementing the side of any of the above-described
Method.Network includes: that multiple information generate node, is configured to generate information;And it is multiple represent node, be configured as producing
Raw data block, data block includes the information of predetermined quantity, and data block is stored in linked data structure.Multiple representative sections
The quantity of point is less than the quantity that multiple information generate node.
The third aspect of the invention provides a kind of information generation node, for above-mentioned network.Information generates node packet
It includes: memory;And it is operatively coupled to the processor of memory.Processor is configured as executing program to generate information.
In an embodiment of the present invention, processor is configured as: generating corresponding private key and public key;And generate letter
Breath.Information at least partly uses private key encryption.Information includes the signature generated using private key.
In an embodiment of the present invention, processor, which is also configured to instruction information generation node, will send information to network
In other information generate node.
The fourth aspect of the invention provide it is a kind of represent node, for above-mentioned network.Representing node includes: storage
Device;And it is operatively coupled to the processor of memory.Processor is configured as executing program to generate node based on information
The information of generation generates data block.Data block includes the information of predetermined quantity, and data block is recorded in linked data structure.
The fifth aspect of the invention provides a kind of computer readable storage medium, is stored thereon with computer program, meter
Calculation machine program makes at least one processor execute any of the above-described method when executing on at least one processor.
According to an embodiment of the invention, using it is multiple represent node and generate data block and be recorded in linked data structure
In, rather than handled and stored using specific server, this is conducive to improve the efficiency that data block is generated and recorded, and
And it can be improved safety.The embodiment of the present invention is particularly suitable for the network system that there is bulk information to generate node.
Detailed description of the invention
In order to illustrate more clearly of the technical solution of the embodiment of the present invention, the attached drawing of embodiment will be carried out below brief
Explanation, it should be appreciated that figures described below merely relates to some embodiments of the present invention, rather than limitation of the present invention,
In:
Fig. 1 is the schematical flow chart of a kind of generation and the method for recording information that the embodiment of the present invention provides;
Fig. 2 is the schematic diagram that data block is recorded to linked data structure;
Fig. 3 is the schematical block diagram of linked data structure;
Fig. 4 is data block by other schematic diagrames for representing node verification;
Fig. 5 is the illustrative flow chart for generating vote information;
Fig. 6 is the schematic diagram that information generates that node carries out information other processing;
Fig. 7 is the illustrative block diagram that information generates node;
Fig. 8 is the illustrative block diagram for the processor that information generates node.
Specific embodiment
In order to keep the technical solution and advantage of the embodiment of the present invention clearer, below in conjunction with attached drawing, to the present invention
The technical solution of embodiment carry out clear, complete description.Obviously, described embodiment is that a part of the invention is implemented
Example, instead of all the embodiments.Based on described the embodiment of the present invention, those skilled in the art are without creative labor
Every other embodiment obtained under the premise of dynamic, also shall fall within the protection scope of the present invention.
Fig. 1 is the schematical flow chart of a kind of generation and the method for recording information that the embodiment of the present invention provides.Such as
Shown in Fig. 1, generates and the method for record information includes: step S110, generate node by multiple information in network and generate respectively
Information;And step S120, information generation data block is based on by multiple nodes that represent in network.Data block includes predetermined quantity
Information, data block is recorded in linked data structure, and linked data structure stores in a network in a distributed manner.It is multiple
The quantity for representing node is less than the quantity that multiple information generate node.
According to an embodiment of the invention, using it is multiple represent node and generate data block and be recorded in linked data structure
In, rather than handled and stored using specific server, this is conducive to improve the efficiency that data block is generated and recorded, and
And it can be improved safety.The embodiment of the present invention is particularly suitable for the network system that there is bulk information to generate node.
The linked data structure stored in a distributed manner can guarantee that data are difficult to tamper with.Since data distribution formula is stored in net
In network, interpolater needs to change simultaneously the backup of multiple positions.In addition, in order to rewrite any of linked data structure data block
In information, need to change simultaneously a large amount of other data blocks with the block-chaining where the information.Such change is
Extremely difficult realization, improve the safety of network.Such linked data structure can be stored in any number of representative simultaneously
In node.When information, which generates node itself, has enough storage capacities, the backup of chain structure data can also be saved.One
As for, the number of nodes for storing backup is more, and the difficulty distorted will be higher.
Arbitrary distributed storage technology, such as distributed database etc. can be used.As a specific example,
Distributed account book relevant to block chain technology can be configured, then linked data structure is stored in the distributed account book of network
In.
Furthermore, it is possible to which the relatively few number of node that represents, which is only used only, generates data block, rather than produced by all information
The generation process of tight knot point participation data block.The small number of node that represents is easily managed and safeguards, can be improved efficiency, prevents
As information generate node repeated work or vie each other and caused by the wasting of resources, network delay etc. can also be reduced
It is influenced caused by other factors.
It should be appreciated that the information of predetermined quantity described herein, is not the specific amount of limitation for information.That is, institute
Stating predetermined quantity not merely includes a fixed numerical value, is also possible to a scheduled numberical range, such numerical value or
Person's numberical range can be used for limiting the size of memory space required for the data block of generation.In addition, according to application environment
Difference, the predetermined quantity can also adjust at any time, for example, the predetermined quantity can be the need generated in network in predetermined amount of time
The sum for the information to be recorded.
Fig. 2 is the illustrative block diagram of multiple data portions of data block.As shown in Fig. 2, in an embodiment of the present invention,
Data block 200 includes multiple data portions, such as B01, B02, B03 etc..Node is represented by multiple in network, such as 201,
202,203 etc., above-mentioned multiple data portions are generated respectively.Such multiple data portions are integrated, to generate data block
200。
Since in the data structure of chain type, each data block must be sequentially generated and record, then a upper data block
After the completion, the generation work of next data block could be started.Each data block generates the time restriction needed network
The speed of operation.When each data block is only generated by a node, either always by unique centralization node, example
Data block is generated such as server, or is at war with by the different any number of nodes in network, is submitted using earliest
Satisfactory data block, the node for completing data block requires the information for successively obtaining predetermined quantity, to be stored in data block
In.
The process of such complete serial arithmetic needs to expend the more time, especially there is bulk information in a network
When needing to handle.In addition, only completing operation by a node, the operational capability of other nodes in network is wasted, especially
When being that any number of node in a network is at war with, other nodes for participating in competition may have been generated also completely
Data block, only because the differences such as arithmetic speed and it is unselected.
In an embodiment of the present invention, it needs to include that the information of predetermined quantity within the data block is further divided into, by
Different representative nodes are collected and arrange, this greatly improves working efficiency.The time for generating a data block can be with
It is substantially shorten to the level of T/N, T is original time as required for a node generation full block of data, and N is above-mentioned use
In the multiple quantity for representing node for generating a data block simultaneously.
Each represent node information collected can be it is random, for example, each represent node can be direct
It obtains in a network and is most transferred to this fastly and represents node, not by other information for representing node and obtaining.Such mode can be with
So that it is in running order as far as possible to represent node, working efficiency is improved.Such mode is particularly suitable for information and generates section
Point working condition nondeterministic network, that is, in a period of time, the quantity for generating the information generation node of information may be
It is complete unforeseen.
Alternatively, represent each represent node information collected can be it is preassigned.Such as Fig. 2 institute
Show, carrys out self-information generation node 2011,2012,2013 etc. for example, representing node 201 and can be configured as the fixed acquisition of acquisition
Information.Information relevant to node 210 is represented, which generates node 2011,2012,2013 etc. and can be, belongs to same group.It is such
Group can generate the network address of node according to information and divide, and can also generate section according to actual physical location or information
Point user other attributes and divide.Setting in this way, the workload for representing node can be assessed and be calculated in advance,
The network transmission represented between node and corresponding information generation node can also be pre-optimized, this is conducive to advanced optimize
Network, and improve efficiency.
It in an embodiment of the present invention, can be straight by multiple data blocks 200 for representing node acquisition according to the needs of storage
Splicing is connect, is then stored.In addition, in order to improve safety, and data block is made to be easy to retrieve, check, data block 200 may be used also
Other contents are added during integral data part B01, B02, B03 etc..
In an embodiment of the present invention, it can be represented any of node by multiple and integrated multiple data portions.In addition,
In order to improve efficiency and be convenient for management, multiple data portions can be integrated by multiple predetermined nodes that represent represented in node.In advance
Fixed representative node can be always uniquely, can also be according to the regular rotation of setting.
Fig. 3 is the schematical block diagram of linked data structure.As shown in figure 3, the data block 301,302,303 etc. after integration
Etc. being added into data-link 30.For example, data block 301 includes information loads IP1, the quilts such as data portion B01, B02, B03
It is included in information loads IP1.It as example rather than limits, data block 301 can also include time stamp T S1, count negative
Carry CP1, random number N 1.The time that time stamp T S1 can be used to indicate to generate data block.Counting overload CP1 can be used for storing
The relevant count information of data block itself, for example, height (serial number) of the current data block in data-link 30.Counting overload CP1
Count information relevant to information loads IP1 can also be stored, for example, it is other to carry out quantity of information of self-information generation node etc.
Statistical information.Random number N 1 is arranged in data block 301 to be used to improve safety.For example, after other data contents determine,
The cryptographic Hash of entire data block 301 can be changed only by adjustment random number N 1.Cryptographic Hash can only be specified according to having
The data block 301 of random number N 1 itself carries out operation and obtains, and cannot first specify cryptographic Hash, and then reversed operation solves random number
N1.Therefore, when the cryptographic Hash for data block 301 proposes scheduled condition (for example, being less than scheduled value), representing node must
Exhaustion must be carried out for random number N 1, to constantly update cryptographic Hash, until meeting scheduled condition.This calculating process can be as
H1 in Fig. 3 is indicated.H2, H3 illustrate the hash calculation process of other data blocks 302,303.
Such calculating process can prove to represent the workload of node, so that data block 301 is easier to be verified, and
And since such calculating process needs certain workload, this to represent the cost of doing evil that node generates false data block
Increase.When cost of doing evil is greater than the income for generation of doing evil, representing node will have no reason to carry out behavior of doing evil, such setting
Improve the safety of network.
In addition, can also be wrapped in data block 301 to further increase the safety of data block 301 and verifiability
Include the digital signature for generating the representative node of the data block 301.The digital signature may be embodied in information loads IP1, and
The information of node is generated come self-information based on include in information loads IP1, and is represented the private key of node and generated.
Other data blocks, such as 302,303 is equal identical as the structure of data block 301, but specific data content is different.
Fig. 4 is data block by other schematic diagrames for representing node verification.As shown in figure 4, any one appointed representative
The data block (such as data block 301) that node (such as representing node 201) is integrated multiple data block portions and generated can be sent
To it is other it is multiple represent node (such as represent node 202,203,204,205 etc.), with verify data block.
As the example in Fig. 4, the representative node 202,203,204,205 of data block is received immediately for data block
301 are verified, and verification result return is represented node 201 (can also notify simultaneously other represent node).Once multiple
The representative node greater than 2/3rds quantity represented in node gives the verification result of affirmative for data block, then can be true
It is effective to determine data block.In an embodiment of the present invention, multiple quantity for representing node can be odd number, to further facilitate data
The verifying of block.
According to such embodiment, the representative node 202,203,204,205 of data block is received without waiting for next
The generation of a data block, so that it may directly be verified for current data block, save the time of waiting.In addition, receiving
To data block representative node 202,203,204,205 for current data block verifying work when carry out parallel, rather than
It successively serially carries out, further saves the waiting time.
In addition, in an embodiment of the present invention, arbitrary verification mode can be used.As an example, receiving data block
The process of representative node verification data block can specifically include that according to the information for generating node in information loads come self-information
And digital signature is verified.This process can be the representative node by receiving data block according to the generation for generating data block
The public key of table node verifies whether to be obtained in digital signature according to the information for generating node come self-information in information loads
The verification information for including, such as cryptographic Hash etc..If verification information in digital signature and the representative node for receiving data block
The verification information obtained based on public key is consistent, then it is assumed that data block is verification result that is believable, and providing affirmative.
In conjunction with Fig. 1-Fig. 4, the embodiment provides the methods for generating and recording information.Node is represented using multiple
It generates data block and is recorded in linked data structure, rather than handled and stored using specific server, this
Be conducive to improve the efficiency that data block is generated and recorded, and can be improved safety.The embodiment of the present invention is particularly suitable for
The network of node is generated with bulk information.
Such network can be applied to arbitrarily there is great deal of nodes to participate in and generate the network of information, to guarantee in this way
Information by reliable recording and preservation.For example, typically, such network can be banking network, user node generates each
Kind Transaction Information, these Transaction Informations are by reliable recording and preservation.In addition, such network is also possible to network of voting, use
Family node generates vote information, these vote informations are by reliable recording and preservation.Hereinafter, by taking network of voting as an example, for this
The embodiment of application is further detailed.
Fig. 5 is the illustrative flow chart for generating vote information.
In ballot network, it is the ballot equipment used by user that information, which generates node,.Ballot equipment can be dedicated
Electronic voting equipment, is also possible to be mounted with the universal computing device of dedicated ballot software, for example, computer, smart phone or
The other portable computing devices of person.
As shown in figure 5, the process (that is, step S110 in Fig. 1) for generating vote information includes: step S510, for multiple
Information generates the logical card of node distribution, and logical card represents ballot paper;And step S520, multiple information generate nodes by logical card be transferred to by
Ballot object, leads to the transfer vote by proxy of card.The record (record voted) of the transfer of logical card is included in information.
Ballot paper is represented using logical card, and with the process of logical card transfer vote by proxy, simplify the mistake of information generation and record
Journey, after all information generation nodes are voted, it is thus only necessary to count the logical card in the respective account of candidate
Quantity, it can confirm which candidate is the winner of ballot.
In an embodiment of the present invention, multiple nodes that represent can be fixed special equipment.This, which is conducive to improve, represents
The computing capability of node, for example, representing node can be used the dedicated computing equipment different from information generation node (for example, more
Powerful special purpose computer or server) and/or software systems.
In addition, in an embodiment of the present invention, it can also be generated from multiple information in node and select multiple to represent node.In
In the embodiment of the present invention, it can be generated by way of ballot from multiple information and select multiple to represent node in node.
That is, in an embodiment of the present invention, it can be first by way of the first round of voting, from multiple information sections
The representative node of predetermined quantity is elected in point.The process of the election is also possible to the process of the transfer of logical card.Then, Duo Gexin
Breath node can carry out any other ballots, conduct an election for candidate, or carry out decision for candidate item.It
The information of other ballots afterwards can be collected and be recorded by representing node according to above-mentioned steps, to improve each round ballot
Efficiency.In the ballot of each round, the vote information that all information generate node can be collected and is recorded in a data block,
It may be easy to count in this way and inquire.As a specific illustrative technological means, in order to avoid the wheel polling hours
(that is, all information is waited to generate the time that node is voted) is too long, during can specify that effectively ballot, once it is more than effective throwing
Between usance, the ballot operation that information generates node will be no longer recorded.
Further, these representatives can be generated from different areas.In an embodiment of the present invention, it is produced from multiple information
It includes: that multiple information generation node is assigned in multiple areas that multiple nodes that represent are selected in tight knot point;And in multiple areas
It generates respectively and represents node.These areas can be the network address region in physical location region or network physically, or
The region that person divides according to the identity or other attributes of user.Division in this way can quickly produce generation
Table node.Also, when representing node work, it can be set to handle the letter that the information from other regions generates node
Breath, this can further prevent the generation of data tampering behavior.
In an embodiment of the present invention, for the good operation of Logistics networks, it can also be arranged and alternatively represent node, in work
When representative node in work cannot complete specified task, replaced using node is alternatively represented.Represent node following situations can
It can be considered that specified task cannot be completed: data portion cannot be generated within the predetermined time, the data portion of generation fails
By other verifyings for representing node, stop response etc..This may be caused due to damage, the network failure etc. of software/hardware.
For generating the representative node chosen in node from multiple information, it can generate in node and select from multiple information
It selects at least one and alternatively represents node.
Fig. 6 is the schematic diagram that information generates that node carries out information other processing.As shown in fig. 6, in reality of the invention
It applies in example, in order to improve safety, generates the step of node generates information respectively by multiple information in network further include: step
S610 generates corresponding private key and public key;And step S620, generate information, wherein information at least partly uses private key
Encryption, and information includes the signature generated using private key.Correspondingly, method further include: step S630 will send information to net
Other information in network generates node;And step S640, node is generated according to public key by other information, information is tested
Card.Using encryption/verification technique of public/private keys, information can be made to generate the raw information that node generates and be difficult to tamper with, and
And it is easy to verify.The verification result that other information generates node can be used to confirm that whether the information being verified is adopted, for example, generation
Table node can will be verified as insecure information and exclude except data block.Representing node can generate according to other information
The verification result of node carries out this processing, can also voluntarily be verified, to carry out this processing.
Fig. 7 is the illustrative block diagram that information generates node.As shown in fig. 7, it includes: memory that information, which generates node 700,
701;And it is operatively coupled to the processor 702 of memory 701.Processor 702 is configured as executing program to generate letter
Breath.Processor 702 is also configured to instruction information and generates the other information generation section that node 700 will send information in network
Point.It can also include any form of communication module 703 that information, which generates node 700, to send and connect for communicating in a network
It collects mail and ceases.For example, communication module 703 can be arbitrary the module with wire/wireless communication function.
It is appreciated that processor 702 is configured as executing program when information generation node 700 is chosen as representing node
Data block is generated to generate the information that node generates based on information.Data block includes the information of predetermined quantity, and data block is recorded
In linked data structure.
Fig. 8 is the illustrative block diagram for the processor that information generates node.As shown in figure 8, processor 702 may include:
Random number generation module 7021 generates random number and as private key and generates corresponding public key;And information-generation module 7022,
Information is generated, information at least partly uses private key encryption, and information includes the signature generated using private key.In addition, processing
Device 702 can also include registration module 7023, and registration module can be used for associated private key and the identity information of user.
It should be appreciated that processor 702 can be arbitrary the hardware with processing function, such as central processing unit
(CPU), micro-control unit (MCU), digital signal processor (DSP), field programmable gate array (FPGA) etc..Generating random number
Module 7021, information-generation module 7022, registration module 7023 etc. can be the different hardware components of processor 702, can also
To be to be run different program modules by processor 702 and realized.
The embodiment of the present invention provides the network of a kind of generation and record information, the method for implementing any of the above-described.
Network includes: that multiple above-mentioned information generate node, is configured to generate information;And multiple above-mentioned representative nodes,
It is configured as generating data block, data block includes the information of predetermined quantity, and data block is stored in linked data structure.
Multiple quantity for representing node are less than the quantity that multiple information generate node.
The embodiment of the present invention also provides a kind of computer readable storage medium, is stored thereon with computer program, calculates
Machine program makes at least one processor execute any of the above-described method when executing on at least one processor.
According to an embodiment of the invention, only the less multiple nodes that represent of usage quantity generate data block and are recorded
In linked data structure, rather than this function is undertaken using the unspecific node in multiple information generation node, this
Be conducive to improve the efficiency that data block is generated and recorded.The embodiment of the present invention is particularly suitable for generating node with bulk information
Network system.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, essence of the invention is not being departed from
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (19)
1. a kind of method of generation and record information, comprising:
Node, which is generated, by multiple information in network generates information respectively;And
Information generation data block is based on by multiple nodes that represent in the network;
Wherein, the data block includes the information of predetermined quantity, and the data block is recorded in linked data structure, and
And the linked data structure is stored in a distributed manner in the network;
Wherein, the multiple quantity for representing node is less than the quantity that the multiple information generates node;
Wherein, the data block includes multiple data portions;
Wherein, include: by the multiple node generation data block that represents in the network
The multiple data portion is generated by the multiple node that represents respectively;And
The multiple data portion is integrated, to generate the data block;
The method also includes:
It is generated from the multiple information and selects the multiple to represent node in node.
2. according to the method described in claim 1, wherein, as it is the multiple represent in node predetermined represent described in node integration
Multiple data portions.
3. according to claim 1 or method described in 2, further includes: by the data block be sent to it is the multiple represent node,
It is whether effective to verify the data block.
4. according to the method described in claim 3, further include:
The data block is given in response to the multiple representative node greater than 2/3rds quantity represented in node
Verification result certainly, determines that the data block is effective.
5. method according to claim 1 or 2, wherein the multiple quantity for representing node is odd number.
6. method according to claim 1 or 2, wherein the information is vote information.
7. according to the method described in claim 6, wherein, generating information respectively by the multiple information generation node includes:
The logical card of node distribution is generated for the multiple information, the logical card represents ballot paper;
The logical card is transferred to and is voted-for object by the multiple information generation node, the transfer vote by proxy of the logical card;
Wherein, the record of the transfer of the logical card is included in the information.
8. according to the method described in claim 1, wherein, being generated in node and being selected from the multiple information by way of ballot
It is the multiple to represent node.
9. according to the method described in claim 8, wherein, being generated in node from the multiple information and the multiple representative being selected to save
It puts and includes:
The multiple information generation node is assigned in multiple areas;
It is generated respectively in the multiple area and represents node.
10. according to the method described in claim 1, further include:
Generating in node from the multiple information selects at least one alternatively to represent node.
11. method according to claim 1 or 2, wherein the linked data structure is stored in the distribution of the network
In formula account book.
12. method according to claim 1 or 2, wherein generate node by multiple information in network and generate information respectively
The step of include:
Generate corresponding private key and public key;And
Generate the information;
Wherein, the information at least partly use the private key encryption;And
Wherein, the information includes the signature generated using the private key.
13. according to the method for claim 12, further includes:
The other information in the network, which is sent, by the information generates node;And
Node is generated according to the public key by the other information, the information is verified.
14. the network of a kind of generation and record information, for implementing the described in any item methods of claim 1 to 13, comprising:
Multiple information generate node, are configured to generate the information;
It is multiple to represent node, it is configured as generating data block, the data block includes the information of predetermined quantity, and described
Data block is stored in linked data structure;
Wherein, the multiple quantity for representing node is less than the quantity that the multiple information generates node;
Wherein, the data block includes multiple data portions;
Wherein, the multiple node that represents is configured to: generating the multiple data portion respectively;And
The multiple data portion is integrated to generate the data block;
Wherein, the multiple node that represents is to be generated to select to generate in node by the multiple information.
15. a kind of information generates node, for the network described in claim 14, the information generates node and includes:
Memory;And
It is operatively coupled to the processor of the memory;
Wherein, the processor is configured to executing program to generate information.
16. information according to claim 15 generates node, wherein the processor is configured to:
Generate corresponding private key and public key;And
Generate the information;
Wherein, the information at least partly use the private key encryption;And
Wherein, the information includes the signature generated using the private key.
17. information according to claim 16 generates node, wherein the processor is also configured to
Indicate that the information generates the other information that node sends the information in the network and generates node.
18. a kind of represent node, for the network described in claim 14, the node that represents includes:
Memory;And
It is operatively coupled to the processor of the memory;
Wherein, data block is generated to generate the information that node generates based on information the processor is configured to executing program;
Wherein, the data block includes the information of predetermined quantity, and the data block is recorded in linked data structure;
Wherein, the data block includes multiple data portions;
Wherein, the processor is further configured to execute program to generate the data portion;
Wherein, the multiple data portion is integrated to generate the data block.
19. a kind of computer readable storage medium is stored thereon with computer program, the computer program is at least one
At least one described processor is set to execute method according to any one of claim 1 to 13 when executing on reason device.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810985676.9A CN109246206B (en) | 2018-08-28 | 2018-08-28 | Generate and record the method and network of information |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810985676.9A CN109246206B (en) | 2018-08-28 | 2018-08-28 | Generate and record the method and network of information |
Publications (2)
Publication Number | Publication Date |
---|---|
CN109246206A CN109246206A (en) | 2019-01-18 |
CN109246206B true CN109246206B (en) | 2019-12-03 |
Family
ID=65069449
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810985676.9A Active CN109246206B (en) | 2018-08-28 | 2018-08-28 | Generate and record the method and network of information |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN109246206B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110474892B (en) * | 2019-07-30 | 2021-08-31 | 广东工业大学 | False data injection attack defense method based on block chain technology |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107005574A (en) * | 2016-12-23 | 2017-08-01 | 深圳前海达闼云端智能科技有限公司 | Block generation method and device and block chain network |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN206021244U (en) * | 2016-05-13 | 2017-03-15 | 中国工商银行股份有限公司 | A kind of data collecting system under distributed computer cluster |
CN106330431A (en) * | 2016-08-29 | 2017-01-11 | 北京瑞卓喜投科技发展有限公司 | Data processing method, apparatus and system based on block chain technology |
EP3523744B1 (en) * | 2016-10-06 | 2021-04-07 | Mastercard International Incorporated | Method and system for identity and credential protection and verification via blockchain |
CN107704493B (en) * | 2017-08-23 | 2021-02-26 | 苏州朗润创新知识产权运营有限公司 | Method and system for providing product traceability |
CN107592318A (en) * | 2017-09-22 | 2018-01-16 | 深圳中迈数字医疗技术有限公司 | It is a kind of that the shared method and system of clinical data are realized by block chain |
CN108123936B (en) * | 2017-12-13 | 2021-04-13 | 北京科技大学 | Access control method and system based on block chain technology |
CN108076063A (en) * | 2017-12-25 | 2018-05-25 | 天津理工大学 | Network O&M auditing method, server terminal and client based on block chain |
WO2019127153A1 (en) * | 2017-12-27 | 2019-07-04 | 深圳达闼科技控股有限公司 | Block generation method and apparatus, storage medium, and block chain network |
-
2018
- 2018-08-28 CN CN201810985676.9A patent/CN109246206B/en active Active
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107005574A (en) * | 2016-12-23 | 2017-08-01 | 深圳前海达闼云端智能科技有限公司 | Block generation method and device and block chain network |
Also Published As
Publication number | Publication date |
---|---|
CN109246206A (en) | 2019-01-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN109165945B (en) | Representative node device election method and device, computer device and storage medium | |
CN108768665B (en) | Block chain generation method and device, computer equipment and storage medium | |
US10965466B2 (en) | Estimable proof-of-work for blockchain | |
CN111427957B (en) | Block chain voting information verification method, device, equipment and storage medium | |
CN111445333B (en) | Block generation method, device, computer equipment and storage medium | |
Sun et al. | Voting-based decentralized consensus design for improving the efficiency and security of consortium blockchain | |
CN110602217B (en) | Block chain-based alliance management method, device, equipment and storage medium | |
CN112632629B (en) | Voting management method, device, medium and electronic equipment based on block chain | |
CN109636998A (en) | A kind of method and device drawn a lottery using block chain | |
CN113221163B (en) | Model training method and system | |
CN108898440A (en) | Flow exchanging method and device | |
CN113011883A (en) | Data processing method, device, equipment and storage medium | |
CN109087105A (en) | For digging the Hash Search method of mine, digging mine machine and block catenary system | |
CN111416709A (en) | Voting method, device, equipment and storage medium based on block chain system | |
CN113409078A (en) | Point issuing method, device, equipment and storage medium | |
CN111612457A (en) | Electronic voting method, device and storage medium based on block chain | |
CN111582935A (en) | Block chain-based integral mutual identification method and system | |
CN109246206B (en) | Generate and record the method and network of information | |
WO2021233109A1 (en) | Blockchain-based message processing method and apparatus, and device and storage medium | |
CN110990790A (en) | Data processing method and equipment | |
CN109101577A (en) | A kind of data circulation method, apparatus and system | |
CN112418819A (en) | Block chain system for integrity management of building enterprise | |
CN111680282A (en) | Node management method, device, equipment and medium based on block chain network | |
TWM568414U (en) | Blockchain counting system based on digital currency | |
CN112258184B (en) | Method, apparatus, electronic device and readable storage medium for freezing blockchain network |
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 |