CN108959035A - A kind of method of entry validity in test block chain database data structure - Google Patents
A kind of method of entry validity in test block chain database data structure Download PDFInfo
- Publication number
- CN108959035A CN108959035A CN201810750011.XA CN201810750011A CN108959035A CN 108959035 A CN108959035 A CN 108959035A CN 201810750011 A CN201810750011 A CN 201810750011A CN 108959035 A CN108959035 A CN 108959035A
- Authority
- CN
- China
- Prior art keywords
- block
- verifying system
- group
- block chain
- identifier
- 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.)
- Withdrawn
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/30—Monitoring
- G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
- G06F11/3034—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a storage system, e.g. DASD based or network based
Landscapes
- Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Quality & Reliability (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of methods of entry validity in test block chain database data structure, it is characterized in that, the described method includes: at least one block chain node server, signal is received from FTP client FTP with the registered events in database data structure, the database data structure includes block chain, it again include a series of pieces of sequence link, so that each piece at least encodes previous piece of Partial State Information；Creation includes the block of the event；Block is submitted at least one verifying system, and for ratifying each verifying system for the block into block chain, the identifier including the verifying system in relevant block；If one group of selected verifying system approved block, using the block as the recent entry input in block chain；And the receipt of FTP client FTP is returned to, the receipt at least encodes the identifier of the block and ratifies the identifier of the verifying system of the block, thus checks and accepts if the group verifying system meets, which can then be verified as effectively.
Description
Technical field
The present invention relates to distributed computing fields, in particular in a kind of test block chain database data structure
The method of entry validity.
Background technique
Block chain is that the novel of computer technologies such as Distributed Storage, point-to-point transmission, common recognition mechanism, Encryption Algorithm answer
Use mode.So-called common recognition mechanism is that the mathematical algorithm established between different nodes and trust, obtain equity is realized in block catenary system.
It is, in general, that block catenary system is made of data Layer, network layer, common recognition layer, excitation layer, contract layer and application layer.Wherein, data
Layer encapsulates bottom data block and the basic datas such as relevant data encryption and timestamp and rudimentary algorithm；Network layer is then wrapped
Include distributed networking mechanism, data dissemination mechanism and data authentication mechanism etc.；Know together layer predominant package network node it is all kinds of total
Know algorithm；Economic factor is integrated into block chain technical system by excitation layer, main issuing mechanism including economic incentives and
Distribution mechanism etc.；All kinds of scripts of contract layer predominant package, algorithm and intelligent contract, are the bases of block chain programmable features；It answers
The various application scenarios and case of block chain are then encapsulated with layer.In the model, chain type block structure, distribution based on timestamp
The common recognition mechanism of formula node, based on common recognition calculate power economic incentives and flexible programmable intelligent contract be block chain technology most
Representative innovative point.Due to using distributed accounting and storage, there is no the hardware of centralization or management organization, arbitrary nodes
Rights and duties be all it is impartial, data block in system is tieed up jointly by the node in whole system with maintenance function
Shield.System be it is open, in addition to the private information of Trading parties be encrypted other than, the data of block chain disclose owner, any
People can pass through disclosed interface polls block chain data and exploitation related application, therefore whole system information highly transparent.
Block chain, which is used, makes the institute in whole system based on consensus specification and agreement (such as a set of open and clear algorithm)
There is node can be in the exchange data for going the free safety of the environment trusted, so that the trust to " people " has been changed to the letter to machine
Appoint, any artificial intervention does not work.Once information is by verifying and is added to block chain, permanent will store,
Unless can control simultaneously be more than in system 51% node, be otherwise to the modification of database on individual node it is invalid,
Therefore the data stability and reliability of block chain are high.Since the exchange between node follows fixed algorithm, data are handed over
It is mutually to be not necessarily to trust (rules of order in block chain can voluntarily judge whether activity is effective), therefore counterparty need not pass through
The mode of public identity allows other side to oneself generation trust, very helpful to the accumulation of credit.
Block chain as future generation computer system, the practical problem urgently handled in practical application there are also it is many not
It is proposed specific solution.
Summary of the invention
The invention proposes a kind of method of entry validity in test block chain database data structure, feature exists
In, which comprises at least one block chain node server, signal is received in database number from FTP client FTP
According to registered events in structure, the database data structure includes block chain, and a series of pieces including sequence link, so that often
A block at least encodes previous piece of Partial State Information；Creation includes the block of the event；Block is submitted at least one verifying
System, and for ratifying each verifying system for the block into block chain, including the verifying system in relevant block
Identifier；If one group of selected verifying system approved block, using the block as the recent entry input in block chain；And
And the receipt of FTP client FTP is returned to, the receipt at least encodes the identifier of the block and ratifies the mark of the verifying system of the block
Know symbol, is thus checked and accepted if the group verifying system meets, which can then be verified as effectively.Standard.
Further, the identifier for receiving the verifying system that standard is at least number of thresholds is included in described piece simultaneously
Therefore it is included in corresponding receipt.
Further, described to receive the identifier that standard is at least one of selected one group of verifying system and be included in
In described piece and therefore it is included in corresponding receipt.
Further, wherein each identifier includes the digital certificate of corresponding verifying system.
Further, wherein each identifier includes the digital document using the PKI signature signature of corresponding verifying system.
Specific embodiment
In order to enable the objectives, technical solutions, and advantages of the present invention are more clearly understood, below in conjunction with embodiment, to this
Invention is further elaborated；It should be appreciated that described herein, the specific embodiments are only for explaining the present invention, and does not have to
It is of the invention in limiting.To those skilled in the art, after access is described in detail below, other systems of the present embodiment
System, method and/or feature will become obvious.All such additional systems, method, feature and advantage are intended to be included in
It in this specification, is included within the scope of the invention, and by the protection of the appended claims.In description described in detail below
The other feature of the disclosed embodiments, and these characteristic roots will be apparent according to described in detail below.
Embodiment one.
This gives a kind of method of entry validity in test block chain database data structure, feature exists
In, which comprises at least one block chain node server, signal is received in database number from FTP client FTP
According to registered events in structure, the database data structure includes block chain, and a series of pieces including sequence link, so that often
A block at least encodes previous piece of Partial State Information；Creation includes the block of the event；Block is submitted at least one verifying
System, and for ratifying each verifying system for the block into block chain, including the verifying system in relevant block
Identifier；If one group of selected verifying system approved block, using the block as the recent entry input in block chain；And
And the receipt of FTP client FTP is returned to, the receipt at least encodes the identifier of the block and ratifies the mark of the verifying system of the block
Know symbol, is thus checked and accepted if the group verifying system meets, which can then be verified as effectively.Further, described to connect
It is that identifier that at least number of thresholds is verified system is included in described piece and is therefore included in corresponding receipt by standard.
Further, described to receive the identifier that standard is at least one of selected one group of verifying system and be included in described piece
And therefore it is included in corresponding receipt.Further, wherein each identifier includes the digital certificate of corresponding verifying system.Into
One step, wherein each identifier includes the digital document using the PKI signature signature of corresponding verifying system.
Embodiment two.
A kind of method of entry validity in test database data structure, comprising: taken at least one block chain node
It is engaged in device, receives signal from FTP client FTP with the registered events in database data structure, the database data structure packet
Block chain is included, and a series of pieces including sequence link, so that each piece at least encodes previous piece of Partial State Information；?
In at least selected block of block chain after original block, the expression including the history Hash tree with highest level root, and
It is inputted as lowest level, derived leaf input value selection block, institute from the block specific information being stored in front of at least one
The data that block specific information coding corresponds to each piece of each event for including are stated, leaf input value and intermediate history tree node are passed through
The iteration of value, pairs of functional group is total to calculate the highest level root；In block Qualify Phase, by having from included in what is claimed
The root of highest level is recalculated to verify and claim effective block in the expression of history Hash tree in effect block, including at least one
The information of a block in preceding selection, and receiving is it is said that active block only in the highest level root recalculated and is initially relevant block
It is just effective when the highest level root of calculating is identical.
The present embodiment is special, and further including is one of multiple events by event registration, and the multiple event passes through iteration
Hash is combined using block Hash tree in pairs, until calculating single root tuber value；For each thing registered in block
Part returns to a receipt, the identifier and block brother's Hash tree value of the receipt at least encoding block, by right to FTP client FTP
The iteration of the event of block, is recalculated in pairs, can recalculate root tuber value brother's Hash tree value；Therefore, if counting again
When calculating the block Hash tree path indicated by block brother's value, pass through block Hash tree until the faithful representation of event from event, then it can be with
Then the so-called faithful representation of verifying event is effectively comprised in block, obtains identical root tuber value, is included in receipt, and
And leaf input value of the root tuber value as relevant block is submitted, a series of block chain blocks are also grouped into block group；For each
Group, calculates individually group history Hash tree, and each Hash tree has the root of relevant block group；And each group of root is stored
In first block of group history Hash tree followed by, so that the initial input value of group followed by is to previous group
The root of history Hash tree is encoded.And by constructing all previous blocks in the previous block for each of described group piece
Tree input value Hash tree, the part group history Hash tree of each piece of sequence gradually increased in calculating group.Same group, each
Part group history Hash tree has part group root.Wherein, a series of block chain blocks are grouped into block group；For each
Group, calculates individually group history Hash tree, and each Hash tree has the root of relevant block group；It is stored in first piece of every chunking
The expression of the entire history Hash tree of previous chunking, so that every group of initial input value compiles the history Hash tree of previous group
Code.Special its is gone back further include: the preceding section of storage and digital signature history Hash tree；And under after front portion
One selected BOB(beginning of block) restarts and stores in newly created piece newly, and the history Hash tree gradually constructed has and goes through
The root of the front portion of history Hash tree is as initial Hash tree input value.And about third party is interested can not be anti-
The root of the preceding section of history Hash tree is issued in the media refuted.And by new most to each of a series of pieces additions
Rudimentary leaf node and the root for recalculating history Hash tree, are stepped up history Hash tree；From history Hash tree delete with
The part of polymerization corresponding selected the lowermost level node collection and tree of selected set；Calculate the selected part root gathered
Value, and indicate the selected set of deletion as corresponding part root in history Hash tree.Certainly, further include: mention block
At least one verifying system is given, and for ratifying each verifying system for the block into block chain, is included in corresponding
The identifier of verifying system in block；If one group of selected verifying system approved block, using the block as in block chain
Recent entry input；And the identifier for ratifying the verifying system of the block is included at least in receipt.
Embodiment three.
In the present embodiment, it constructs first and a kind of is for entry validity in test database data structure
System, comprising: at least one block chain node server receives signal from FTP client FTP to register in database data structure
Event, the database data structure include block chain, include again block chain include sequence link a series of pieces so that often
A block at least encodes previous piece of Partial State Information；Include at least selected block for block chain after a start block
The expression of history Hash tree with highest level root, and inputted as lowest level, it is specific from the block being stored therein
The device of leaf input value derived from information.At least one before described piece of specific piece, described piece of specific information coding correspond to
In the data for each event that relevant block includes, for the iteration by leaf input value and intermediate history burl point value, pairs of function
It can combine to calculate the device of the highest level root；Entity is verified, in block Qualify Phase, by claiming effectively from being included in
The expression of history Hash tree in block recalculates the root of highest level to verify and claim effective block, including it is selected extremely
The information of a few previous message prevents, and only when the highest level root recalculated and is initially what relevant block calculated
When highest level root is identical, it is effective just to receive claimed active block.
Its further include: coordinate system, be provided: for being one of multiple events by event registration, the multiple event makes
It is combined with block Hash tree by the pairs of hash of iteration, until calculating single root tuber value；And for being registered in block
Each event, to FTP client FTP return a receipt, the identifier and block brother's Hash tree of the receipt at least encoding block
Value, makes it possible to recalculate event in couples by iteration to recalculate root tuber value.Prevent fraternal Hash tree value；Therefore,
If true until event by block Hash tree from event when recalculating the block Hash tree path indicated by block brother's value
It indicates, then the so-called faithful representation that can then verify event is effectively comprised in block, obtains identical root tuber value, include
In receipt.
It optionally, further include the device of leaf input value for submitting root tuber value as relevant block.
Optionally, further includes: for a series of block chain blocks to be grouped into the device of block group, for each group, meter
Individually group history Hash tree is calculated, each Hash tree has the root of relevant block group, and for storing root.Back to back group is gone through
One group of each of first block of history Hash tree, so that the initial input value of group followed by encodes previous group
History Hash tree root.
It optionally, further include for the Hash by the tree input value for each of described group piece of all previous blocks of construction
Tree, to calculate the device of the part group history Hash tree of each block series gradually increased in group.In the same set, each part
Group history Hash tree has part group root.
Alternatively, further includes: for a series of block chain blocks to be grouped into the device of block group for each group, use
In calculating individually group history Hash tree, each Hash tree has the root for relevant block group, and indicates for storing.Every
In the entire history Hash tree of previous chunking in first piece of chunking, so that history of every group of the initial input value to previous group
Hash tree is encoded.
And, further includes: for storing the device with the preceding section of digital signature history Hash tree；Also, from previous
Next selected BOB(beginning of block) after part, for restarting and storing in newly created piece with before history Hash tree
The new history Hash tree gradually constructed of the root of a part is as initial Hash tree input value.
It further include the front portion for issuing the history Hash tree in relative to the interested medium of third party
The device of root.Further include: for by each of a series of pieces new lowermost level leaf nodes of addition and recalculating
The root of history Hash tree is stepped up the device of history Hash tree；For deleting selected one group from history Hash tree
The part corresponding with the polymerization of selected set of lowermost level node and tree；Also, in order to calculate the selected part gathered
Root simultaneously indicates the selected set deleted as corresponding part root in history Hash tree.And for by block submit to
The device of few verifying system, and for ratifying each verifying system for the block into block chain, it is included in corresponding
The selected verifying system approved block of the identifier of verifying system in block and one group, for as in block chain most
New entry input block, and include at least the identifier for ratifying the verifying system of the block.
Example IV.
In the present embodiment, it constructs first and a kind of is for entry validity in test database data structure
System, comprising: at least one block chain node server receives signal from FTP client FTP to register in database data structure
Event, the database data structure include block chain, include again block chain include sequence link a series of pieces so that often
A block at least encodes previous piece of Partial State Information；Include at least selected block for block chain after a start block
The expression of history Hash tree with highest level root, and inputted as lowest level, it is specific from the block being stored therein
The device of leaf input value derived from information.At least one before described piece of specific piece, described piece of specific information coding correspond to
In the data for each event that relevant block includes, for the iteration by leaf input value and intermediate history burl point value, pairs of function
It can combine to calculate the device of the highest level root；Entity is verified, in block Qualify Phase, by claiming effectively from being included in
The expression of history Hash tree in block recalculates the root of highest level to verify and claim effective block, including it is selected extremely
The information of a few previous message prevents, and only when the highest level root recalculated and is initially what relevant block calculated
When highest level root is identical, it is effective just to receive claimed active block.
Its further include: coordinate system, be provided: for being one of multiple events by event registration, the multiple event makes
It is combined with block Hash tree by the pairs of hash of iteration, until calculating single root tuber value；And for being registered in block
Each event, to FTP client FTP return a receipt, the identifier and block brother's Hash tree of the receipt at least encoding block
Value, makes it possible to recalculate event in couples by iteration to recalculate root tuber value.Prevent fraternal Hash tree value；Therefore,
If true until event by block Hash tree from event when recalculating the block Hash tree path indicated by block brother's value
It indicates, then the so-called faithful representation that can then verify event is effectively comprised in block, obtains identical root tuber value, include
In receipt.
It optionally, further include the device of leaf input value for submitting root tuber value as relevant block.
Optionally, further includes: for a series of block chain blocks to be grouped into the device of block group, for each group, meter
Individually group history Hash tree is calculated, each Hash tree has the root of relevant block group, and for storing root.Back to back group is gone through
One group of each of first block of history Hash tree, so that the initial input value of group followed by encodes previous group
History Hash tree root.
It optionally, further include for the Hash by the tree input value for each of described group piece of all previous blocks of construction
Tree, to calculate the device of the part group history Hash tree of each block series gradually increased in group.In the same set, each part
Group history Hash tree has part group root.
Alternatively, further includes: for a series of block chain blocks to be grouped into the device of block group for each group, use
In calculating individually group history Hash tree, each Hash tree has the root for relevant block group, and indicates for storing.Every
In the entire history Hash tree of previous chunking in first piece of chunking, so that history of every group of the initial input value to previous group
Hash tree is encoded.
And, further includes: for storing the device with the preceding section of digital signature history Hash tree；Also, from previous
Next selected BOB(beginning of block) after part, for restarting and storing in newly created piece with before history Hash tree
The new history Hash tree gradually constructed of the root of a part is as initial Hash tree input value.
It further include the front portion for issuing the history Hash tree in relative to the interested medium of third party
The device of root.Further include: for by each of a series of pieces new lowermost level leaf nodes of addition and recalculating
The root of history Hash tree is stepped up the device of history Hash tree；For deleting selected one group from history Hash tree
The part corresponding with the polymerization of selected set of lowermost level node and tree；Also, in order to calculate the selected part gathered
Root simultaneously indicates the selected set deleted as corresponding part root in history Hash tree.And for by block submit to
The device of few verifying system, and for ratifying each verifying system for the block into block chain, it is included in corresponding
The selected verifying system approved block of the identifier of verifying system in block and one group, for as in block chain most
New entry input block, and include at least the identifier for ratifying the verifying system of the block.
Here a kind of method of entry validity in test database data structure also is provided for the system, comprising:
In at least one block chain node server, signal is received in database data structure from FTP client FTP
Registered events, the database data structure include block chain, but including sequence link a series of pieces so that each piece at least
Encode previous piece of Partial State Information；In at least selected block of block chain after a start block, including there is the superlative degree
The expression of the history Hash tree of other root, and inputted as lowest level, from the specific letter of block being stored in front of at least one
Derived leaf input value selection block in breath, described piece of specific information coding correspond to the number of each piece of each event for including
According to by the iteration of leaf input value and intermediate history burl point value, pairs of functional group is total to calculate the highest level root；In block
Qualify Phase, by from include history Hash tree in claimed active block expression in recalculate the root of highest level
Value claims effective block to verify, including at least one the block of preceding selection information, and receive it is said that active block only again
The highest level root of calculating be initially relevant block calculate highest level root it is identical when just it is effective.This method further include by
Event registration is one of multiple events, and the multiple event is combined by the pairs of hash of iteration using block Hash tree, directly
Until calculating single root tuber value；For each event registered in block, a receipt is returned to FTP client FTP, it is described
The identifier and block brother's Hash tree value of receipt at least encoding block are recalculated in pairs by the iteration of the event to block, can
Recalculate root tuber value brother's Hash tree value；Therefore, if when recalculating the block Hash tree path indicated by block brother's value,
The so-called faithful representation of event then can be then verified by effectively until the faithful representation of event from event by block Hash tree
It is included in block, obtains identical root tuber value, is included in receipt, and submit leaf input value of the root tuber value as relevant block,
A series of block chain blocks are also grouped into block group by it；For each group, individually group history Hash tree, each Hash are calculated
Set the root with relevant block group；And by each group of root be stored in followed by group history Hash tree first block
In, so that the initial input value of group followed by encodes the root of previous group of history Hash tree.And by being
The Hash tree of the tree input value of all previous blocks in each of the described group piece of construction previous block, each piece in calculating group
The part group history Hash tree of sequence gradually increased.Same group, each part group history Hash tree has part group root.Its
In, a series of block chain blocks are grouped into block group；For each group, individually group history Hash tree, each Hash are calculated
Set the root with relevant block group；The expression that the entire history Hash tree of previous chunking is stored in first piece of every chunking, makes
Every group of initial input value is obtained to encode the history Hash tree of previous group.Special its is gone back further include: storage and number label
The preceding section of name history Hash tree；And from next selected BOB(beginning of block) after front portion, restarts and created newly
It is stored in the block built newly, the history Hash tree gradually constructed, the root of the front portion with history Hash tree is as just
Beginning Hash tree input value.And the previous of history Hash tree is being issued in the media that can not be refuted interested about third party
Partial root.And by each of a series of pieces new lowermost level leaf nodes of addition and recalculating history Hash tree
Root, be stepped up history Hash tree；It is deleted from history Hash tree corresponding with the polymerization of selected set selected
The part of the lowermost level node collection and tree selected；The selected part root gathered is calculated, and indicates deletion in history Hash tree
Selected set is used as corresponding part root.Certainly, further include: block is submitted at least one verifying system, and for
Each verifying system of the approval for the block into block chain, the identifier including the verifying system in relevant block；If one
Selected verifying system approved block of group, then using the block as the recent entry input in block chain；And in receipt extremely
Few includes the identifier for ratifying the verifying system of the block.
Although describing the present invention by reference to various embodiments above, but it is to be understood that of the invention not departing from
In the case where range, many changes and modifications can be carried out.Therefore, be intended to foregoing detailed description be considered as it is illustrative and
It is unrestricted, and it is to be understood that following following claims (including all equivalents) is intended to limit spirit and model of the invention
It encloses.The above embodiment is interpreted as being merely to illustrate the present invention rather than limit the scope of the invention.It is reading
After the content of record of the invention, technical staff can be made various changes or modifications the present invention, these equivalence changes and
Modification equally falls into the scope of the claims in the present invention.
Claims (5)
1. a kind of method of entry validity in test block chain database data structure, which is characterized in that the described method includes:
In at least one block chain node server, signal is received to register thing in database data structure from FTP client FTP
Part, the database data structure include block chain, and a series of pieces including sequence link, so that before each piece at least encodes
The Partial State Information of one block；Creation includes the block of the event；Block is submitted at least one verifying system, and for criticizing
Mutatis mutandis each verifying system in the block for entering block chain, the identifier including the verifying system in relevant block；If one group
Selected verifying system approved block, then input the block as the recent entry in block chain；And return to client
The receipt of system, the receipt at least encode the block identifier and ratify the block verifying system identifier, thus if
The group verifying system, which meets, checks and accepts, then the block can be then verified as effectively.
2. the method according to claim 1, wherein described receive the verifying system that standard is at least number of thresholds
Identifier be included in described piece and be therefore included in corresponding receipt.
3. according to the method described in claim 2, it is characterized in that, the standard that receives is in selected one group of verifying system
The identifier of at least one be included in described piece and be therefore included in corresponding receipt.
4. method as claimed in claim 3, which is characterized in that each identifier includes the digital certificate of corresponding verifying system.
5. method as claimed in claim 4, which is characterized in that each identifier includes being signed using the PKI of corresponding verifying system
The digital document of name signature.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810750011.XA CN108959035A (en) | 2018-07-10 | 2018-07-10 | A kind of method of entry validity in test block chain database data structure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810750011.XA CN108959035A (en) | 2018-07-10 | 2018-07-10 | A kind of method of entry validity in test block chain database data structure |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108959035A true CN108959035A (en) | 2018-12-07 |
Family
ID=64482435
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810750011.XA Withdrawn CN108959035A (en) | 2018-07-10 | 2018-07-10 | A kind of method of entry validity in test block chain database data structure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108959035A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106991148A (en) * | 2017-03-27 | 2017-07-28 | 西安电子科技大学 | It is a kind of to support the full database authentication system and method for updating operation |
| CN107257340A (en) * | 2017-06-19 | 2017-10-17 | 阿里巴巴集团控股有限公司 | A kind of authentication method, authentication data processing method and equipment based on block chain |
| CN108027867A (en) * | 2015-07-14 | 2018-05-11 | Fmr有限责任公司 | Calculate efficient transfer accounts processing, audit and searcher, method and system |
| US20180189312A1 (en) * | 2016-12-30 | 2018-07-05 | Guardtime Ip Holdings Limited | Event Verification Receipt System and Methods |
-
2018
- 2018-07-10 CN CN201810750011.XA patent/CN108959035A/en not_active Withdrawn
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108027867A (en) * | 2015-07-14 | 2018-05-11 | Fmr有限责任公司 | Calculate efficient transfer accounts processing, audit and searcher, method and system |
| US20180189312A1 (en) * | 2016-12-30 | 2018-07-05 | Guardtime Ip Holdings Limited | Event Verification Receipt System and Methods |
| CN106991148A (en) * | 2017-03-27 | 2017-07-28 | 西安电子科技大学 | It is a kind of to support the full database authentication system and method for updating operation |
| CN107257340A (en) * | 2017-06-19 | 2017-10-17 | 阿里巴巴集团控股有限公司 | A kind of authentication method, authentication data processing method and equipment based on block chain |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6939791B2 (en) | Bulletin board information management system | |
| CN109583885B (en) | Round control of rewritable block chains | |
| CN112968764B (en) | Multilink cipher logic block chain | |
| CN110008720B (en) | Dynamic data tracing method and device for Internet of things based on alliance chain | |
| Barsoum et al. | Provable multicopy dynamic data possession in cloud computing systems | |
| CN109450638A (en) | Electronic component data management system and method based on block chain | |
| Lee et al. | Modifiable public blockchains using truncated hashing and sidechains | |
| CN111177800B (en) | Block chain-based data processing method and device and electronic equipment | |
| Ma et al. | Blockchain-based mechanism for fine-grained authorization in data crowdsourcing | |
| CN111507709A (en) | Data traceability system | |
| CN102891856B (en) | Safe access method between plural entity and plural entity identity relaying party | |
| CN113312574A (en) | Cloud data integrity auditing method based on block chain | |
| Osmanoglu et al. | An effective yield estimation system based on blockchain technology | |
| CN110225012B (en) | Method for checking and updating ownership of outsourced data based on alliance chain | |
| CN107832626A (en) | Structured data right confirming method oriented to data circulation | |
| US20220191048A1 (en) | Cryptographically Verifiable, Portable Certificate | |
| CN113554421A (en) | Police affair resource data governance cooperation method based on block chain | |
| CN115270145A (en) | User electricity stealing behavior detection method and system based on alliance chain and federal learning | |
| CN114693241A (en) | Block chain-based electronic resume system and implementation method thereof | |
| Xiao et al. | Multiple-file remote data checking for cloud storage | |
| Wang et al. | Housing rental scheme based on redactable blockchain | |
| CN108874631A (en) | A kind of system for entry validity in test database data structure | |
| CN108959035A (en) | A kind of method of entry validity in test block chain database data structure | |
| CN116527322A (en) | Combined credit investigation method and device based on block chain and privacy calculation | |
| CN114362974B (en) | Hash tree-based data resource authorization and authentication method, device and system |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20181207 |
|
| WW01 | Invention patent application withdrawn after publication |