System and method of using encryption algorithms in P2P encryption mode to restore integrity of data

Patent metadata

Field	Value
Publication number	US-10409688-B2
Application number	US-201715429269-A
Country	US
Kind code	B2
Filing date	Feb 10, 2017
Priority date	Feb 10, 2017
Publication date	Sep 10, 2019
Grant date	Sep 10, 2019

Abstract

A system and method is disclosed for using encryption algorithms in peer-to-peer encryption mode to restore the integrity of data. An example method is provided for generating a new derivative for a file that has a plurality of existing derivatives that have been stored on servers using an (n,k) algorithm, where the (n,k) algorithm provides that a minimum number k of the derivatives required to restore the file. The method includes accessing, on a server, a first derivative of the existing derivatives and forming a blob for the new derivative based on a modification operation that uses the first derivative. Moreover, the method includes determining a number of times the modification operation has been performed, and if the number of times the modification operation has been performed is equal to the minimum number k, uploading the blob to a server for storage thereon.

First claim

What is claimed is:

1. A method for generating a new derivative for a file that has a plurality of existing derivatives stored on one or more servers using an (n,k) algorithm, wherein k is a minimum number of derivatives required to restore the file, the method comprising:
accessing, on a server, an existing derivative of the file stored on said server;
performing, by the server, a modification operation on the existing derivative to generate a blob for the new derivative;
determining a number of times the modification operation has been performed;
when the number of times the modification operation has been performed is not equal to k and there is an additional existing derivative stored on at least one server of the one or more servers, performing, by said server, the modification operation on the blob using the additional existing derivative and incrementing by one the number of times the modification operation has been performed until the modification operation has been performed k times; and
when the modification operation has been performed k times, uploading the blob to a server for storage thereon.

2. The method of claim 1 , further comprising:
when the modification operation has not been performed k times and there is no additional existing derivative stored on the at least one server, by the at least one server, transferring the blob to an additional server that is communicatively coupled to the at least one server.

3. The method of claim 2 , further comprising:
determining if there is an additional derivative stored on the additional server; and
when there is an additional derivative stored on the additional server, modifying the blob, by the additional server, based on the modification operation using the additional derivative.

4. The method of claim 3 , further comprising:
incrementing by one, by the additional server, the number of times the modification operation has been performed; and
when the modification operation has been performed k times, uploading the blob by the additional server to a server for storage thereon.

5. The method of claim 2 , further comprising selecting the additional server from among a plurality of servers by initiating an auction for the plurality of servers and transmitting the blob to the additional server that wins the auction.

6. The method of claim 2 , further comprising selecting the additional server from among a plurality of servers by selecting the additional server that has a maximum bandwidth for communicating with the at least one server.

7. The method of claim 1 , wherein the uploading of the blob to the server for storage thereon comprises:
polling a plurality of servers to identify a server that is willing to store the blob; and
uploading the blob to the server that is willing to store the blob and transmitting an electronic payment to the server upon confirmation that the blob is stored thereon.

8. A system for generating a new derivative for a file that has a plurality of existing derivatives stored on one or more servers using an (n,k) algorithm, wherein k is a minimum number of derivatives required to restore the file, the system comprising:
a processor on a server configured to:
access an existing derivative of the file stored on said server;
perform, by the server, a modification operation on the existing derivative to generate a blob for the new derivative;
determine a number of times the modification operation has been performed;
when the number of times the modification operation has been performed is not equal to k and there is an additional existing derivative stored on at least one server of the one or more servers, perform, by said server, the modification operation on the blob using the additional existing derivative and increment by one the number of times the modification operation has been performed until the modification operation has been performed k times; and
when the modification operation has been performed k times, upload the blob to a server for storage thereon.

9. The system of claim 8 , wherein the processor is further configured to:
when the modification operation has not been performed k times and there is no additional existing derivative stored on the at least one server, by the at least one server, transferring the blob to an additional server that is communicatively coupled to the at least one server.

10. The system of claim 9 ,
wherein a processor of the additional server determines when there is an additional derivative stored thereon, and
wherein, when there is an additional derivative stored on the additional server, the processor of the additional server is configured to modify the blob based on the modification operation using the additional derivative.

11. The system of claim 10 ,
wherein the processor of the additional server is configured to increment by one the number of times the modification operation has been performed; and
when the modification operation has been performed k times, the additional server is configured to upload the blob to a server for storage thereon.

12. The system of claim 9 , wherein the processor is further configured to select the additional server from among a plurality of servers by initiating an auction for the plurality of servers and transmitting the blob to the additional server that wins the auction.

13. The system of claim 9 , wherein the processor is further configured to select the additional server from among a plurality of servers by selecting the additional server that has a maximum bandwidth for communicating with the at least one server.

14. The system of claim 8 , wherein the processor is further configured to upload the blob to the server for storage thereon by:
polling a plurality of servers to identify a server that is willing to store the blob; and
uploading the blob to the server that is willing to store the blob and transmitting an electronic payment to the server upon confirmation that the blob is stored thereon.

15. A non-transitory computer readable medium storing computer executable instructions for generating a new derivative for a file that has a plurality of existing derivatives stored on one or more servers using an (n,k) algorithm, wherein k is a minimum number of derivatives required to restore the file, including instructions for:
accessing, on a server, an existing derivative of the file stored on said server;
performing, by the server, a modification operation on the existing derivative to generate a blob for the new derivative;
determining a number of times the modification operation has been performed;
when the number of times the modification operation has been performed is not equal to k and there is an additional existing derivative stored on at least one server of the one or more servers, performing, by said server, the modification operation on the blob using the additional existing derivative and incrementing by one the number of times the modification operation has been performed until the modification operation has been performed k times; and
when the modification operation has been k times, uploading the blob to a server for storage thereon.

16. The non-transitory computer readable medium according to claim 15 , further including instructions for:
when the modification operation has not been performed k times and there is no additional existing derivative stored on the at least one server, by the at least one server, transferring the blob to an additional server that is communicatively coupled to the at least one server.

17. The non-transitory computer readable mediu

Assignees

• Acronis Int Gmbh

Inventors

• Tormasov Alexander G

Classifications

• H04L9/0894

  Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage · CPC title

• H04L9/085

  Secret sharing or secret splitting, e.g. threshold schemes · CPC title

• G06F11/00

  Error detection; Error correction; Monitoring (error detection, correction or monitoring in information storage based on relative movement between record carrier and transducer G11B20/18; monitoring, i.e. supervising the progress of recording or reproducing G11B27/36; in static stores G11C29/00) · CPC title

• G06F2201/805

  Real-time · CPC title

• G06F11/1448 Primary

  Management of the data involved in backup or backup restore · CPC title