CN105095794A - Verification method for dynamic cloud data integrity based on balanced Merkle Hash tree - Google Patents
Verification method for dynamic cloud data integrity based on balanced Merkle Hash tree Download PDFInfo
- Publication number
- CN105095794A CN105095794A CN201510427319.7A CN201510427319A CN105095794A CN 105095794 A CN105095794 A CN 105095794A CN 201510427319 A CN201510427319 A CN 201510427319A CN 105095794 A CN105095794 A CN 105095794A
- Authority
- CN
- China
- Prior art keywords
- son
- piecemeal
- depth
- hash tree
- node
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a verification method for dynamic cloud data integrity based on a balanced Merkle Hash tree. The verification method comprises following steps: achieving dynamic correction of files by partitioning uploaded files; signing each partitioned file as a leaf node in order to establish the balanced Merkle Hash tree in order to achieve dynamic audit of files; and introducing the idea of a balanced binary tree in order to increase time efficiency of dynamic audit and avoiding degeneration of the Merkle Hash Tree by different rotation modes.
Description
Technical field
The invention belongs to cloud technical field of memory, relate to a kind of dynamic data and data integrity verification method, be specifically related to the dynamic cloud data integrity verification method that a kind of plum based on balance agree Hash tree.
Background technology
Namely the storage that Cloud Server provider (CSP) provides serves is that significant data is deposited service on the remote server by a kind of organizational structure that allows.
Have benefited from cloud computing, user by data remote storage on cloud, and can enjoy good service and application from a configurable shared computation resource.But in fact, the essence that user loses outsourcing data is really occupied, this makes data integrity validation in cloud computing become challenge, especially under the limited environment of user's computing power.Therefore, allow data allow to be disclosed audit and just seem particularly important.So user can allow auditing by third party TPA go to audit the integrality of data.TPA need meet following two conditions:
(1) TPA can under the prerequisite of not accessing local data Audit data integrality, simultaneously can not cause online pressure to user again;
(2) TPA can not bring defect to data security.
Cloud computing is predicted to be the body frame structure of following IT enterprises.It concentrates on large data center data and application, even if the supvr of data can not be trusted completely, to such an extent as to creates a lot of safety problem.Therefore the data that introducing auditing by third party TPA replaces client to complete being stored in high in the clouds carry out integrity verification.The introducing of auditing by third party TPA makes the acceptable scale of client complete the checking of data integrity.Because the service in high in the clouds does not limit Backup Data, so the realization of dynamic data has very big promotion to practicality aspect.In order to effective implemention Data Dynamic, introducing plum is agree Hash tree (MerkleHashTree) and carries out integrity verification to piecemeal.
Consider actual conditions, user in most cases can at end-of-file supplement information.And existing insertion method does not consider the balance of MerkleHashTree, tree therefore can be caused to be degenerated to linear structure, reduce the time efficiency on-the-fly modified.
Summary of the invention
The present invention is based on the achievement in research of background technology, and utilize balanced binary tree construction, achieve dynamic data integrity verification.
The technical solution adopted in the present invention is: a kind of plum based on balance agree the dynamic cloud data integrity verification method of Hash tree, it is characterized in that, comprises the following steps:
Step 1: definition bilinear map e:G × G=G
t, wherein G is a Diffie-Hellman group, G
tbe another plain exponent number multiplication loop group, definition g is the generator of G;
Step 2: client chooses random value α ← Z
p, Z
pfor prime number, calculate v ← g
a, and define key sk=α, PKI pk=v;
Step 3: for each file, client carries out piecemeal F=(m to file F
1, m
2..., m
i, m
n), choose u ← G, each section technique is signed
then client is agree Hash tree structure root node R based on plum and is calculated the signature sig of R
sk(H (R)) ← (H (R))
α, wherein leaf node is the Hash of file block, then by F, { σ
i, sig
sk(H (R)) sends to server;
Step 4: when client-requested auditing by third party TPA carries out data integrity validation, auditing by third party TPA chooses random C piecemeal { S
1, S
2... S
c, and random value v is chosen to each piecemeal
i← Z
p, auditing by third party TPA sends application to server afterwards, and sends the set { v of piecemeal random value
iand C piecemeal under target set { S};
Step 5: server is respectively calculated as follows content after receiving the application of auditing by third party TPA:
Then by { μ, σ, H (m
i), { σ
iand C leaf node send to auditing by third party TPA to all brotgher of node information on root node path;
Step 6: auditing by third party TPA re-constructs plum according to the information that receives and agree Hash tree root node R, verifies afterwards:
e(sig
skH(R),g)＝e(H(R),g
α)；
If find, if above-mentioned two equatioies have any one not meet, then return false and show that data are tampered, otherwise return true and show to be verified.
As preferably, described in step 3, file F is carried out piecemeal F=(m
1, m
2..., m
i, m
n) after send to server after, modify to storing some piecemeals of file in the server, add a piecemeal or delete a piecemeal, need the corresponding signing messages in update server, data are dynamically updated.
As preferably, described modifies to piecemeal, its specific implementation process is that user selects a kth piecemeal, its content is revised as C* by C, then the cryptographic hash of this piecemeal becomes H (C*) from H (C), then upgrade plum agree Hash tree and generate new root node, store after finally giving client signature.
As preferably, described interpolation piecemeal, supposes that user will insert a piecemeal after kth piecemeal, supposes that the leaf node that kth piecemeal is corresponding is K, then divides following four kinds of situation process;
Situation one: LL type rotates;
If left son's degree of depth of nodes X deducts right son's degree of depth when being greater than 1, namely occur L-type non-equilibrium state, X is uneven node; Again for the left son of X, if its left son's degree of depth is greater than right son's degree of depth, be then LL type non-equilibrium state;
Rotation mode is: the father of the left son of X changes the father of X into, and X becomes the right son of the left son of X, and the right son of the left son of X becomes the left son of X;
Situation two: LR type rotates;
If there is L-type non-equilibrium state for X, but for the left son of X, the degree of depth of its right son is greater than left son, then occur LR type non-equilibrium state;
Rotation mode is: first make it to become LL type imbalance through once rotating, recycling LL type rotates and makes it balance;
Situation three: RR type rotates;
If left son's degree of depth of nodes X deducts right son's degree of depth when being less than-1, namely occur R type non-equilibrium state, X is uneven node; The right son for X, if its right son's degree of depth is greater than left son's degree of depth, be then RR type non-equilibrium state;
Rotation mode is: the father of the right son of X changes the father of X into, and X becomes the left son of the right son of X, and the left son of the right son of X becomes the right son of X;
Situation four: RL type rotates;
If there is R type non-equilibrium state for X, but for the right son of X, the degree of depth of its left son is greater than right son, then occur RL type non-equilibrium state;
Rotation mode is: first make it to become RR type imbalance through once rotating, recycling RR type rotates and makes it balance;
Above four kinds of spinning solutions all can not change the leaf node order that plum agree Hash tree.
As preferably, described deletion piecemeal, its specific implementation process is that user selects a kth piecemeal, supposes that the leaf node that a kth piecemeal is corresponding is K, the brotgher of node of father's node K of K is replaced, then delete the brotgher of node of K after deleting K; After completing deletion action, there will be the energy imbalance occurred in interpolation point of block operations, according to the method process energy imbalance herein of the energy imbalance occurred in process interpolation point of block operations.
Beneficial effect of the present invention: by carrying out piecemeal to the file uploaded, realize on-the-fly modifying file; Set up plum by signing to each blocked file as leafy node and agree Hash tree, realize the dynamic auditing to file; In order to improve the time efficiency of dynamic auditing, introduce the concept of balanced binary tree, the rotation of passage separation structure avoids plum to agree the degeneration of Hash tree.
Accompanying drawing explanation
Fig. 1: be the process flow diagram of the embodiment of the present invention;
Fig. 2: for the embodiment of the present invention tail of file repeatedly add piecemeal design sketch;
Fig. 3: be the LL type rotate effect figure of an interpolation piecemeal of the embodiment of the present invention;
Fig. 4: be the LR type rotate effect figure of an interpolation piecemeal of the embodiment of the present invention;
Fig. 5: be the RR type rotate effect figure of an interpolation piecemeal of the embodiment of the present invention;
Fig. 6: be the RL type rotate effect figure of an interpolation piecemeal of the embodiment of the present invention.
Specific embodiments
Understand for the ease of those of ordinary skill in the art and implement the present invention, below in conjunction with drawings and Examples, the present invention is described in further detail, should be appreciated that exemplifying embodiment described herein is only for instruction and explanation of the present invention, is not intended to limit the present invention.
Ask for an interview Fig. 1, a kind of plum based on balance provided by the invention agree the dynamic cloud data integrity verification method of Hash tree, comprises the following steps:
Step 1: definition bilinear map e:G × G=G
t, wherein G is a Diffie-Hellman group, G
tbe another plain exponent number multiplication loop group, definition g is the generator of G;
Step 2: client chooses random value α ← Z
p, Z
pfor prime number, calculate v ← g
a, and define key sk=α, PKI pk=v;
Step 3: for each file, client carries out piecemeal F=(m to file F
1, m
2..., m
i, m
n), choose u ← G, each section technique is signed
then client is agree Hash tree structure root node R based on plum and is calculated the signature sig of R
sk(H (R)) ← (H (R))
α, wherein leaf node is the Hash of file block, then by F, { σ
i, sig
sk(H (R)) sends to server;
Step 4: when client-requested auditing by third party TPA carries out data integrity validation, auditing by third party TPA chooses random C piecemeal { S
1, S
2... S
c, and random value v is chosen to each piecemeal
i← Z
p, auditing by third party TPA sends application to server afterwards, and sends the set { v of piecemeal random value
iand C piecemeal under target set { S}; When piecemeal damage ratio is t, the accuracy of audit is 1-(1-t)
c, as t=1%, as c=459, it has the accuracy rate of 99%.
Step 5: server is respectively calculated as follows content after receiving the application of auditing by third party TPA:
Then by { μ, σ, H (m
i), { σ
iand C leaf node send to auditing by third party TPA to all brotgher of node information on root node path;
Step 6: auditing by third party TPA re-constructs plum according to the information that receives and agree Hash tree root node R, afterwards
Checking:
e(sig
skH(R),g)＝e(H(R),g
α)；
If find, if above-mentioned two equatioies have any one not meet, then return false and show that data are tampered, otherwise return true and show to be verified.
In the agreement that the people such as Wang propose, can (insertion position is even) be that O (log (n)) completes insertion, deletion, amendment by time complexity in the ideal case, this be a kind of characteristic of this binary tree.But consideration actual conditions, user usually can modify or add a piecemeal by some piecemeals the file be stored in cloud, also needs the information such as the corresponding signature in update server immediately.But user's on-the-fly modifying or adding the failure that data integrity can not be caused to audit file.Such as, when user constantly adds piecemeal, tail of file in same position, as Fig. 2, then plum can be caused to agree the degeneration of Hash tree, reduce the time efficiency of audit.
The present invention, on the basis of people's researchs such as Wang, has made a kind of improvement of time complexity;
In the present embodiment, piecemeal is modified, its concrete development is that user selects a kth piecemeal, its content is revised as C* by C, then the cryptographic hash of this piecemeal becomes H (C*) from H (C), then upgrade plum agree Hash tree and generate new root node, store after finally giving client signature.Easily can find that determinative consuming time is the height that plum agree Hash tree, i.e. O (log (n)), wherein n is the piecemeal number of this file.
Add a piecemeal in the present embodiment, suppose that user will insert a piecemeal after kth piecemeal, suppose that the leaf node that kth piecemeal is corresponding is K, then divide following four kinds of situation process;
Ask for an interview Fig. 3, situation one: LL type rotates;
If left son's degree of depth of nodes X deducts right son's degree of depth when being greater than 1, namely occur L-type non-equilibrium state, X is uneven node; Again for the left son of X, if its left son's degree of depth is greater than right son's degree of depth, be then LL type non-equilibrium state;
Rotation mode is: the father of the left son of X changes the father of X into, and X becomes the right son of the left son of X, and the right son of the left son of X becomes the left son of X;
Ask for an interview Fig. 4, situation two: LR type rotates;
If there is L-type non-equilibrium state for X, but for the left son of X, the degree of depth of its right son is greater than left son, then occur LR type non-equilibrium state;
Rotation mode is: first make it to become LL type imbalance through once rotating, recycling LL type rotates and makes it balance;
Ask for an interview Fig. 5, situation three: RR type rotates;
If left son's degree of depth of nodes X deducts right son's degree of depth when being less than-1, namely occur R type non-equilibrium state, X is uneven node; The right son for X, if its right son's degree of depth is greater than left son's degree of depth, be then RR type non-equilibrium state;
Rotation mode is: the father of the right son of X changes the father of X into, and X becomes the left son of the right son of X, and the left son of the right son of X becomes the right son of X;
Ask for an interview Fig. 6, situation four: RL type rotates;
If there is R type non-equilibrium state for X, but for the right son of X, the degree of depth of its left son is greater than right son, then occur RL type non-equilibrium state;
Rotation mode is: first make it to become RR type imbalance through once rotating, recycling RR type rotates and makes it balance;
Above four kinds of spinning solutions all can not change the leaf node order that plum agree Hash tree.
Deletion piecemeal of the present embodiment, its specific implementation process is that user selects a kth piecemeal, supposes that the leaf node that a kth piecemeal is corresponding is K, the brotgher of node of father's node K of K is replaced, then delete the brotgher of node of K after deleting K; After completing deletion action, there will be the energy imbalance occurred in interpolation point of block operations, according to the method process energy imbalance herein of the energy imbalance occurred in process interpolation point of block operations.
The present invention is that one both can allow data owner benefit from this, can make it again the method for mutual trust indirectly.The feature of the method: (1) the method supports that user's outsourcing significant data is to CSP, and the dynamic operation that can complete on deblocking, (2) license to authenticated and receive up-to-date outsourcing data, (3) but allow to produce between data owner and CSP and indirectly trust, (4) data have the accessed authority can authorizing or recall outsourcing data.
Should be understood that, the part that this instructions does not elaborate all belongs to prior art.
Should be understood that; the above-mentioned description for preferred embodiment is comparatively detailed; therefore the restriction to scope of patent protection of the present invention can not be thought; those of ordinary skill in the art is under enlightenment of the present invention; do not departing under the ambit that the claims in the present invention protect; can also make and replacing or distortion, all fall within protection scope of the present invention, request protection domain of the present invention should be as the criterion with claims.
Claims (5)
1. agree a dynamic cloud data integrity verification method for Hash tree based on the plum balanced, it is characterized in that, comprise the following steps:
Step 1: definition bilinear map e:G × G=G
t, wherein G is a Diffie-Hellman group, G
tbe another plain exponent number multiplication loop group, definition g is the generator of G;
Step 2: client chooses random value α ← Z
p, Z
pfor prime number, calculate v ← g
a, and define key sk=α, PKI pk=v;
Step 3: for each file, client carries out piecemeal F=(m to file F
1, m
2..., m
i, m
n), choose u ← G, each section technique is signed
then client is agree Hash tree structure root node R based on plum and is calculated the signature sig of R
sk(H (R)) ← (H (R))
α, wherein leaf node is the Hash of file block, then by F, { σ
i, sig
sk(H (R)) sends to server;
Step 4: when client-requested auditing by third party TPA carries out data integrity validation, auditing by third party TPA chooses random C piecemeal { S
1, S
2... S
c, and random value v is chosen to each piecemeal
i← Z
p, auditing by third party TPA sends application to server afterwards, and sends the set { v of piecemeal random value
iand C piecemeal under target set { S};
Step 5: server is respectively calculated as follows content after receiving the application of auditing by third party TPA:
Then by { μ, σ, H (m
i), { σ
iand C leaf node send to auditing by third party TPA to all brotgher of node information on root node path;
Step 6: auditing by third party TPA re-constructs plum according to the information that receives and agree Hash tree root node R, verifies afterwards:
e(sig
skH(R),g)＝e(H(R),g
α)；
If find, if above-mentioned two equatioies have any one not meet, then return false and show that data are tampered, otherwise return true and show to be verified.
2. the plum based on balance according to claim 1 agree the dynamic cloud data integrity verification method of Hash tree, it is characterized in that: described in step 3, file F is carried out piecemeal F=(m
1, m
2..., m
i, m
n) after send to server after, modify to storing some piecemeals of file in the server, add a piecemeal or delete a piecemeal, need the corresponding signing messages in update server, data are dynamically updated.
3. the plum based on balance according to claim 2 agree the dynamic cloud data integrity verification method of Hash tree, it is characterized in that: described modifies to piecemeal, its specific implementation process is that user selects a kth piecemeal, its content is revised as C* by C, then the cryptographic hash of this piecemeal becomes H (C*) from H (C), then upgrade plum agree Hash tree and generate new root node, store after finally giving client signature.
4. the plum based on balance according to claim 2 agree the dynamic cloud data integrity verification method of Hash tree, it is characterized in that: described interpolation piecemeal, suppose that user will insert a piecemeal after kth piecemeal, suppose that the leaf node that kth piecemeal is corresponding is K, then divide following four kinds of situation process;
Situation one: LL type rotates;
If left son's degree of depth of nodes X deducts right son's degree of depth when being greater than 1, namely occur L-type non-equilibrium state, X is uneven node; Again for the left son of X, if its left son's degree of depth is greater than right son's degree of depth, be then LL type non-equilibrium state;
Rotation mode is: the father of the left son of X changes the father of X into, and X becomes the right son of the left son of X, and the right son of the left son of X becomes the left son of X;
Situation two: LR type rotates;
If there is L-type non-equilibrium state for X, but for the left son of X, the degree of depth of its right son is greater than left son, then occur LR type non-equilibrium state;
Rotation mode is: first make it to become LL type imbalance through once rotating, recycling LL type rotates and makes it balance;
Situation three: RR type rotates;
If left son's degree of depth of nodes X deducts right son's degree of depth when being less than-1, namely occur R type non-equilibrium state, X is uneven node; The right son for X, if its right son's degree of depth is greater than left son's degree of depth, be then RR type non-equilibrium state;
Rotation mode is: the father of the right son of X changes the father of X into, and X becomes the left son of the right son of X, and the left son of the right son of X becomes the right son of X;
Situation four: RL type rotates;
If there is R type non-equilibrium state for X, but for the right son of X, the degree of depth of its left son is greater than right son, then occur RL type non-equilibrium state;
Rotation mode is: first make it to become RR type imbalance through once rotating, recycling RR type rotates and makes it balance;
Above four kinds of spinning solutions all can not change the leaf node order that plum agree Hash tree.
5. the plum based on balance according to claim 2 agree the dynamic cloud data integrity verification method of Hash tree, it is characterized in that: described deletion piecemeal, its specific implementation process is that user selects a kth piecemeal, suppose that the leaf node that a kth piecemeal is corresponding is K, after deleting K, the brotgher of node of father's node K of K is replaced, then delete the brotgher of node of K; After completing deletion action, there will be the energy imbalance occurred in interpolation point of block operations, according to the method process energy imbalance herein of the energy imbalance occurred in process interpolation point of block operations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510427319.7A CN105095794A (en) | 2015-07-20 | 2015-07-20 | Verification method for dynamic cloud data integrity based on balanced Merkle Hash tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510427319.7A CN105095794A (en) | 2015-07-20 | 2015-07-20 | Verification method for dynamic cloud data integrity based on balanced Merkle Hash tree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN105095794A true CN105095794A (en) | 2015-11-25 |
Family
ID=54576193
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510427319.7A Pending CN105095794A (en) | 2015-07-20 | 2015-07-20 | Verification method for dynamic cloud data integrity based on balanced Merkle Hash tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105095794A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105760781A (en) * | 2016-03-02 | 2016-07-13 | 四川师范大学 | Storage method, restoration method and operation method of ordered and derivable large-data files |
| CN105787389A (en) * | 2016-03-02 | 2016-07-20 | 四川师范大学 | Cloud file integrity public audit evidence generating method and public auditing method |
| CN105868369A (en) * | 2016-03-30 | 2016-08-17 | 电子科技大学 | Data model verification system and method based on Merkle tree structure |
| CN106126722A (en) * | 2016-06-30 | 2016-11-16 | 中国科学院计算技术研究所 | A kind of prefix compound tree based on checking and method for designing |
| CN106612174A (en) * | 2016-08-26 | 2017-05-03 | 四川用联信息技术有限公司 | Data security verification and updating method supporting third-party administrator (TPA) in mobile cloud computing |
| CN106649702A (en) * | 2016-12-20 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | File storage method and apparatus of cloud storage system, and cloud storage system |
| CN107231370A (en) * | 2017-06-23 | 2017-10-03 | 成都鼎智汇科技有限公司 | A kind of data monitoring method based on cloud computing |
| CN108737109A (en) * | 2018-05-11 | 2018-11-02 | 北京奇虎科技有限公司 | Data proof of possession method, apparatus and system |
| CN108846133A (en) * | 2018-07-04 | 2018-11-20 | 东北大学 | Block chain storage organization based on B-M tree, B-M tree establish algorithm and lookup algorithm |
| CN109617702A (en) * | 2019-01-29 | 2019-04-12 | 深圳市先河系统技术有限公司 | Method, block chain node and the device with store function of information signature |
| CN109688103A (en) * | 2018-11-09 | 2019-04-26 | 杭州安恒信息技术股份有限公司 | The auditable encryption storage method of one kind and system |
| CN110008755A (en) * | 2019-03-21 | 2019-07-12 | 广东优世联合控股集团股份有限公司 | Dynamic data integrity verification system and method can be revoked in a kind of cloud storage |
| CN113055431A (en) * | 2021-01-13 | 2021-06-29 | 湖南天河国云科技有限公司 | Block chain-based industrial big data file efficient chaining method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130246810A1 (en) * | 2010-03-31 | 2013-09-19 | Security First Corp. | Systems and methods for securing data in motion |
| CN103716404A (en) * | 2013-12-31 | 2014-04-09 | 华南理工大学 | Remote data integrity authentication data structure in cloud environment and implement method thereof |
| CN103778387A (en) * | 2014-01-06 | 2014-05-07 | 中国科学技术大学苏州研究院 | Big-data dynamic memory integrity verification method based on lattice |
-
2015
- 2015-07-20 CN CN201510427319.7A patent/CN105095794A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130246810A1 (en) * | 2010-03-31 | 2013-09-19 | Security First Corp. | Systems and methods for securing data in motion |
| CN103716404A (en) * | 2013-12-31 | 2014-04-09 | 华南理工大学 | Remote data integrity authentication data structure in cloud environment and implement method thereof |
| CN103778387A (en) * | 2014-01-06 | 2014-05-07 | 中国科学技术大学苏州研究院 | Big-data dynamic memory integrity verification method based on lattice |
Non-Patent Citations (2)
| Title |
|---|
| QIAN WANG ET AL: ""Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing"", 《IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS》 * |
| 李素若等: "《数据结构（C语言描述）》", 31 July 2014, 中国水利水电出版社 * |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105787389A (en) * | 2016-03-02 | 2016-07-20 | 四川师范大学 | Cloud file integrity public audit evidence generating method and public auditing method |
| CN105760781A (en) * | 2016-03-02 | 2016-07-13 | 四川师范大学 | Storage method, restoration method and operation method of ordered and derivable large-data files |
| CN105760781B (en) * | 2016-03-02 | 2018-05-08 | 四川师范大学 | The storage method, restoration methods and operating method of large data files can be deduced in order |
| CN105787389B (en) * | 2016-03-02 | 2018-07-27 | 四川师范大学 | Cloud file integrality public audit evidence generation method and public audit method |
| CN105868369B (en) * | 2016-03-30 | 2019-10-01 | 电子科技大学 | A kind of data model verifying System and method for based on Merkle tree construction |
| CN105868369A (en) * | 2016-03-30 | 2016-08-17 | 电子科技大学 | Data model verification system and method based on Merkle tree structure |
| CN106126722A (en) * | 2016-06-30 | 2016-11-16 | 中国科学院计算技术研究所 | A kind of prefix compound tree based on checking and method for designing |
| CN106126722B (en) * | 2016-06-30 | 2019-10-18 | 中国科学院计算技术研究所 | A kind of prefix compound tree and design method based on verifying |
| CN106612174A (en) * | 2016-08-26 | 2017-05-03 | 四川用联信息技术有限公司 | Data security verification and updating method supporting third-party administrator (TPA) in mobile cloud computing |
| CN106649702A (en) * | 2016-12-20 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | File storage method and apparatus of cloud storage system, and cloud storage system |
| CN107231370A (en) * | 2017-06-23 | 2017-10-03 | 成都鼎智汇科技有限公司 | A kind of data monitoring method based on cloud computing |
| CN108737109A (en) * | 2018-05-11 | 2018-11-02 | 北京奇虎科技有限公司 | Data proof of possession method, apparatus and system |
| CN108846133A (en) * | 2018-07-04 | 2018-11-20 | 东北大学 | Block chain storage organization based on B-M tree, B-M tree establish algorithm and lookup algorithm |
| CN109688103A (en) * | 2018-11-09 | 2019-04-26 | 杭州安恒信息技术股份有限公司 | The auditable encryption storage method of one kind and system |
| CN109688103B (en) * | 2018-11-09 | 2021-07-16 | 杭州安恒信息技术股份有限公司 | Auditable encryption storage method |
| CN109617702A (en) * | 2019-01-29 | 2019-04-12 | 深圳市先河系统技术有限公司 | Method, block chain node and the device with store function of information signature |
| CN109617702B (en) * | 2019-01-29 | 2022-03-08 | 深圳市先河系统技术有限公司 | Message signing method, block chain node and device with storage function |
| CN110008755A (en) * | 2019-03-21 | 2019-07-12 | 广东优世联合控股集团股份有限公司 | Dynamic data integrity verification system and method can be revoked in a kind of cloud storage |
| CN110008755B (en) * | 2019-03-21 | 2023-12-26 | 广东优世联合控股集团股份有限公司 | Cloud storage revocable dynamic data integrity verification system and method |
| CN113055431A (en) * | 2021-01-13 | 2021-06-29 | 湖南天河国云科技有限公司 | Block chain-based industrial big data file efficient chaining method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105095794A (en) | Verification method for dynamic cloud data integrity based on balanced Merkle Hash tree | |
| CN110869967B (en) | System and method for parallel processing of blockchain transactions | |
| Chalaemwongwan et al. | Notice of Violation of IEEE Publication Principles: State of the art and challenges facing consensus protocols on blockchain | |
| US11626993B2 (en) | Network for improved verification speed with tamper resistant data | |
| Zheng et al. | Fair and dynamic proofs of retrievability | |
| CN112468302B (en) | Editable blockchain based on verifiable multiparty secret sharing | |
| CN103501352B (en) | A kind of cloud storage data method for auditing safely allowing group user identity to cancel | |
| CN114915404B (en) | Block chain data storage expansion model construction method oriented to Internet of things | |
| CN105320899A (en) | User-oriented cloud storage data integrity protection method | |
| CN106027245A (en) | Key sharing method and device | |
| CN105760781A (en) | Storage method, restoration method and operation method of ordered and derivable large-data files | |
| CN106612174A (en) | Data security verification and updating method supporting third-party administrator (TPA) in mobile cloud computing | |
| CN106961431A (en) | The method and system of role's symmetric cryptography proof of ownership | |
| CN112804272A (en) | Conflict calculation method of chameleon hash function and cuttable block chain account book structure | |
| CN103227780A (en) | Method for designing public auditable storage verifiable scheme for cloud data | |
| Khalifa et al. | Quantum attacks and defenses for proof-of-stake | |
| US20190044735A1 (en) | Method for managing the validation of messages relating to a message chain individually via a decentralised validation network | |
| CN103778387A (en) | Big-data dynamic memory integrity verification method based on lattice | |
| CN112565264B (en) | Cloud storage data integrity detection method based on block chain | |
| CN103916393A (en) | Cloud data privacy protection public auditing method based on symmetric keys | |
| Zhang et al. | Deconstructing Blockchains: Concepts, Systems, and Insights. | |
| CN106612171A (en) | Data soft recovery method in cloud storage | |
| Li | Research on e-commerce user information encryption technology based on Merkle hash tree | |
| CN103716404B (en) | Remote data integrity authentication data structure in cloud environment and implement method thereof | |
| CN116938521A (en) | Distributed digital identity trusted authentication method based on hierarchical storage |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20151125 |
|
| RJ01 | Rejection of invention patent application after publication |