System and method for verification of data transferred among several data storages

Patent metadata

Field	Value
Publication number	US-10938571-B2
Application number	US-201715790140-A
Country	US
Kind code	B2
Filing date	Oct 23, 2017
Priority date	Oct 26, 2016
Publication date	Mar 2, 2021
Grant date	Mar 2, 2021

Abstract

Disclosed are system and method for verification of data transferred among several data storages. An exemplary method includes: calculating first hash-sums of the data during an initial placement in a data storage; transmitting the first hash-sums to at least one blockchain network; detecting a transfer of the data to a new data storage; calculating second hash-sums of the data after a placement of the data in the new data storage; transmitting the second hash-sums to the at least one blockchain network; comparing the first and second hash-sums of the data; and determining data immutability after the transfer of the data from the data storage to the new data storage based at least on results of the comparing.

First claim

What is claimed is:

1. A method for verification of data stored in multiple data storages, the method comprising:
calculating, by a processor, a plurality of hash values for a plurality of data blocks comprised in the data;
calculating, by the processor, first hash-sums of the data during an initial placement in a data storage, wherein the first hash-sums is calculated as a root hash of a Merkle tree data structure comprising the plurality of hash values when an amount of data blocks exceeds a threshold amount and wherein the first hash-sums remains as a set of individual hash values for data blocks when the amount of data blocks does not exceed the threshold amount;
transmitting the first hash-sums to at least one blockchain network;

in response to detecting a transfer of the data to a new data storage, calculating, by the processor, second hash-sums of the data after a placement of the data in the new data storage, wherein the second hash-sums is calculated as a root hash of another Merkle tree data structure comprising another plurality of hash values of the plurality of data blocks in the transferred data when the amount of data blocks exceeds the threshold amount and wherein the second hash-sums remains as a set of individual hash values for the data blocks in the transferred data when the amount of data blocks does not exceed the threshold amount;
transmitting the second hash-sums to the at least one blockchain network;
comparing the first and second hash-sums of the data; and
verifying, by the processor, data immutability after the transfer of the data from the data storage to the new data storage based at least on results of the comparing;
wherein the verifying comprises detecting a change of the root hash after each data transfer based at least on comparing a new root hash calculated after the data being saved in the new data storage and a previous root hash that was recorded in the at least one blockchain network prior to the data transfer.

2. The method according to claim 1 , further comprising:
detecting an additional transfer of the data between two different data storages;
calculating, by the processor, third hash-sums of the data during the additional transfer; and
transmitting the third hash-sums of the data to the at least one blockchain network.

3. The method according to claim 2 , wherein calculating, by the processor, the first, second, and third hash-sums of the data during each data transfer comprises:
calculating hash-sums for each block of the data; and
pairing and hashing the hash-sums for each block of the data to determine the root hash of data.

4. The method according to claim 2 , wherein each of the first, second, and third hash-sums of the data during each data transfer is the root hash of the data.

5. The method according to claim 1 , wherein the at least one blockchain network comprises a plurality of computing nodes, each computing node being configured to maintain a copy of a continuously-growing list of data records saved in the at least one blockchain network.

6. A system for verification of data stored in multiple data storages, the system comprising:
a computer processor configured to:
calculate a plurality of hash values for a plurality of data blocks comprised in the data;
calculate first hash-sums of the data during an initial placement in a data storage, wherein the first hash-sums is calculated as a root hash of a Merkle tree data structure comprising the plurality of hash values when an amount of data blocks exceeds a threshold amount and wherein the first hash-sums remains as a set of individual hash values for data blocks when the amount of data blocks does not exceed the threshold amount;
transmit the first hash-sums to at least one blockchain network;
in response to detecting a transfer of the data to a new data storage, calculate second hash-sums of the data after a placement of the data in the new data storage, wherein the second hash-sums is calculated as a root hash of another Merkle tree data structure comprising another plurality of hash values of the plurality of data blocks in the transferred data when the amount of data blocks exceeds the threshold amount and wherein the second hash-sums remains as a set of individual hash values for the data blocks in the transferred data when the amount of data blocks does not exceed the threshold amount;
transmit the second hash-sums to the at least one blockchain network;
compare the first and second hash-sums of the data; and
determine verify data immutability after the transfer of the data from the data storage to the new data storage based at least on results of the comparing, wherein the verifying comprises detecting a change of the root hash after each data transfer based at least on comparing a new root hash calculated after the data being saved in the new data storage and a previous root hash that was recorded in the at least one blockchain network prior to the data transfer.

7. The system according to claim 6 , wherein the computer processor is further configured to:
detect an additional transfer of the data between two different data storages;
calculate third hash-sums of the data during the additional transfer; and
transmit the third hash-sums of the data to the at least one blockchain network.

8. The system according to claim 7 , wherein, to calculate the first, second, and third hash-sums of the data during each data transfer, the computer processor is further configured to:
calculate hash-sums for each block of the data; and
pair and hash the hash-sums for each block of the data to determine the root hash of data.

9. The system according to claim 7 , wherein each of the first, second, and third hash-sums of the data during each data transfer is the root hash of the data.

10. The system according to claim 6 , wherein the at least one blockchain network comprises a plurality of computing nodes, each computing node being configured to maintain a copy of a continuously-growing list of data records saved in the at least one blockchain network.

11. A non-transitory computer readable medium storing computer executable instructions for verification of data stored in multiple data storages, including instructions for:
calculating, by a processor, a plurality of hash values for a plurality of data blocks comprised in the data;
calculating, by the processor, first hash-sums of the data during an initial placement in a data storage, wherein the first hash-sums is calculated as a root hash of a Merkle tree data structure comprising the plurality of hash values when an amount of data blocks exceeds a threshold amount and wherein the first hash-sums remains as a set of individual hash values for data blocks when the amount of data blocks does not exceed the threshold amount;
transmitting the first hash-sums to at least one blockchain network;
in response to detecting a transfer of the data to a new data storage, calculating, by the processor, second hash-sums of the data after a placement of the data in the new data storage, wherein the second hash-sums is calculated as a root hash of another Merkle tree data structure comprising another plurality of hash values of the plurality of data blocks in the transferred data when the amount of data blocks exceeds the threshold amount and wherein the second hash-sums remains as a set of individual hash values for the data blocks in the transferred data when the amount of data blocks does not exceed the threshold amount;
transmitting the second hash-sums to the at least one blockchain network;
comparing the first and second hash-sums of the data; and
verifying, by the processor, data immutability after the transfer of the data f

Assignees

• Acronis Int Gmbh

Inventors

• Lysenko Victor
• Protasov Stanislav
• Shmulevich Mark
• Beloussov Serguei M

Classifications

• H04L9/50 Primary

  using hash chains, e.g. blockchains or hash trees · CPC title

• H04L63/123

  received data contents, e.g. message integrity · CPC title

• H04L9/3247 Primary

  involving digital signatures · CPC title

• H04L9/0637

  Modes of operation, e.g. cipher block chaining [CBC], electronic codebook [ECB] or Galois/counter mode [GCM] · CPC title

• H04L9/0643

  Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title