US20150169897A1 - Efficient and secure data storage utilizing a dispersed data storage system - Google Patents

Efficient and secure data storage utilizing a dispersed data storage system Download PDF

Info

Publication number
US20150169897A1
US20150169897A1 US14/633,315 US201514633315A US2015169897A1 US 20150169897 A1 US20150169897 A1 US 20150169897A1 US 201514633315 A US201514633315 A US 201514633315A US 2015169897 A1 US2015169897 A1 US 2015169897A1
Authority
US
United States
Prior art keywords
data segment
nothing
data
encryption key
slices
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.)
Abandoned
Application number
US14/633,315
Inventor
Wesley Leggette
Jason K. Resch
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Pure Storage Inc
Original Assignee
Cleversafe Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority to US12/426,727 priority Critical patent/US9483656B2/en
Application filed by Cleversafe Inc filed Critical Cleversafe Inc
Priority to US14/633,315 priority patent/US20150169897A1/en
Publication of US20150169897A1 publication Critical patent/US20150169897A1/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CLEVERSAFE, INC.
Assigned to PURE STORAGE, INC. reassignment PURE STORAGE, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: INTERNATIONAL BUSINESS MACHINES CORPORATION
Application status is Abandoned legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6227Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database where protection concerns the structure of data, e.g. records, types, queries
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/08Error detection or correction by redundancy in data representation, e.g. by using checking codes
    • G06F11/10Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
    • G06F11/1076Parity data used in redundant arrays of independent storages, e.g. in RAID systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06Digital input from or digital output to record carriers, e.g. RAID, emulated record carriers, networked record carriers
    • G06F3/0601Dedicated interfaces to storage systems
    • G06F3/0668Dedicated interfaces to storage systems adopting a particular infrastructure
    • G06F3/067Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/06Cryptographic mechanisms or cryptographic arrangements for secret or secure communication the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
    • H04L9/0618Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communication
    • H04L9/08Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/085Secret sharing or secret splitting, e.g. threshold schemes

Abstract

A method of securely storing data to a dispersed data storage system is disclosed. A data segment is arranged along the columns or rows of an appropriately sized matrix. Data slices are then created based on either the columns or the rows so that no consecutive data is stored in a data slice. Each data slice is then stored in a separate storage node.

