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

Patent metadata

Field	Value
Publication number	US-2018232284-A1
Application number	US-201715429269-A
Country	US
Kind code	A1
Filing date	Feb 10, 2017
Priority date	Feb 10, 2017
Publication date	Aug 16, 2018
Grant date	—

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 that have been stored on at least one server using an (n,k) algorithm, wherein the (n,k) algorithm provides that a minimum number k of the derivatives is required to restore the file, the method comprising:
accessing, on the at least one server, a first derivative of the plurality of existing derivatives; forming a blob, by the at least one server, for the new derivative based on a modification operation using the first derivative on the at least one server; 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.

2 . The method of claim 1 , further comprising:
if the number of times the modification operation has been performed is not equal to the minimum number k, determining if there is an additional derivatives stored on the at least one server; and if there is an additional derivatives stored on the at least one server, modifying the blob, by the at least one server, based on the modification operation using the additional derivative.

3 . The method of claim 2 , further comprising:
incrementing, by the at least one server, the number of times the modification operation has been performed by one; 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.

4 . The method of claim 1 , further comprising:
if the number of times the modification operation has been performed is not equal to the minimum number k, determining if there is an additional derivatives stored on the at least one server; and if there is not an additional derivatives stored on the at least one server, transferring the blob, by the at least one server, to an additional server that is communicatively coupled to the at least one server.

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

6 . The method of claim 5 , further comprising:
incrementing, by the additional server, the number of times the modification operation has been performed by one; and if the number of times the modification operation has been performed is equal to the minimum number k, uploading the blob by the additional server to a server for storage thereon.

7 . The method of claim 4 , 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.

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

9 . 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.

10 . A system for generating a new derivative for a file that has a plurality of existing derivatives that have been stored on at least one server using an (n,k) algorithm, wherein the (n,k) algorithm provides that a minimum number k of the derivatives is required to restore the file, the system comprising:
a processor on the at least one server configured to:
access a first derivative of the plurality of existing derivatives;
form a blob for the new derivative based on a modification operation using the first derivative on the at least one server;
determine 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, upload the blob to a server for storage thereon.

11 . The system of claim 10 , wherein the processor is further configured to:
if the number of times the modification operation has been performed is not equal to the minimum number k, determine if there is an additional derivatives stored on the at least one server; and if there is an additional derivatives stored on the at least one server, modify the blob based on the modification operation using the additional derivative.

12 . The system of claim 11 , wherein the processor is further configured to:
increment the number of times the modification operation has been performed by one; and if the number of times the modification operation has been performed is equal to the minimum number k, upload the blob to a server for storage thereon.

13 . The system of claim 10 , wherein the processor is further configured to:
if the number of times the modification operation has been performed is not equal to the minimum number k, determine if there is an additional derivatives stored on the at least one server; and if there is not an additional derivatives stored on the at least one server, transfer the blob to an additional server that is communicatively coupled to the at least one server.

14 . The system of claim 13 ,
wherein a processor of the additional server determine if there is an additional derivatives stored thereon, and wherein, if there is an additional derivatives 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.

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

16 . The system of claim 13 , 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.

17 . The system of claim 13 , 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 with the at least one server.

18 . The system of claim 10 , 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.

19 . 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 that have been stored on at least one server using an (n,k) algorithm, wherein the (n,k) algorithm provides that a minimum number k of the derivatives is required to restore the fil

Assignees

• Acronis Int Gmbh

Inventors

• Tormasov Alexander G

Classifications

• G06F11/1662

  the resynchronized component or unit being a persistent storage device (re-synchronization of failed mirror storage G06F11/2082; rebuild or reconstruction of parity RAID storage G06F11/1008) · CPC title

• G06F2201/805

  Real-time · CPC title

• H04L9/0894

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

• G06F11/1464

  for networked environments · CPC title

• G06F11/1448 Primary

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