Description

    CROSS-REFERENCE TO RELATED APPLICATIONS
  • The present U.S. Utility patent application claims priority pursuant to 35 U.S.C. §121 as a divisional of U.S. Utility application Ser. No. 12/426,727, entitled “EFFICIENT AND SECURE DATA STORAGE UTILIZING A DISPERSED DATA STORAGE SYSTEM”, filed Apr. 20, 2009, which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility patent application for all purposes.
  • FIELD OF THE INVENTION
  • The present invention relates generally to systems, apparatus, and methods for securely storing data, and more particularly to systems, apparatus, and methods for secure distributed data storage using an information dispersal algorithm so that no one location will store an entire copy of stored data.
  • DESCRIPTION OF THE PRIOR ART
  • Storing data in digital form is a well-known problem associated with all computer systems, and numerous solutions to this problem are known in the art. The simplest solution involves merely storing digital data in a single location, such as a punch film, hard drive, or FLASH memory device. However, storage of data in a single location is inherently unreliable. The device storing the data can malfunction or be destroyed through natural disasters, such as a flood, or through a malicious act, such as arson. In addition, digital data is generally stored in a usable file, such as a document that can be opened with the appropriate word processing software, or a financial ledger that can be opened with the appropriate spreadsheet software. Storing an entire usable file in a single location is also inherently insecure as a malicious hacker only need compromise that one location to obtain access to the usable file.
  • To address reliability concerns, digital data is often “backed-up,” i.e., an additional copy of the digital data is made and maintained in a separate physical location. For example, a backup tape of all network drives may be made by a small office and maintained at the home of a trusted employee. When a backup of digital data exists, the destruction of either the original device holding the digital data or the backup will not compromise the digital data. However, the existence of the backup exacerbates the security problem, as a malicious hacker can choose between two locations from which to obtain the digital data. Further, the site where the backup is stored may be far less secure than the original location of the digital data, such as in the case when an employee stores the tape in her home.
  • Another method used to address reliability and performance concerns is the use of a Redundant Array of Independent Drives (“RAID”). RAID refers to a collection of data storage schemes that divide and replicate data among multiple storage units. Different configurations of RAID provide increased performance, improved reliability, or both increased performance and improved reliability. In certain configurations of RAID, when digital data is stored, it is split into multiple stripes, each of which is stored on a separate drive. Data striping is performed in an algorithmically certain way so that the data can be reconstructed. While certain RAID configurations can improve reliability, RAID does nothing to address security concerns associated with digital data storage.
  • One method that prior art solutions have addressed security concerns is through the use of encryption. Encrypted data is mathematically coded so that only users with access to a certain key can decrypt and use the data. While modern encryption methods are difficult to break, numerous instances of successful attacks are known, some of which have resulted in valuable data being compromised. Furthermore, if a malicious hacker should gain access to the encryption key associated with the encrypted data, the entirety of the data is recoverable.
  • While modern encryption tends to utilize block ciphers, such as, for example, 3-way, AES, Anubis, Blowfish, BMGL, CAST, CRYPTON, CS-Cipher, DEAL, DES, DESede, DESX, DFC, DFCv2, Diamond2, E2, FROG, GOST, HPC-1, HPC-2, ICE, IDEA, ISAAC, JEROBOAM, LEVIATHAN, LOKI91, LOKI97, MAGENTA, MARS, MDC, MISTY1, MISTY2, Noekeon, Noekeon Direct, Panama, Rainbow, RC2, RC4, RC4-drop, RC5, Rijndael, SAFER-K, SAFER-SK, SAFER+, SAFER++, SAFER++-64, Sapphire-II, Scream, Scream-F, SEAL-3.0, Serpent, SHARK, SKIPJACK, SNOW, SOBER, SPEED, Square, TEA, Twofish, WAKE-CFB, WiderWake4+1, WiderWake4+3, PBE-PKCS5, PBE-PKCS12, etc., other methods have been used in the past. One early form of encoding is transposition. Transposition involves the deterministic swapping of members within a set. For example, if a five member set X is defined as X={a,b,c,d,e}, a transposition function a may be defined as follows:

  • σ(0)=a

  • σ(1)=e

  • σ(2)=c

  • σ(3)=d

  • σ(4)=b
  • Therefore, the application of the transposition function to the entire set X would yield a new set X′={a, e, c, d, b}.
  • By transposing information transmitted in a message, the usability of the transposed information is reduced or eliminated. However, transposition schemes are easily broken by modern computers.
  • In 1979, two researchers independently developed a method for splitting data among multiple recipients called “secret sharing.” One of the characteristics of secret sharing is that a piece of data may be split among n recipients, but cannot be known unless at least t recipients share their data, where n≧t. For example, a trivial form of secret sharing can be implemented by assigning a single random byte to every recipient but one, who would receive the actual data byte after it had been bitwise exclusive orred with the random bytes. In other words, for a group of four recipients, three of the recipients would be given random bytes, and the fourth would be given a byte calculated by the following formula:

  • s′=s⊕r a ⊕r b ⊕r c,
  • where s is the original source data, ra, rb, and rc are random bytes given to three of the four recipients, and s′ is the encoded byte given to the fourth recipient. The original byte s can be recovered by bitwise exclusive-orring all four bytes together.
  • A cryptosystem, such as secret sharing, is called information-theoretically secure if its security derives purely from information theory; meaning that its security can be proven even if an adversary has access to unlimited computing power. As a secret sharing scheme can guarantee that no usable information can be recovered unless an attacker gains access to a threshold number of shares, secret sharing is information-theoretically secure. However, each data share is of equal size as the original data, so secret sharing makes for an inefficient storage mechanism.
  • All-or-nothing encryption is a recent development in cryptography, with the property that the entire cyphertext must be known before even a portion of the original data can be recovered. The original motivation behind all-or-nothing encryption was to increase the time required by brute force attacks to successfully compromise an encrypted cyphertext by a factor equal to the number of message blocks within the cyphertext. All-or-nothing encryption is described in “All-Or-Nothing Encryption and the Package Transform,” by Ronald L. Rivest, which is hereby incorporated by reference. Additional properties of all-or-nothing encryption are described in “Exposure-Resilient Functions and All-Or-Nothing Transforms,” by Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, and Amit Sahai, as well as “On the Security Properties of OAEP as an All-Or-Nothing Transform,” by Victor Boyko, both of which are hereby incorporated by reference.
  • Dispersed data storage systems involved utilizing an information dispersal algorithm to slice data. Schemes for implementing dispersed data storage systems, such as dispersed data storage networks (“DDSNs”), are also known in the art. For example, U.S. Pat. No. 5,485,474, issued to Michael O. Rabin, describes a system for splitting a segment of digital information into n data slices, which are stored in separate devices. When the data segment must be retrieved, only m of the original data slices are required to reconstruct the data segment, where n>m.
  • Generally, dispersed data storage systems provide some level of security, as each data slice will contain less information than the original digital information. Furthermore, as each slice is stored on a separate computer, it will generally be harder for a malicious hacker to break into m computers and gather enough data slices to reconstruct the original information. However, depending on the information dispersal algorithm utilized, each data slice will contain up to 1/m part of the original data. Generally, the information will be retained in the data slice as it existed in the original digital information. Accordingly, by compromising a storage node, a malicious hacker could access up to 1/m part of the original data.
  • OBJECTS OF THE INVENTION
  • Accordingly, it is an object of this invention to provide a system, apparatus, and method for efficiently implementing a secure dispersed data storage system.
  • Another object of the invention is to provide a system, apparatus, and method for implementing a secure dispersed data storage system without significantly increasing the amount of stored data.
  • Another object of the invention is to provide a system, apparatus, and method for implementing a secure dispersed data storage system with a level of security that approaches information theoretic security.
  • Another object of the invention is to provide a system, apparatus, and method for implementing a secure dispersed data storage system so that an attacker can gain no information about a stored data segment unless the attacker is able to compromise a threshold number (m) data slices.
  • Other advantages of the disclosed invention will be clear to a person of ordinary skill in the art. It should be understood, however, that a system, method, or apparatus could practice the disclosed invention while not achieving all of the enumerated advantages, and that the protected invention is defined by the claims.
  • SUMMARY OF THE INVENTION
  • The disclosed invention achieves its objectives by providing a method for securely storing data to a multi-node storage system, the method comprising the steps of arranging a data segment comprised of a plurality of data units in accordance with a matrix having j rows and k columns so that each data unit of the data segment is associated with a position of the matrix. The arranged data segment is then sliced in accordance with either the rows or the columns of the matrix to produce a plurality of data slices so that each data slice does not contain consecutive data units as they were arranged in the original data segment. Each of the data slices is then stored to a separate storage node.
  • In a further embodiment, a data string is padded with pad data prior to the step of arrangement as described above.
  • In an alternative embodiment, a method for securely storing data using a multi-node storage system is described, the method starting with the step of encrypting a data segment comprised of a plurality of data units using a suitable block cipher. The encrypted data segment is then arranged in accordance with a matrix having j rows and k columns so that each data unit of the encrypted data segment is associated with a position of the matrix. The encrypted arranged data segment is then sliced in accordance with either the rows or the columns of the matrix to produce a plurality of data slices so that each data slice does not contain consecutive data units as they were arranged in the original data segment. Each of the data slices is then stored to a separate storage node.
  • In a further embodiment of the disclosed invention, a method for securely storing data using a multi-node storage system comprises the steps of applying an all-or-nothing transformation to a data segment, slicing the all-or-nothing encrypted data segment using an information dispersal algorithm, and storing each of the resultant plurality of data slices on a separate storage node.
  • In a still further embodiment of the disclosed invention, a method of securely storing data using a multi-node storage system comprises the steps of encrypting a data segment using a first block cipher, applying an all-or-nothing transform to the encrypted data segment, slicing the all-or-nothing encrypted data segment using an information dispersal algorithm, and storing each of the resultant data slices on a separate storage node.
  • The application of an all or nothing transform can comprise the steps of generating an encryption key using, for example, a random key generator, and encrypting a data segment using the generated encryption key. The digest of the encrypted data is then calculated using an appropriate hashing algorithm, and the encryption key is exclusive-orred with the digest to produce an obfuscated encryption key. The obfuscated encryption key is then packaged with the data segment by, for example, appending the encryption key to the end of the data segment.
  • The disclosed invention can be operated by different computers. For example, in one embodiment of the disclosed invention, an access computer comprises a network port and a processor. The processor receives a data segment from the network port, arranges the data segment in accordance with a matrix having j rows and k columns, and slices the arranged data segment in accordance with the rows or columns of the matrix. The processor then sends each data slice to a separate storage node. In a separate embodiment, a stand-alone client comprises a network port and a processor. The processor retrieves a data segment and arranges the data segment in accordance with a matrix having j rows and k columns. The processor then slices the arranged data segment in accordance with the rows or columns of the matrix, and sends each data slice to a separate storage node.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • Although the characteristic features of this invention will be particularly pointed out in the claims, the invention itself, and the manner in which it may be made and used, may be better understood by referring to the following description taken in connection with the accompanying drawings forming a part hereof, wherein like reference numerals refer to like parts throughout the several views and in which:
  • FIG. 1 is a network diagram of a dispersed data storage system utilizing the disclosed security schemes;
  • FIG. 2 is an illustration of the principles of transposition as applied to a dispersed data storage system;
  • FIG. 3 is a flowchart illustrating the application of an all-or-nothing transformation to a data segment;
  • FIG. 4 is a flowchart illustrating the removal of an all-or-nothing transformation from a data segment;
  • FIG. 5 is a flow chart illustrating a write operation to a dispersed data system utilizing a columnar transposition cipher and an information dispersal algorithm;
  • FIG. 6 is a flow chart illustrating a read operation from a dispersed data storage system utilizing a columnar transposition cipher and an information dispersal algorithm;
  • FIG. 7 is a flow chart illustrating a write operation to a dispersed data storage system utilizing encryption, transposition, and an information dispersal algorithm;
  • FIG. 8 is a flow chart illustrating a read operation from a dispersed data storage system utilizing encryption, transposition, and an information dispersal algorithm;
  • FIG. 9 is a flow chart illustrating a write operation to a dispersed data storage system utilizing an all-or-nothing transformation and an information dispersal algorithm;
  • FIG. 10 is a flow chart illustrating a read operation from a dispersed data storage system utilizing an all-or-nothing transformation and an information dispersal algorithm;
  • FIG. 11 is a flow chart illustrating a write operation to a dispersed data storage system utilizing encryption, an all-or-nothing transformation, and an information dispersal algorithm; and
  • FIG. 12 is a flow chart illustrating a read operation from a dispersed data storage system utilizing encryption, an all-or-nothing transformation, and an information dispersal algorithm.
  • DETAILED DESCRIPTION OF THE ILLUSTRATED EMBODIMENT
  • Turning to the Figures, and to FIG. 1 in particular, a dispersed data storage system 100 is shown. An arbitrary number of storage nodes, such as slice servers 109 store data slices sent to them by source computers 111, 117. Storage nodes 109 may be networked slice servers as illustrated, or may merely be a collection of drives. In a networked implementation, some number of grid access computers 113 may serve access clients 117 in providing access to the storage nodes 109. Alternatively, the source computers may include the software required to access the storage nodes 109 directly, such as stand-alone client 111. All of the computers may be general purpose computers, comprised of, for example, a housing containing a processor, fast memory, such as dynamic RAM, one or more storage drives, such as rotating media drives or flash drives, a plurality of input/output ports, such as USB ports or Firewire ports, one or more network ports, such as Ethernet ports or 802.11 ports, as well as an external display, and one or more input/output devices, such as a keyboard for data entry, and a mouse or touchpad for cursor control. Alternatively, access computers and storage nodes may be thinner devices. For example, an access computer may be comprised of a housing containing a processor, fast memory, and one or more network ports. Further by way of example, a storage node could be comprised of a housing containing a processor, fast memory, one or more network ports, and one or more storage drives.
  • FIG. 2 presents an overview of a process to secure a data segment in accordance with an embodiment of the disclosed invention. A data segment 202 is comprised of 16 bytes of ASCII data expressing the phrase “Quick brown fox!” It should be noted that the type of encoding of the data, as well as the size of a data unit, is irrelevant to the invention. Therefore, Unicode instead of ASCII could be used to encode the phrase, and the size of a data unit could be set to word (16 bits), double word (32 bits), or any other size. Furthermore, a data segment could be 32 bytes, 48 bytes, etc.
  • Where a higher level of security is required, the data segment 202 can be encrypted using an appropriate block cipher, such as DES or AES. While the use of encryption will increase security for the data storage system, it will also increase processor load on computers accessing the storage system. Accordingly, the performance of the system will be lowered, as computers writing data to the dispersed data storage system will need to encrypt data prior to writing it out, and systems reading data will likewise need to decrypt data. For those systems where high performance is more important than high security, the system administrator can elect to disable encryption. In this case, a moderate level of security is still attained by the disclosed system through the use of transposition, as explained below.
  • Regardless of whether the data segment is encrypted or not, the data within the data segment is arranged in a matrix 206. The matrix 206 is sized so that (1) every element of the data segment is assigned to a particular matrix entry, and (2) the number of data slices created is a multiple of the number of data slices created per data segment. In the depicted example, which assumes that eight data slices are created per data segment, an 8×2 matrix is used to fit the 16 data unit data segment, with the data segment arranged sequentially along the columns.
  • The data is then dispersed into data slices 208-215, each containing one row of data. As depicted, each data slice 208-215 contains entirely non-consecutive data from the original data segment.
  • A variety of sizes of matrices can be used to achieve many of the advantages of the disclosed system. For example, for a 16 byte data segment being stored on a system that slices data into 4 data slices, a 4×4 matrix could be used; data could be arranged along either the rows or columns, with the other serving as the basis for the data slices. However, while such an arrangement would increase security for the stored information, as no consecutive data units would be stored in a single slice, the optimal increase in security is achieved by sizing the matrix so that one dimension of the matrix, rows or columns, is equal to the threshold of the dispersed data storage network. For example, in system with a threshold m of eight and the data segment size is set to 16 bytes, an 8×2 matrix could be used as described above. It should be noted that additional, code slices containing redundant data would be generated if the total slice number n for the system is above eight. In this case, if a malicious hacker should recover two consecutive slices, a minimal number of consecutive data units will be recovered, i.e., two strips of data, each two data units in length.
  • Persons of skill in the art will realize that the decision to arrange data along the columns of the matrix is an arbitrary decision. For example, a 2×8 matrix could be used, and data could be arranged along the rows, instead of the columns. The data slices would then be made from the columns.
  • FIG. 3 depicts a method for applying an all-or-nothing transformation to a data segment. In a first step 304, a symmetric encryption key is generated. In step 306, the data segment is encrypted using the generated encryption key. In step 308, the digest of the encrypted data is calculated, by applying a hashing algorithm to the data segment; suitable hashing algorithms include MD5, SHA-1, SHA-2, and any other secure cryptographic hashing algorithm. The digest is then XOR-ed with the encryption key in step 310, and the obfuscated encryption key is appended to the data segment in step 312. From this process, it is apparent that the encryption key generated in step 304 is not “secret information,” as it will be appended to the data with trivial protection.
  • FIG. 4 depicts a method for removing an all-or-nothing transformation from a data segment. In step 404, the digest of the encrypted data is calculated; note that the obfuscated digest placed at the end of the data segment in the method of FIG. 3 is not included in this calculation. It should also be noted that the plaintext encryption key is never stored, but rather, is calculated in memory, and obfuscated before it is appended to the data segment. In step 406, the obfuscated encryption key is read into a memory location, or otherwise obtained, and in step 408, the digest is XOR-ed with the obfuscated encryption key to obtain the plaintext encryption key. Finally, in step 410 data segment is decrypted with the encryption key.
  • FIG. 5 depicts the steps required to write data from an access computer or an integrated client to a dispersed data storage system in accordance with a first embodiment of the disclosed invention. In step 502 a write operation is initiated. The initiation of the write operation involves accepting a data string of arbitrary size, and then, if necessary, padding the string to the dispersed data storage system's data segment size. In step 504 a transposition cipher is applied to the data segment. While the transposition cipher is trivially reversible if a malicious hacker should gain access to a threshold number of slices, the compromise of a single slice will not yield any consecutive information. In step 506 an information dispersal algorithm is applied to the transposed data segment, and the data slices are then written to different storage nodes of the dispersed data storage system in step 508.
  • FIG. 6 depicts the steps required to read data from a dispersed data storage system in accordance with a first embodiment of the disclosed invention. In step 602 a read operation is initiated. In step 604, a threshold number of data slices are retrieved from the dispersed data storage system, where the threshold for a given dispersed data storage system is the minimum number of slices required to reconstruct a stored data segment. In step 406 a reverse information dispersal algorithm is applied to obtain a transposed data segment, and, in step 408 the transposition cipher is reversed to produce a usable data segment.
  • FIG. 7 depicts the steps required to write data from an access computer or an integrated client to a dispersed data storage system in accordance with a second embodiment of the disclosed invention. In step 702 a write operation is initiated. The initiation of the write operation involves accepting a data string of arbitrary size, and then, if necessary, padding the string to the dispersed data storage system's data segment size. In step 704, data is encrypted using any suitable block cipher, such as those mentioned earlier in this specification. In step 706 a transposition cipher is applied to the encrypted data segment. The use of the transposition cipher will guarantee that no consecutive data will be stored in any slice, and therefore, even if a malicious hacker should compromise the encryption key, she would still have to assemble a number of slices equal to the dispersed data storage system's threshold prior to gaining access to any usable information.
  • In step 708 the encrypted and transposed data segment is dispersed using a suitable information dispersal algorithm, such as Cauchy-Reed Solomon. The slices are then stored to different nodes of the dispersed data storage system, such as, for example, slice servers in step 710.
  • FIG. 8 depicts the steps required to read data from a dispersed data storage system in accordance with a second embodiment of the disclosed invention. In step 802 a read operation is initiated. In step 804, a threshold number of data slices are retrieved from the dispersed data storage system, and in step 806 a reverse information dispersal algorithm is applied to obtain a transposed encrypted data segment. In step 808 the transposition cipher is reversed to produce an encrypted data segment, and in step 810, decryption is applied to produce a usable data segment.
  • The first two embodiments of the disclosed invention involved the use of transposition to improve the security of data stored by a dispersed data storage network. The final two embodiments of the disclosed invention involve the use of all-or-nothing encryption to improve the security of data stored by a dispersed data storage network. Specifically, the use of all-or-nothing encryption, when combined with additional encryption, can provide the advantage of an attacker gaining access to no usable information unless the attacker is able to compromise a threshold m number of data slices. This approaches information theoretic security without the disadvantage of greatly increasing storage size.
  • FIG. 9 depicts the steps required to write data to a dispersed data storage system in accordance with a third embodiment of the disclosed invention. In step 904, an all-nothing-transformation is applied to a data segment to be stored, thereby producing an all-or-nothing encrypted data segment. The all-or-nothing transformation could be that described earlier in this document, or some other all-or-nothing transformation. In step 906 an information dispersal algorithm is applied to the all-or-nothing encrypted data segment to produce a plurality of data slices, and in step 908, the plurality of data slices is stored to a plurality of storage nodes.
  • FIG. 10 depicts the steps required to read data from a dispersed data storage system in accordance with a third embodiment of the disclosed invention. In step 1004, a plurality of data slices corresponding to a stored data segment are retrieved from a plurality of storage nodes, and a reverse information dispersal algorithm is applied in step 1006. In step 1008, the all-or-nothing transformation is removed by using, for example, the method described earlier in this document, or some other method appropriate to the all-or-nothing transformation to be removed.
  • FIG. 11 depicts the steps required to write data from a dispersed data storage system in accordance with a fourth embodiment of the disclosed invention. In step 1104, a data segment to be stored is encrypted using a block cipher, such as AES, RC4, or any of the block ciphers discussed earlier in this document, thereby producing an encrypted data segment. In step 1106, an all-nothing-transformation is applied to the encrypted data segment to, thereby producing an all-or-nothing encrypted data segment. The all-or-nothing transformation could be that described earlier in this document, or some other all-or-nothing transformation. In step 1108, an information dispersal algorithm is applied to the all-or-nothing encrypted data segment, producing a plurality of data slices, which are stored to a plurality of storage nodes in step 1110.
  • FIG. 12 depicts the steps required to read data from a dispersed data storage system in accordance with a fourth embodiment of the disclosed invention. In step 1204, a plurality of data slices corresponding to a stored data segment are retrieved from a plurality of storage nodes. In step 1206, a reverse information dispersal algorithm is applied, and in step 1208, the all-or-nothing transformation is removed by using, for example, the method described earlier in this document or another appropriate method. Finally, in step 1210, the read data segment is decrypted.
  • The foregoing description of the invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or to limit the invention to the precise form disclosed. The description was selected to best explain the principles of the invention and practical application of these principles to enable others skilled in the art to best utilize the invention in various embodiments and various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention not be limited by the specification, but be defined by the claims set forth below.

Claims (11)

What is claimed is:
1. A method operating on a computer, the method comprises:
applying an all-or-nothing transformation to a data segment to produce an all-or-nothing data segment;
encoding, using an information dispersal algorithm, the all-or-nothing data segment to produce a set of encoded data slices; and
generating a set of write command to write the set of encoded data slices to storage units of a dispersed storage network.
2. The method of claim 1 wherein the applying an all-or-nothing transformation comprises:
generating an encryption key;
encrypting the data segment with said encryption key to produce an encrypted data segment;
calculating a digest corresponding to the encrypted data segment;
obfuscating the encryption key by exclusive ORing said encryption key with the digest to produce an obfuscated encryption key; and
packaging the obfuscated encryption key with the encrypted data segment to produce the all-or-nothing data segment.
3. The method of claim 1 further comprises:
encrypting the data segment using a first block cipher prior to the applying of the all-or-nothing transformation.
4. The method of claim 1 further comprises:
retrieving, by a second computer, at least a decode threshold number of encoded data slices of the set of encoded data slices from the storage units;
decoding, by the second computer using the information dispersal algorithm, the at least the decode threshold number of encoded data slices to recover the all-or-nothing data segment; and
reversing, by the second computer, the all-or-nothing transformation on the recovered all-or-nothing data segment to recover the data segment.
5. The method of claim 1 further comprises:
retrieving at least a decode threshold number of encoded data slices of the set of encoded data slices from the storage units;
decoding, using the information dispersal algorithm, the at least the decode threshold number of encoded data slices to recover the all-or-nothing data segment; and
reversing the all-or-nothing transformation on the recovered all-or-nothing data segment to recover the data segment.
6. The method of claim 5, wherein the reversing the all-or-nothing transformation comprises:
separating the all-or-nothing data segment into an encrypted data segment and an obfuscated encryption key;
calculating a digest based on the encrypted data segment;
exclusive ORing the obfuscated encryption key with the digest to recover an encryption key; and
decrypting the encrypted data segment using the encryption key to recover the data segment.
7. A computer comprising:
a network port adapted to couple with a network and receive a data segment; and
a processor coupled to the network port wherein the processor:
applies an all-or-nothing transformation to the data segment to produce an all-or-nothing data segment;
encodes, using an information dispersal algorithm, the all-or-nothing data segment to produce a set of encoded data slices; and
generates a set of write commands to write the set of encoded data slices to storage nodes of a dispersed storage network.
8. The computer of claim 7, wherein the processor further functions to apply the all-or-nothing transformation by:
generating an encryption key;
encrypting said data segment with said encryption key to produce an encrypted data segment;
calculating a digest corresponding to said encrypted data segment;
obfuscating said encryption key by exclusive-ORing said encryption key with said digest to produce an obfuscated encryption key; and
packaging said obfuscated encryption key with said encrypted data segment to produce the all-or-nothing encrypted data segment.
9. The computer of claim 7, wherein the processor further functions to:
encrypt the data segment using a first block cipher prior to the applying of the all-or-nothing transformation.
10. The computer of claim 7, wherein the processor further functions to:
retrieve, via the network port, at least a decode threshold number of encoded data slices of the set of encoded data slices from the storage nodes;
decode, using the information dispersal algorithm, the at least the decode threshold number of encoded data slices to recover the all-or-nothing data segment; and
reverse the all-or-nothing transformation on the recovered all-or-nothing data segment to recover the data segment.
11. The computer of claim 10, wherein the processor further functions to reverse the all-or-nothing transformation by:
separating the all-or-nothing data segment into an encrypted data segment and an obfuscated encryption key;
calculating a digest based on the encrypted data segment;
exclusive ORing the obfuscated encryption key with the digest to recover an encryption key; and
decrypting the encrypted data segment using the encryption key to recover the data segment.
US14/633,315 2009-04-20 2015-02-27 Efficient and secure data storage utilizing a dispersed data storage system Abandoned US20150169897A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US12/426,727 US9483656B2 (en) 2009-04-20 2009-04-20 Efficient and secure data storage utilizing a dispersed data storage system
US14/633,315 US20150169897A1 (en) 2009-04-20 2015-02-27 Efficient and secure data storage utilizing a dispersed data storage system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US14/633,315 US20150169897A1 (en) 2009-04-20 2015-02-27 Efficient and secure data storage utilizing a dispersed data storage system

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US12/426,727 Division US9483656B2 (en) 2009-04-20 2009-04-20 Efficient and secure data storage utilizing a dispersed data storage system

Publications (1)

Publication Number Publication Date
US20150169897A1 true US20150169897A1 (en) 2015-06-18

Family

ID=42981893

Family Applications (2)

Application Number Title Priority Date Filing Date
US12/426,727 Active 2030-04-28 US9483656B2 (en) 2009-04-20 2009-04-20 Efficient and secure data storage utilizing a dispersed data storage system
US14/633,315 Abandoned US20150169897A1 (en) 2009-04-20 2015-02-27 Efficient and secure data storage utilizing a dispersed data storage system

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US12/426,727 Active 2030-04-28 US9483656B2 (en) 2009-04-20 2009-04-20 Efficient and secure data storage utilizing a dispersed data storage system

Country Status (1)

Country Link
US (2) US9483656B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9916472B2 (en) 2015-07-22 2018-03-13 International Business Machines Corporation Obfuscation and protection of data rights

Families Citing this family (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7391865B2 (en) 1999-09-20 2008-06-24 Security First Corporation Secure data parser method and system
CN102609640B (en) 2004-10-25 2015-07-15 安全第一公司 Secure data parser method and system
US8504847B2 (en) * 2009-04-20 2013-08-06 Cleversafe, Inc. Securing data in a dispersed storage network using shared secret slices
US9772791B2 (en) * 2009-08-27 2017-09-26 International Business Machines Corporation Dispersed storage processing unit and methods with geographical diversity for use in a dispersed storage system
US8554994B2 (en) * 2009-09-29 2013-10-08 Cleversafe, Inc. Distributed storage network utilizing memory stripes
US9774678B2 (en) * 2009-10-29 2017-09-26 International Business Machines Corporation Temporarily storing data in a dispersed storage network
US9842222B2 (en) * 2010-08-25 2017-12-12 International Business Machines Corporation Securely rebuilding an encoded data slice
US8745372B2 (en) 2009-11-25 2014-06-03 Security First Corp. Systems and methods for securing data in motion
US9311184B2 (en) * 2010-02-27 2016-04-12 Cleversafe, Inc. Storing raid data as encoded data slices in a dispersed storage network
US10268374B2 (en) * 2010-02-27 2019-04-23 International Business Machines Corporation Redundant array of independent discs and dispersed storage network system re-director
ES2676143T3 (en) 2010-03-31 2018-07-17 Security First Corp. Systems and methods for securing data in motion
US8625635B2 (en) * 2010-04-26 2014-01-07 Cleversafe, Inc. Dispersed storage network frame protocol header
CA2800809A1 (en) 2010-05-28 2011-12-01 Lawrence A. Laurich Accelerator system for use with secure data storage
CN106407766A (en) * 2011-03-07 2017-02-15 安全第公司 Secure file sharing method and system
US8874991B2 (en) * 2011-04-01 2014-10-28 Cleversafe, Inc. Appending data to existing data stored in a dispersed storage network
US10298684B2 (en) 2011-04-01 2019-05-21 International Business Machines Corporation Adaptive replication of dispersed data to improve data access performance
US10055283B2 (en) * 2011-11-28 2018-08-21 International Business Machines Corporation Securely distributing random keys in a dispersed storage network
US10331519B2 (en) * 2012-10-08 2019-06-25 International Business Machines Corporation Application of secret sharing schemes at multiple levels of a dispersed storage network
US10216822B2 (en) * 2012-11-02 2019-02-26 Vod2, Inc. Data distribution methods and systems
CN104137090B (en) * 2012-11-27 2018-05-01 美新纳瑞私人有限公司 Data assembling, transfer and storage
US9317717B2 (en) * 2012-12-28 2016-04-19 Open Invention Network, Llc Separate cryptographic keys for protecting different operations on data
US9519805B2 (en) * 2013-08-01 2016-12-13 Cellco Partnership Digest obfuscation for data cryptography
US9460302B2 (en) 2014-01-21 2016-10-04 Cofactor Computing Llc Method and system for shielding data in transit and data in memory
US9336363B2 (en) * 2014-01-21 2016-05-10 Cofactor Computing Llc Method and system for secure deployment of information technology (IT) solutions in untrusted environments
US9209971B2 (en) 2014-01-21 2015-12-08 Cofactor Computing Llc Method and system for shielding data in untrusted environments
WO2015168878A1 (en) * 2014-05-07 2015-11-12 华为技术有限公司 Payment method and device and payment factor processing method and device
US10348486B2 (en) * 2014-09-30 2019-07-09 Nec Corporation Method and system for at least partially updating data encrypted with an all-or-nothing encryption scheme
US9485221B2 (en) 2014-10-23 2016-11-01 International Business Machines Corporation Selective content cloud storage with device synchronization
GB2532039B (en) 2014-11-06 2016-09-21 Ibm Secure database backup and recovery
JP2016139861A (en) * 2015-01-26 2016-08-04 パナソニックIpマネジメント株式会社 Encryption device, encryption method and distribution system
US9967093B2 (en) * 2015-03-25 2018-05-08 Intel Corporation Techniques for securing and controlling access to data
US10333906B2 (en) 2017-03-30 2019-06-25 Bank Of America Corporation Network communication decoder using key pattern encryption
US10320559B2 (en) 2017-03-30 2019-06-11 Bank Of America Corporation Network communication encoder using key pattern encryption
US10043036B1 (en) * 2017-08-22 2018-08-07 TokenEx, LLC Systems and methods for tokenization to support pseudononymization of sensitive data

Citations (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5991414A (en) * 1997-09-12 1999-11-23 International Business Machines Corporation Method and apparatus for the secure distributed storage and retrieval of information
US20020133707A1 (en) * 2000-11-29 2002-09-19 Applied Microsystems Corporation Method and system for secure distribution of subscription-based game software
US20030182435A1 (en) * 2000-11-13 2003-09-25 Digital Doors, Inc. Data security system and method for portable device
US6661775B1 (en) * 1999-08-05 2003-12-09 Lucent Technologies Inc. Redundant routing with deadlines in data networks
US20040123223A1 (en) * 2002-07-29 2004-06-24 Robert Halford Multi-dimensional data protection and mirroring method for micro level data
US6907123B1 (en) * 2000-12-21 2005-06-14 Cisco Technology, Inc. Secure voice communication system
US20060039351A1 (en) * 2004-08-23 2006-02-23 Ryoji Furuhashi Computer system for controlling routed data amount
US20060064751A1 (en) * 2004-09-23 2006-03-23 Pratima Ahuja Apparatus, system, and method for message level security
US20070079082A1 (en) * 2005-09-30 2007-04-05 Gladwin S C System for rebuilding dispersed data
US20070160198A1 (en) * 2005-11-18 2007-07-12 Security First Corporation Secure data parser method and system
US20080046493A1 (en) * 2006-08-17 2008-02-21 University Of Miami Method and system for data security
US20080147821A1 (en) * 2006-12-19 2008-06-19 Dietrich Bradley W Managed peer-to-peer content backup service system and method using dynamic content dispersal to plural storage nodes
US20080183992A1 (en) * 2006-12-05 2008-07-31 Don Martin Tape backup method
US20080183975A1 (en) * 2005-09-30 2008-07-31 Lynn Foster Rebuilding data on a dispersed storage network
WO2008127309A2 (en) * 2006-11-07 2008-10-23 Security First Corporation Systems and methods for distributing and securing data
US20080282049A1 (en) * 2007-05-11 2008-11-13 Shunji Kawamura Storage controller, control method of the same, and information processing system
US7472334B1 (en) * 2003-10-15 2008-12-30 Scott Thomas P Efficient method for the reconstruction of digital information
US20090161870A1 (en) * 2006-08-17 2009-06-25 University Of Miami Method for keyless protection of data using a local array of disks
US20090177894A1 (en) * 2008-01-07 2009-07-09 Security First Corporation Systems and methods for securing data using multi-factor or keyed dispersal
US20100082989A1 (en) * 2008-09-26 2010-04-01 Microsoft Corporation Storing Composite Services on Untrusted Hosts
US20100088269A1 (en) * 2008-10-02 2010-04-08 International Business Machines Corporation Dispersal and retrieval of data fragments in a peer-to-peer data backup and archival network
US7734643B1 (en) * 2004-06-30 2010-06-08 Oracle America, Inc. Method for distributed storage of data
US7894599B2 (en) * 2006-12-04 2011-02-22 International Business Machines Corporation Enhanced data security with redundant inclusive data encryption segments

Family Cites Families (69)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4092732A (en) 1977-05-31 1978-05-30 International Business Machines Corporation System for recovering data stored in failed memory unit
US5485474A (en) 1988-02-25 1996-01-16 The President And Fellows Of Harvard College Scheme for information dispersal and reconstruction
US5454101A (en) 1992-09-15 1995-09-26 Universal Firmware Industries, Ltd. Data storage system with set lists which contain elements associated with parents for defining a logical hierarchy and general record pointers identifying specific data sets
US5987622A (en) 1993-12-10 1999-11-16 Tm Patents, Lp Parallel computer system including parallel storage subsystem including facility for correction of data in the event of failure of a storage device in parallel storage subsystem
US6175571B1 (en) 1994-07-22 2001-01-16 Network Peripherals, Inc. Distributed memory switching hub
US5848230A (en) 1995-05-25 1998-12-08 Tandem Computers Incorporated Continuously available computer memory systems
US5774643A (en) 1995-10-13 1998-06-30 Digital Equipment Corporation Enhanced raid write hole protection and recovery
US5809285A (en) 1995-12-21 1998-09-15 Compaq Computer Corporation Computer system having a virtual drive array controller
US6012159A (en) 1996-01-17 2000-01-04 Kencast, Inc. Method and system for error-free data transfer
US5802364A (en) 1996-04-15 1998-09-01 Sun Microsystems, Inc. Metadevice driver rename/exchange technique for a computer system incorporating a plurality of independent device drivers
US5890156A (en) 1996-05-02 1999-03-30 Alcatel Usa, Inc. Distributed redundant database
US6058454A (en) 1997-06-09 2000-05-02 International Business Machines Corporation Method and system for automatically configuring redundant arrays of disk memory devices
US6088330A (en) 1997-09-09 2000-07-11 Bruck; Joshua Reliable array of distributed computing nodes
US6272658B1 (en) 1997-10-27 2001-08-07 Kencast, Inc. Method and system for reliable broadcasting of data files and streams
JPH11161505A (en) 1997-12-01 1999-06-18 Matsushita Electric Ind Co Ltd Media send-out device
JPH11167443A (en) 1997-12-02 1999-06-22 Casio Comput Co Ltd Interface device
US6415373B1 (en) 1997-12-24 2002-07-02 Avid Technology, Inc. Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner
US6374336B1 (en) 1997-12-24 2002-04-16 Avid Technology, Inc. Computer system and process for transferring multiple high bandwidth streams of data between multiple storage units and multiple applications in a scalable and reliable manner
WO2000011554A1 (en) 1998-08-19 2000-03-02 Boris Nikolaevich Vilkov A system and method for identification of transformation of memory device addresses
US6356949B1 (en) 1999-01-29 2002-03-12 Intermec Ip Corp. Automatic data collection device that receives data output instruction from data consumer
US6609223B1 (en) 1999-04-06 2003-08-19 Kencast, Inc. Method for packet-level fec encoding, in which on a source packet-by-source packet basis, the error correction contributions of a source packet to a plurality of wildcard packets are computed, and the source packet is transmitted thereafter
US6571282B1 (en) 1999-08-31 2003-05-27 Accenture Llp Block-based communication in a communication services patterns environment
US6826711B2 (en) 2000-02-18 2004-11-30 Avamar Technologies, Inc. System and method for data protection with multidimensional parity
US6718361B1 (en) 2000-04-07 2004-04-06 Network Appliance Inc. Method and apparatus for reliable and scalable distribution of data files in distributed networks
US20030037261A1 (en) 2001-03-26 2003-02-20 Ilumin Corporation Secured content delivery system and method
AT381191T (en) 2000-10-26 2007-12-15 Prismedia Networks Inc A method and system for managing distributed contents and corresponding metadata-
US7146644B2 (en) 2000-11-13 2006-12-05 Digital Doors, Inc. Data security system and method responsive to electronic attacks
US7140044B2 (en) 2000-11-13 2006-11-21 Digital Doors, Inc. Data security system and method for separation of user communities
US7103915B2 (en) 2000-11-13 2006-09-05 Digital Doors, Inc. Data security system and method
US8176563B2 (en) 2000-11-13 2012-05-08 DigitalDoors, Inc. Data security system and method with editor
GB2369206B (en) 2000-11-18 2004-11-03 Ibm Method for rebuilding meta-data in a data storage system and a data storage system
US6785783B2 (en) 2000-11-30 2004-08-31 International Business Machines Corporation NUMA system with redundant main memory architecture
US7080101B1 (en) 2000-12-01 2006-07-18 Ncr Corp. Method and apparatus for partitioning data for storage in a database
US20030084020A1 (en) 2000-12-22 2003-05-01 Li Shu Distributed fault tolerant and secure storage
US6857059B2 (en) 2001-01-11 2005-02-15 Yottayotta, Inc. Storage virtualization system and methods
US6745286B2 (en) 2001-01-29 2004-06-01 Snap Appliance, Inc. Interface architecture
US6879596B1 (en) 2001-04-11 2005-04-12 Applied Micro Circuits Corporation System and method for systolic array sorting of information segments
US7024609B2 (en) 2001-04-20 2006-04-04 Kencast, Inc. System for protecting the transmission of live data streams, and upon reception, for reconstructing the live data streams and recording them into files
GB2377049A (en) 2001-06-30 2002-12-31 Hewlett Packard Co Billing for utilisation of a data storage array
US6944785B2 (en) 2001-07-23 2005-09-13 Network Appliance, Inc. High-availability cluster virtual server system
US7636724B2 (en) * 2001-08-31 2009-12-22 Peerify Technologies LLC Data storage system and method by shredding and deshredding
US7024451B2 (en) 2001-11-05 2006-04-04 Hewlett-Packard Development Company, L.P. System and method for maintaining consistent independent server-side state among collaborating servers
US7003688B1 (en) 2001-11-15 2006-02-21 Xiotech Corporation System and method for a reserved memory area shared by all redundant storage controllers
US7171493B2 (en) 2001-12-19 2007-01-30 The Charles Stark Draper Laboratory Camouflage of network traffic to resist attack
US7051155B2 (en) 2002-08-05 2006-05-23 Sun Microsystems, Inc. Method and system for striping data to accommodate integrity metadata
US20040122917A1 (en) 2002-12-18 2004-06-24 Menon Jaishankar Moothedath Distributed storage system for data-sharing among client computers running defferent operating system types
EP1618478A4 (en) 2003-03-13 2007-10-03 Drm Technologies L L C Secure streaming container
GB0308264D0 (en) 2003-04-10 2003-05-14 Ibm Recovery from failures within data processing systems
GB0308262D0 (en) 2003-04-10 2003-05-14 Ibm Recovery from failures within data processing systems
US7415115B2 (en) 2003-05-14 2008-08-19 Broadcom Corporation Method and system for disaster recovery of data from a storage device
US7613945B2 (en) 2003-08-14 2009-11-03 Compellent Technologies Virtual disk drive system and method
US7899059B2 (en) 2003-11-12 2011-03-01 Agere Systems Inc. Media delivery using quality of service differentiation within a media stream
US7185144B2 (en) 2003-11-24 2007-02-27 Network Appliance, Inc. Semi-static distribution technique
US8332483B2 (en) 2003-12-15 2012-12-11 International Business Machines Corporation Apparatus, system, and method for autonomic control of grid system resources
US7206899B2 (en) 2003-12-29 2007-04-17 Intel Corporation Method, system, and program for managing data transfer and construction
US7222133B1 (en) 2004-02-05 2007-05-22 Unisys Corporation Method for reducing database recovery time
US7240236B2 (en) 2004-03-23 2007-07-03 Archivas, Inc. Fixed content distributed data storage using permutation ring encoding
US7231578B2 (en) 2004-04-02 2007-06-12 Hitachi Global Storage Technologies Netherlands B.V. Techniques for detecting and correcting errors using multiple interleave erasure pointers
JP4446839B2 (en) 2004-08-30 2010-04-07 株式会社日立製作所 Storage devices and storage management device
US7680771B2 (en) 2004-12-20 2010-03-16 International Business Machines Corporation Apparatus, system, and method for database provisioning
US7386758B2 (en) 2005-01-13 2008-06-10 Hitachi, Ltd. Method and apparatus for reconstructing data in object-based storage arrays
US7672930B2 (en) 2005-04-05 2010-03-02 Wal-Mart Stores, Inc. System and methods for facilitating a linear grid database with data organization by dimension
US7953937B2 (en) 2005-09-30 2011-05-31 Cleversafe, Inc. Systems, methods, and apparatus for subdividing data for storage in a dispersed data storage grid
US7574570B2 (en) 2005-09-30 2009-08-11 Cleversafe Inc Billing system for information dispersal system
US8171101B2 (en) 2005-09-30 2012-05-01 Cleversafe, Inc. Smart access to a dispersed data storage network
US7574579B2 (en) 2005-09-30 2009-08-11 Cleversafe, Inc. Metadata management system for an information dispersed storage system
US20070214285A1 (en) 2006-03-08 2007-09-13 Omneon Video Networks Gateway server
US7904475B2 (en) 2007-10-09 2011-03-08 Cleversafe, Inc. Virtualized data storage vaults on a dispersed data storage network
US8285878B2 (en) 2007-10-09 2012-10-09 Cleversafe, Inc. Block based access to a dispersed data storage network

Patent Citations (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5991414A (en) * 1997-09-12 1999-11-23 International Business Machines Corporation Method and apparatus for the secure distributed storage and retrieval of information
US6192472B1 (en) * 1997-09-12 2001-02-20 International Business Machines Corporation Method and apparatus for the secure distributed storage and retrieval of information
US6661775B1 (en) * 1999-08-05 2003-12-09 Lucent Technologies Inc. Redundant routing with deadlines in data networks
US20030182435A1 (en) * 2000-11-13 2003-09-25 Digital Doors, Inc. Data security system and method for portable device
US20020133707A1 (en) * 2000-11-29 2002-09-19 Applied Microsystems Corporation Method and system for secure distribution of subscription-based game software
US6907123B1 (en) * 2000-12-21 2005-06-14 Cisco Technology, Inc. Secure voice communication system
US20040123223A1 (en) * 2002-07-29 2004-06-24 Robert Halford Multi-dimensional data protection and mirroring method for micro level data
US7472334B1 (en) * 2003-10-15 2008-12-30 Scott Thomas P Efficient method for the reconstruction of digital information
US7734643B1 (en) * 2004-06-30 2010-06-08 Oracle America, Inc. Method for distributed storage of data
US20060039351A1 (en) * 2004-08-23 2006-02-23 Ryoji Furuhashi Computer system for controlling routed data amount
US20060064751A1 (en) * 2004-09-23 2006-03-23 Pratima Ahuja Apparatus, system, and method for message level security
US20070079082A1 (en) * 2005-09-30 2007-04-05 Gladwin S C System for rebuilding dispersed data
US20080183975A1 (en) * 2005-09-30 2008-07-31 Lynn Foster Rebuilding data on a dispersed storage network
US20070160198A1 (en) * 2005-11-18 2007-07-12 Security First Corporation Secure data parser method and system
US20080046493A1 (en) * 2006-08-17 2008-02-21 University Of Miami Method and system for data security
US20090161870A1 (en) * 2006-08-17 2009-06-25 University Of Miami Method for keyless protection of data using a local array of disks
WO2008127309A2 (en) * 2006-11-07 2008-10-23 Security First Corporation Systems and methods for distributing and securing data
US7894599B2 (en) * 2006-12-04 2011-02-22 International Business Machines Corporation Enhanced data security with redundant inclusive data encryption segments
US20080183992A1 (en) * 2006-12-05 2008-07-31 Don Martin Tape backup method
US20080147821A1 (en) * 2006-12-19 2008-06-19 Dietrich Bradley W Managed peer-to-peer content backup service system and method using dynamic content dispersal to plural storage nodes
US20080282049A1 (en) * 2007-05-11 2008-11-13 Shunji Kawamura Storage controller, control method of the same, and information processing system
US20090177894A1 (en) * 2008-01-07 2009-07-09 Security First Corporation Systems and methods for securing data using multi-factor or keyed dispersal
US20100082989A1 (en) * 2008-09-26 2010-04-01 Microsoft Corporation Storing Composite Services on Untrusted Hosts
US20100088269A1 (en) * 2008-10-02 2010-04-08 International Business Machines Corporation Dispersal and retrieval of data fragments in a peer-to-peer data backup and archival network

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Choi, Sung Jin, Hee Yong Youn, and Bo Kyoung Lee. "An efficient dispersal and encryption scheme for secure distributed information storage." Computational Science-ICCS 2003. Springer Berlin Heidelberg, 2003. 958-967. *
Krawczyk, Hugo. "Secret sharing made short." Advances in Cryptology-CRYPTO'93. Springer Berlin Heidelberg, 1994. *
Lauritsen, Rasmus W "Backups with Computational Secret Sharing." April 2008. *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9916472B2 (en) 2015-07-22 2018-03-13 International Business Machines Corporation Obfuscation and protection of data rights

Also Published As

Publication number Publication date
US20100268966A1 (en) 2010-10-21
US9483656B2 (en) 2016-11-01

Similar Documents

Publication Publication Date Title
Chen et al. Remote data checking for network coding-based distributed storage systems
Krawczyk Secret sharing made short
Rahumed et al. A secure cloud backup system with assured deletion and version control
US5991414A (en) Method and apparatus for the secure distributed storage and retrieval of information
EP2201460B1 (en) Ensuring data integrity on a dispersed storage grid
US6125185A (en) System and method for encryption key generation
US10282564B2 (en) Distributed storage with auxiliary data interspersal and method for use therewith
EP2016525B1 (en) Encryption apparatus and method for providing an encrypted file system
US7634659B2 (en) Roaming hardware paired encryption key generation
Wilcox-O'Hearn et al. Tahoe: the least-authority filesystem
JP3229148B2 (en) Encryption method and system
US8737606B2 (en) Method and system for high throughput blockwise independent encryption/decryption
US7475258B2 (en) Exclusive encryption
Li et al. Secure deduplication with efficient and reliable convergent key management
Li et al. Secure distributed deduplication systems with improved reliability
US20100058476A1 (en) Electronic information retention method/system, electronic information split retention method/system, electronic information split restoration processing method/system, and programs for the same
US7904475B2 (en) Virtualized data storage vaults on a dispersed data storage network
WO2012071728A1 (en) Data encryption method, apparatus and system for cloud storage
US7565702B2 (en) Password-based key management
EP2466508A1 (en) Deduplicated and encrypted backups
CN100563152C (en) Data division method and device using exclusive or calculation
CN1211363A (en) Communication method using common cryptographic key
US7860241B2 (en) Simple universal hash for plaintext aware encryption
EP1440535A2 (en) Memory encrytion system and method
US8744071B2 (en) Dispersed data storage system data encryption and encoding

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CLEVERSAFE, INC.;REEL/FRAME:038629/0015

Effective date: 20160405

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: PURE STORAGE, INC., CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:049555/0530

Effective date: 20190611