US9940195B2

US9940195B2 - Encryption of slice partials

Info

Publication number: US9940195B2
Application number: US15/718,200
Authority: US
Inventors: Jason K. Resch; Greg R. Dhuse; Wesley B. Leggette
Original assignee: International Business Machines Corp
Current assignee: Pure Storage Inc
Priority date: 2010-08-25
Filing date: 2017-09-28
Publication date: 2018-04-10
Anticipated expiration: 2030-08-25
Also published as: US20180018232A1

Abstract

A method for use in a distributed storage network (DSN) including a plurality of distributed storage (DS) units includes receiving, at a DS unit, a rebuilding request indicating that the DS unit is to provide an encrypted partial slice to a requesting DS unit included in the DS network. Key pairing requirements associated with the rebuilding request are determined, and an even number of key pairing entities are selected based on the key pairing requirements. The even number of key pairing entities being fewer than a decode threshold number of key pairing entities. The DS unit generates shared secret keys corresponding to each of the even number of key pairing entities, uses those keys to generate an encrypted partial slice, and transmits the encrypted partial slice to the requesting DS unit in accordance with a rebuilding topology.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority pursuant to 35 U.S.C. §120 as a continuation-in-part of U.S. Utility application Ser. No. 13/463,991 entitled “SECURELY REBUILDING AN ENCODED DATA SLICE” filed May 4, 2012, which claims priority pursuant to 35 U.S.C. §119(e) to U.S. Provisional Application No. 61/493,820, entitled “DATA SECURITY IN A DISPERSED STORAGE NETWORK,” filed Jun. 6, 2011, both of which are incorporated herein by reference in their entirety and made part of the present U.S. Utility Patent Application for all purposes.

U.S. Utility patent application Ser. No. 13/463,991 also claims priority pursuant to 35 U.S.C. §120 as a continuation-in-part of U.S. Utility application Ser. No. 12/862,887, entitled “DISPERSED STORAGE NETWORK DATA SLICE INTEGRITY VERIFICATION,” filed Aug. 25, 2010, now U.S. Pat. No. 8,918,897, which is hereby incorporated herein by reference in its entirety and made part of the present U.S. Utility Patent Application for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computer networks and more particularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/or store data. Such computing devices range from wireless smart phones, laptops, tablets, personal computers (PC), work stations, and video game devices, to data centers that support millions of web searches, stock trades, or on-line purchases every day. In general, a computing device includes a central processing unit (CPU), a memory system, user input/output interfaces, peripheral device interfaces, and an interconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using “cloud computing” to perform one or more computing functions (e.g., a service, an application, an algorithm, an arithmetic logic function, etc.) on behalf of the computer. Further, for large services, applications, and/or functions, cloud computing may be performed by multiple cloud computing resources in a distributed manner to improve the response time for completion of the service, application, and/or function. For example, Hadoop is an open source software framework that supports distributed applications enabling application execution by thousands of computers.

In addition to cloud computing, a computer may use “cloud storage” as part of its memory system. As is known, cloud storage enables a user, via its computer, to store files, applications, etc. on an Internet storage system. The Internet storage system may include a RAID (redundant array of independent disks) system and/or a dispersed storage system that uses an error correction scheme to encode data for storage.

It is well known that various Internet and other storage systems encrypt data prior to storage. In some cases, a convergent encryption technique, which derives an encryption key from the data being encrypted can be used, and thus the same plaintexts will have the same cipher texts. When convergent encryption techniques are used, there is a potential increase in storage efficiency compared to using keys unrelated to the data being encrypted, if other users store this same plaintext. But there is a drawback, in terms of security, because if the data can be guessed, it may be possible to determine whether or not a user stores that data.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed or distributed storage network (DSN) in accordance with the present invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing core in accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an error encoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an error encoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of an encoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an error decoding function in accordance with the present invention;

FIG. 9A is a schematic block diagram of another embodiment of a computing system in accordance with the invention;

FIG. 9B is a table illustrating an example of a dispersed storage (DS) unit key pair to DS unit key assignment table in accordance with the invention;

FIG. 10 is a flowchart illustrating an example of generating an encrypted partial slice in accordance with the present invention;

FIG. 11 is a flowchart illustrating another example of generating an encrypted partial slice in accordance with the present invention; and

FIG. 12 is a flowchart illustrating another example of generating an encrypted partial slice in accordance with the present invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, or distributed, storage network (DSN) 10 that includes a plurality of computing devices 12-16, a managing unit 18, an integrity processing unit 20, and a DSN memory 22. The components of the DSN 10 are coupled to a network 24, which may include one or more wireless and/or wire lined communication systems; one or more non-public intranet systems and/or public internet systems; and/or one or more local area networks (LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may be located at geographically different sites (e.g., one in Chicago, one in Milwaukee, etc.), at a common site, or a combination thereof. For example, if the DSN memory 22 includes eight storage units 36, each storage unit is located at a different site. As another example, if the DSN memory 22 includes eight storage units 36, all eight storage units are located at the same site. As yet another example, if the DSN memory 22 includes eight storage units 36, a first pair of storage units are at a first common site, a second pair of storage units are at a second common site, a third pair of storage units are at a third common site, and a fourth pair of storage units are at a fourth common site. Note that a DSN memory 22 may include more or less than eight storage units 36. Further note that each storage unit 36 includes a computing core (as shown in FIG. 2, or components thereof) and a plurality of memory devices for storing dispersed error encoded data.

Each of the computing devices 12-16, the managing unit 18, and the integrity processing unit 20 include a computing core 26, which includes network interfaces 30-33. Computing devices 12-16 may each be a portable computing device and/or a fixed computing device. A portable computing device may be a social networking device, a gaming device, a cell phone, a smart phone, a digital assistant, a digital music player, a digital video player, a laptop computer, a handheld computer, a tablet, a video game controller, and/or any other portable device that includes a computing core. A fixed computing device may be a computer (PC), a computer server, a cable set-top box, a satellite receiver, a television set, a printer, a fax machine, home entertainment equipment, a video game console, and/or any type of home or office computing equipment. Note that each of the managing unit 18 and the integrity processing unit 20 may be separate computing devices, may be a common computing device, and/or may be integrated into one or more of the computing devices 12-16 and/or into one or more of the storage units 36.

Each

interface

30, 32, and 33 includes software and hardware to support one or more communication links via the network 24 indirectly and/or directly. For example, interface 30 supports a communication link (e.g., wired, wireless, direct, via a LAN, via the network 24, etc.) between

computing devices

14 and 16. As another example, interface 32 supports communication links (e.g., a wired connection, a wireless connection, a LAN connection, and/or any other type of connection to/from the network 24) between

computing devices

12 and 16 and the DSN memory 22. As yet another example, interface 33 supports a communication link for each of the managing unit 18 and the integrity processing unit 20 to the network 24.

Computing devices

12 and 16 include a dispersed storage (DS) client module 34, which enables the computing device to dispersed storage error encode and decode data (e.g., data 40) as subsequently described with reference to one or more of FIGS. 3-8. In this example embodiment, computing device 16 functions as a dispersed storage processing agent for computing device 14. In this role, computing device 16 dispersed storage error encodes and decodes data on behalf of computing device 14. With the use of dispersed storage error encoding and decoding, the DSN 10 is tolerant of a significant number of storage unit failures (the number of failures is based on parameters of the dispersed storage error encoding function) without loss of data and without the need for a redundant or backup copies of the data. Further, the DSN 10 stores data for an indefinite period of time without data loss and in a secure manner (e.g., the system is very resistant to unauthorized attempts at accessing the data).

In operation, the managing unit 18 performs DS management services. For example, the managing unit 18 establishes distributed data storage parameters (e.g., vault creation, distributed storage parameters, security parameters, billing information, user profile information, etc.) for computing devices 12-14 individually or as part of a group of user devices. As a specific example, the managing unit 18 coordinates creation of a vault (e.g., a virtual memory block associated with a portion of an overall namespace of the DSN) within the DSN memory 22 for a user device, a group of devices, or for public access and establishes per vault dispersed storage (DS) error encoding parameters for a vault. The managing unit 18 facilitates storage of DS error encoding parameters for each vault by updating registry information of the DSN 10, where the registry information may be stored in the DSN memory 22, a computing device 12-16, the managing unit 18, and/or the integrity processing unit 20.

The managing unit 18 creates and stores user profile information (e.g., an access control list (ACL)) in local memory and/or within memory of the DSN memory 22. The user profile information includes authentication information, permissions, and/or the security parameters. The security parameters may include encryption/decryption scheme, one or more encryption keys, key generation scheme, and/or data encoding/decoding scheme.

The managing unit 18 creates billing information for a particular user, a user group, a vault access, public vault access, etc. For instance, the managing unit 18 tracks the number of times a user accesses a non-public vault and/or public vaults, which can be used to generate a per-access billing information. In another instance, the managing unit 18 tracks the amount of data stored and/or retrieved by a user device and/or a user group, which can be used to generate a per-data-amount billing information.

As another example, the managing unit 18 performs network operations, network administration, and/or network maintenance. Network operations includes authenticating user data allocation requests (e.g., read and/or write requests), managing creation of vaults, establishing authentication credentials for user devices, adding/deleting components (e.g., user devices, storage units, and/or computing devices with a DS client module 34) to/from the DSN 10, and/or establishing authentication credentials for the storage units 36. Network administration includes monitoring devices and/or units for failures, maintaining vault information, determining device and/or unit activation status, determining device and/or unit loading, and/or determining any other system level operation that affects the performance level of the DSN 10. Network maintenance includes facilitating replacing, upgrading, repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missing encoded data slices. At a high level, the integrity processing unit 20 performs rebuilding by periodically attempting to retrieve/list encoded data slices, and/or slice names of the encoded data slices, from the DSN memory 22. For retrieved encoded slices, they are checked for errors due to data corruption, outdated version, etc. If a slice includes an error, it is flagged as a ‘bad’ slice. For encoded data slices that were not received and/or not listed, they are flagged as missing slices. Bad and/or missing slices are subsequently rebuilt using other retrieved encoded data slices that are deemed to be good slices to produce rebuilt slices. The rebuilt slices are stored in the DSN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core 26 that includes a processing module 50, a memory controller 52, main memory 54, a video graphics processing unit 55, an input/output (TO) controller 56, a peripheral component interconnect (PCI) interface 58, an IO interface module 60, at least one IO device interface module 62, a read only memory (ROM) basic input output system (BIOS) 64, and one or more memory interface modules. The one or more memory interface module(s) includes one or more of a universal serial bus (USB) interface module 66, a host bus adapter (HBA) interface module 68, a network interface module 70, a flash interface module 72, a hard drive interface module 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operating system (OS) file system interface (e.g., network file system (NFS), flash file system (FFS), disk file system (DFS), file transfer protocol (FTP), web-based distributed authoring and versioning (WebDAV), etc.) and/or a block memory interface (e.g., small computer system interface (SCSI), internet small computer system interface (iSCSI), etc.). The DSN interface module 76 and/or the network interface module 70 may function as one or more of the interface 30-33 of FIG. 1. Note that the IO device interface module 62 and/or the memory interface modules 66-76 may be collectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storage error encoding of data. When a

computing device

12 or 16 has data to store it disperse storage error encodes the data in accordance with a dispersed storage error encoding process based on dispersed storage error encoding parameters. The dispersed storage error encoding parameters include an encoding function (e.g., information dispersal algorithm, Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematic encoding, on-line codes, etc.), a data segmenting protocol (e.g., data segment size, fixed, variable, etc.), and per data segment encoding values. The per data segment encoding values include a total, or pillar width, number (T) of encoded data slices per encoding of a data segment (i.e., in a set of encoded data slices); a decode threshold number (D) of encoded data slices of a set of encoded data slices that are needed to recover the data segment; a read threshold number (R) of encoded data slices to indicate a number of encoded data slices per set to be read from storage for decoding of the data segment; and/or a write threshold number (W) to indicate a number of encoded data slices per set that must be accurately stored before the encoded data segment is deemed to have been properly stored. The dispersed storage error encoding parameters may further include slicing information (e.g., the number of encoded data slices that will be created for each data segment) and/or slice security information (e.g., per encoded data slice encryption, compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as the encoding function (a generic example is shown in FIG. 4 and a specific example is shown in FIG. 5); the data segmenting protocol is to divide the data object into fixed sized data segments; and the per data segment encoding values include: a pillar width of 5, a decode threshold of 3, a read threshold of 4, and a write threshold of 4. In accordance with the data segmenting protocol, the

computing device

12 or 16 divides the data (e.g., a file (e.g., text, video, audio, etc.), a data object, or other data arrangement) into a plurality of fixed sized data segments (e.g., 1 through Y of a fixed size in range of Kilo-bytes to Tera-bytes or more). The number of data segments created is dependent of the size of the data and the data segmenting protocol.

The

computing device

12 or 16 then disperse storage error encodes a data segment using the selected encoding function (e.g., Cauchy Reed-Solomon) to produce a set of encoded data slices. FIG. 4 illustrates a generic Cauchy Reed-Solomon encoding function, which includes an encoding matrix (EM), a data matrix (DM), and a coded matrix (CM). The size of the encoding matrix (EM) is dependent on the pillar width number (T) and the decode threshold number (D) of selected per data segment encoding values. To produce the data matrix (DM), the data segment is divided into a plurality of data blocks and the data blocks are arranged into D number of rows with Z data blocks per row. Note that Z is a function of the number of data blocks created from the data segment and the decode threshold number (D). The coded matrix is produced by matrix multiplying the data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encoding with a pillar number (T) of five and decode threshold number of three. In this example, a first data segment is divided into twelve data blocks (D1-D12). The coded matrix includes five rows of coded data blocks, where the first row of X11-X14 corresponds to a first encoded data slice (EDS 1_1), the second row of X21-X24 corresponds to a second encoded data slice (EDS 2_1), the third row of X31-X34 corresponds to a third encoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to a fourth encoded data slice (EDS 4_1), and the fifth row of X51-X54 corresponds to a fifth encoded data slice (EDS 5_1). Note that the second number of the EDS designation corresponds to the data segment number.

Returning to the discussion of FIG. 3, the computing device also creates a slice name (SN) for each encoded data slice (EDS) in the set of encoded data slices. A typical format for a slice name 80 is shown in FIG. 6. As shown, the slice name (SN) 80 includes a pillar number of the encoded data slice (e.g., one of 1-T), a data segment number (e.g., one of 1-Y), a vault identifier (ID), a data object identifier (ID), and may further include revision level information of the encoded data slices. The slice name functions as, at least part of, a DSN address for the encoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the

computing device

12 or 16 produces a plurality of sets of encoded data slices, which are provided with their respective slice names to the storage units for storage. As shown, the first set of encoded data slices includes EDS 1_1 through EDS 5_1 and the first set of slice names includes SN 1_1 through SN 5_1 and the last set of encoded data slices includes EDS 1_Y through EDS 5_Y and the last set of slice names includes SN 1_Y through SN 5_Y.

FIG. 7 is a schematic block diagram of an example of dispersed storage error decoding of a data object that was dispersed storage error encoded and stored in the example of FIG. 4. In this example, the

computing device

12 or 16 retrieves from the storage units at least the decode threshold number of encoded data slices per data segment. As a specific example, the computing device retrieves a read threshold number of encoded data slices.

To recover a data segment from a decode threshold number of encoded data slices, the computing device uses a decoding function as shown in FIG. 8. As shown, the decoding function is essentially an inverse of the encoding function of FIG. 4. The coded matrix includes a decode threshold number of rows (e.g., three in this example) and the decoding matrix in an inversion of the encoding matrix that includes the corresponding rows of the coded matrix. For example, if the coded matrix includes

rows

1, 2, and 4, the encoding matrix is reduced to

rows

1, 2, and 4, and then inverted to produce the decoding matrix.

Various techniques and devices that allow selective use of convergent encryption techniques are discussed below with respect to FIGS. 9 and 10. Convergent encryption techniques use a key derived from the data being encrypted, but can make data less secure in some circumstances. Two techniques can be applied to augment the security of the data, by giving up some storage efficiency.

The first technique, makes it more difficult to correctly guess a file by virtue of its length. This method examines the current file size, and adds some padding to the end until the size is that of the next highest rounded value. The rounded values might be calculated to never expand the data by more than 1%. This can be done by calculating (log(file_size)/log(1+1%)), rounding that value up to the next highest integer to get N, then calculating (1+1%)^N. The file can then be rounded up to that size by adding the appropriate amount of padding to mask its true size.

The second approach to trade efficiency for increased security is to make a determination as to how easy it is to guess the content. This can be done by estimating the entropy of the files content (for example, determining the size of the file if it were compressed). If this compressed size (a rough estimate of the file's entropy) is less than a certain threshold, then instead of generating deriving the key from the data, the key can be generated randomly. A unique file tag (or one based on the content of the encrypted data) will be generated. Thus for certain files, convergent encryption is not used, e.g. when the files are small, and/or overly predictable, but convergent encryption is used for other files.

FIG. 9A is a schematic block diagram of another embodiment of a computing system. Such a system includes a plurality of sites 1-4 that include, in totality, a set of dispersed storage (DS) units associated with a set of encoded data slices. Such a set of encoded data slices is produced by dispersed storage error encoding a data segment. Each such site of the plurality of sites 1-4 includes at least one DS unit of the set of DS units, wherein the at least one DS unit stores an depending on previous encoded data slice of the set of encoded data slices. For example, site 1 includes DS units 1-2, site 2 includes DS units 3-4, site 3 includes DS units 5-6, and site 4 includes DS units 7-8 when a pillar width is 8.

Rebuilding an encoded data slice to be rebuilt requires at least a decode threshold number of encoded data slices of a set of encoded data slices associated with the encoded data slice to be rebuilt. For example, DS unit 2 requests a decode threshold number of encoded data slices from

DS units

1, 3, 4, 5, and 6 when DS unit 2 is associated with an encoded data slice to be rebuilt and the decode threshold number is 5. Each DS unit of

DS units

1, 3, 4, 5, and 6 sends a corresponding encoded data slice (e.g., DS unit 4 sends a pillar 4 encoded data slice) to DS unit 2. DS unit 2 receives the decode threshold number of encoded data slices and dispersed storage error decodes the decode threshold number of encoded data slices to reproduce a data segment. DS unit 2 dispersed storage error encodes the data segment to produce the set of encoded data slices. DS unit 2 selects the encoded data slice associated with DS unit 2 (e.g., pillar 2) as a copy of the encoded data slice to be rebuilt and stores the encoded data slice to be rebuilt. In such an example, information leakage is possible as the decode threshold number of encoded data slices may be intercepted when sent to DS unit 2.

Alternatively, DS unit 2 requests a decode threshold number of slice partials from

DS units

1, 3, 4, 5, and 6 when DS unit 2 is associated with the encoded data slice to be rebuilt and the decode threshold number is 5. Each DS unit of

DS units

1, 3, 4, 5, and 6 generates a slice partial (e.g., DS unit 4 generates a pillar 4 slice partial) based on rebuilding parameters and an encoded data slice associated with the DS unit. Such rebuilding parameters includes one or more of a pillar width (e.g., 8), a decode threshold (e.g., 5), a pillar index to be rebuilt (e.g., pillar 2), the rebuilding participant list (e.g.,

DS units

1, 3, 4, 5, and 6), a rebuilding topology (e.g., DS unit 1 to DS unit 2, DS unit 3 to DS unit 4 to DS unit 2, DS unit 5 to DS unit 6 to DS unit 2), an encoding matrix, a DS unit pair key indicator, a DS unit key assignment, Diffie Hellman parameters, and an encryption algorithm indicator. For example, DS unit 4 generates partial (2,4)=(inverted square matrix of an encoding matrix utilizing participating

rows

1, 3, 4, 5, 6)*(a data matrix with a pillar 4 encoded data slice in a third row)*(a second row of the encoding matrix corresponding to a pillar number of the encoded data slice to be rebuilt).

Next, each DS unit of

DS units

1, 3, 4, 5, and 6 encrypts the slice partial corresponding to the DS unit utilizing an encryption function, wherein the encryption function utilizes an encryption algorithm and one or more keys. Such an encryption algorithm includes performing an exclusive or (XOR) logical function on the slice partial and the one or more keys. Each key of the one or more keys may be utilized an even number of times by the DS unit and at least one other DS unit of

DS units

1, 3, 4, 5, and 6 to enable subsequent decryption (e.g., XOR) when the decode threshold number of slice partials are combined to reproduce the encoded data slice to be rebuilt. For instance, each DS unit may utilize each possible key enabled for use by the DS unit. Each key of the one or more keys may be obtained by one or more of a retrieval, a message, and generation. For example, DS unit 3 utilizes a shared secret key (K3-5) shared between

DS units

3 and 5, DS unit 5 utilizes the shared secret key between

DS units

3 and 5, DS unit 4 utilizes a shared secret key (K1-4) between

DS units

1 and 4, DS unit 6 utilizes a shared secret key (K1-6) between

DS units

1 and 6, and DS unit 1 utilizes the shared secret key between

DS units

1 and 4 the shared secret key between

DS units

1 and 6 in accordance with DS unit pair key indicators and a DS unit key assignment of the rebuilding parameters.

Each DS unit may generate one or more keys associated with one or more DS unit pairings utilizing a Diffie Hellman method and Diffie Hellman parameters of the rebuilding parameters. As an instance of encrypting a slice partial corresponding to DS unit 3, DS unit 3 produces an encrypted slice partial in accordance with a formula: (K3-5)⊕partial (2,3). As an instance of encrypting a slice partial corresponding to DS unit 1, DS unit 1 produces an encrypted slice partial in accordance with a formula: (K1-4)⊕(K1-6)⊕partial (2,1). As an instance of encrypting a slice partial corresponding to DS unit 4, DS unit 4 produces an encrypted slice partial in accordance with a formula: (K1-4)⊕partial (2,4).

Next, each DS unit outputs an encrypted slice partial in accordance with a rebuilding topology of the rebuilding parameters. For example, DS unit 1 sends the encrypted slice partial associated with DS unit 1 directly to DS unit 2 and DS unit 3 sends the encrypted slice partial associated with DS unit 3 to DS unit 4 (e.g., at the same site) in accordance with the rebuilding topology. DS unit 4 receives the encrypted slice partial associated with DS unit 3 and combines the encrypted slice partial associated with DS unit 3 with the encrypted slice partial associated with DS unit 4 in accordance with the rebuilding topology. For instance, DS unit 4 combines the encrypted slice partial associated with DS unit 3 with the encrypted slice partial associated with DS unit 4 utilizing a XOR function in accordance with the formula: combined encrypted slice partial=(K3-5)⊕partial (2,3)⊕(K1-4)⊕partial (2,4). DS unit 4 sends the combined encrypted slice partial to DS unit 2 in accordance with the rebuilding topology.

Next, DS unit 2 receives the decode threshold number of encrypted slice partials as one or more encrypted slice partials and/or one or more combined encrypted slice partials. DS unit 2 combines the one or more encrypted slice partials and/or the one or more combined encrypted slice partials utilizing a decryption algorithm (e.g., XOR) to reproduce the encoded data slice to be rebuilt. For instance, DS unit 2 reproduces the encoded data slice to be rebuilt utilizing a decryption algorithm in accordance with a formula: rebuilt encoded data slice 2=(K1-4)⊕(K1-6)⊕partial (2,1)⊕(K3-5)⊕partial (2,3)⊕(K1-4)⊕partial (2,4)⊕(K3-5)⊕partial (2,5)⊕(K1-6)⊕partial (2,6). Such a decryption algorithm cancels the even number utilization of each key to produce an XOR sequence of the slice partials. Such a XOR of the slice partials reproduces the encoded data slice to be rebuilt. In such an alternative, information leakage is minimized as encoded data slices are not exposed and slice partials are encrypted.

FIG. 9B is a table illustrating an example of a dispersed storage (DS) unit key pair to DS unit key assignment table. Such a table includes a DS unit pair key field, and a DS unit key assignment field. Such a DS unit pair key field includes a plurality of DS unit pair keys entries, wherein each key entry of the plurality of DS unit pair key entries includes two DS unit identifiers (IDs) of a corresponding DS unit pair enabled to utilize the key entry. For example, an entry including K1-3 corresponds to a DS unit pair key to be utilized only by

DS units

1 and 3. For instance, key K1-3 is generated by

DS units

1 and 3 utilizing a Diffie Hellman approach. A number of entries of the DS unit pair key field may be based on a security requirement, a number of DS units, a rebuilding topology, and a network topology.

Such a DS unit key assignment field includes two or more DS unit identifier (ID) fields corresponding to two or more DS units included in a DS unit storage set providing key assignments. An entry (e.g., “X”) associated with a DS unit signifies that the DS unit is assigned to utilize a corresponding DS unit pair key of a corresponding row of the table. For example, two X entries in a column corresponding to DS unit 1 signifies that DS unit 1 is to utilize keys K1-4 and key K1-6.

Such key assignments may be assigned in many different ways in accordance with the rebuilding topology and assignment goals, wherein such assignment goals include one or more of a security goal, a performance goal, and a processing loading goal. For example, assigned keys should not include a key that is shared between a DS unit pair when a first DS unit of the DS unit pair sends an encrypted slice partial to a second DS unit of the DS unit pair since information leakage may occur when the second DS unit combines the encrypted slice partials. As another example, each assigned key should be utilized and even number of times such that each assigned key cancels out (e.g., via an XOR function) when a requesting entity decodes encrypted slice partials to reproduce an encoded data slice to be rebuilt. A method to determine and utilize keys is discussed in greater detail with reference to FIGS. 10-12.

FIG. 10 is a flowchart illustrating an example of generating an encrypted partial slice. The method begins with step 90, where a processing module, for example computing device 16 (FIG. 1), storage unit 36 (FIG. 1), or a DS unit 1-8 (FIG. 9A), receives a rebuilding request, for example from or on behalf of another DS unit. Such a rebuilding request includes one or more of rebuilding participant identifiers (IDs), Diffie Hellman parameters, a rebuilding topology, a number of keys to utilize indicator, a pillar index to rebuild indicator, a slice name list, a requesting entity identifier (ID), a key generation algorithm, a key generation algorithm ID, and rebuilding parameters. The processing module may validate the request by one or more of validating a signature, verifying that the requesting entity ID is associated with one or more slice names of the slice name list (e.g., authorized to rebuild), and validating that the rebuilding topology corresponds to a network topology and/or compares favorably to a functional approach to rebuilding.

The method continues at the step 92, where the processing module determines one or more key pairing entities. Such a determination may be based on one or more of the rebuilding topology, a security requirement, the rebuilding participant identifiers, and a bandwidth utilization requirement. For example, exclude use of a key pair where DS units associated with the key pair are long a same path of the rebuilding topology (e.g., to avoid a leakage).

The method continues at the step 94, where the processing module generates a shared secret key corresponding to each of the one or more key pairing entities. Such generation may include one or more of a lookup, receiving, and utilizing a Diffie Hellman approach (e.g., each DS unit of a DS unit pair utilizes the Diffie Hellman parameters to produce public values which are exchanged and utilized to produce the shared secret key).

The method continues at the step 96, where the processing module generates a slice partial based on a corresponding stored encoded data slice, rebuilding parameters, and information received in the rebuilding request. The method continues at the step where the processing module encrypts the slice partial with each of the shared secret keys to produce an encrypted slice partial. For example, the processing module utilizes a XOR function to XOR each of the shared secret keys and the slice partial to produce the encrypted slice partial. The method continues at the step 100 of the processing module outputs the encrypted slice partial in accordance with the rebuilding topology. For example, the processing module sends the encrypted slice partial to a DS unit assigned as an aggregator. As another example, the processing module sends the encrypted slice partial directly to a DS unit that is a requesting entity.

FIG. 11 is a flowchart illustrating another example of generating an encrypted partial slice, which includes similar steps to FIG. 10. The method begins with steps similar to those discussed with respect to FIG. 9, where a processing module receives a rebuilding request (110) and determines one or more key pairing entities (112). The method continues at step 114, where the processing module obtains a seed key for each of the one or more key pairing entities. Such obtaining can include at least one of retrieving the seed key and generating the seed key utilizing a Diffie Hellman approach (e.g., seed key substantially the same as a shared secret key of a DS unit pair key).

The method continues at the step 116 where the processing module generates a temp key for each seed key. Such generation includes performing a hashing function on a sum of key elements. Such a hashing function includes one or more of a hash algorithm (e.g., message digest (MD)-5, secure hash algorithm (SHA)-1, SHA-256, SHA 512), a hash-based message authentication code (HMAC, e.g., HMAC-MD-5), and a mask generating function (MGF) to expand the temp key to a length substantially the same as a slice partial generated at step 118. Alternatively, a stream cipher with hash/HMAC output as an encryption key (e.g., when stream ciphers uses XOR) may be utilized to expand the temp key length, or a block cipher (e.g., advanced encryption standard AES, data encryption standard DES) using encryption mode such as output feedback (OFB), cipher feedback (CFB), counter mode (CTR) with hash/HMAC output as the encryption key. Such key elements includes one or more of the seed key, a slice name, a requesting entity ID, and a rebuilding participants list. For example, the processing module generates the temp key for a seed key utilizing a formula of: temp key=hashing function (seed key+slice name+slice revision+requesting entity ID+rebuilding participants). Such a temp key may change for each encoded data slice to be rebuilt and such a seed key may be utilized for multiple rebuilding sequences.

The method continues at the step 120 where the processing module encrypts the slice partial generated at block 118 with each of the one or more temp keys utilizing an encryption algorithm to produce an encrypted slice partial. For example, the processing module utilizes a XOR function as the encryption algorithm and performs the XOR function with each of the one or more temp keys and the slice partial to produce the encrypted slice partial. The method continues at the step 122 where the processing module outputs the encrypted slice partial to a requesting entity or to an aggregating DS unit in accordance with the rebuilding topology.

Referring next to FIG. 12, a flowchart illustrating another example of generating an encrypted partial slice is discussed according to various embodiments of the present disclosure. In some implementations employing encrypted slice partials for rebuilding or verification, every partial encrypted slice can be encrypted with every others participant's shared key. However this means that each partial must be encrypted a threshold number of times, by a threshold number of participants. In that case, CPU cost would likely increase as the square of the threshold. To avoid this problem, it is possible to instead encrypt each partial with any even number of participant's shared keys. For instance, imagine arranging the participants in a circle, each participant could encrypt the previous and next participant's shared keys, and in this way all the secrets cancel out. For added security, one might choose to encrypt with the previous two and next two participant's keys, encrypting each partial 4 times (regardless of the threshold). At a minimum, however, in at least one embodiment discussed herein, each partial is encrypted twice.

The method begins with steps similar to some of the steps discussed with respect to FIG. 10, where a processing module receives a rebuilding request (130). The method continues at the step 132 where the processing module determines key pairing requirements. Such key pairing requirements include one or more of a performance requirement, a security requirement, and a processor loading requirement. Such a determination may be based on one or more of the rebuilding request, a predetermination, a message, a dispersed storage network (DSN) performance indicator, a DSN security indicator, a vault identifier (ID), and a requester ID. For example, the processing module determines a lower than average processor loading requirement when the DSN performance indicator indicates that the DSN system is loaded more than average. As another example, the processing module determines a higher than average security requirement when the DSN security indicator indicates that higher security is required.

The method continues at the step 134 where the processing module determines candidate key pairing entities. Such a determination may be based on one or more of the key pairing requirements, a rebuilding topology, a security requirement, rebuilding participants, and a bandwidth utilization requirement. For example, the processing module may determine a lower than average number of candidate key pairing entities when the key pairing requirements includes a lower than average processor loading requirement. As another example, the processing module may determine a higher than average number of candidate key pairing entities when the key pairing requirements includes a higher than average security requirement.

The method continues at the step 136 of the processing module selects one or more key pairing entities of the candidate key pairing entities based on the key pairing requirements. Such a selection may be based on one or more of optimizing a match of the key pairing requirements to an estimated performance an estimated security associated with a desired number of candidate key pairing entities. For example, the processing module selects a lower than average number of key pairing entities for better performance and selects a higher than average number of key pairing entities for better security. As another example, the processing module selects a key pairing entity for utilization of an associated key an even number of times amongst all dispersed storage (DS) units. For instance, the processing module selects a node ahead and a node behind a reference DS unit (e.g., associated with the processing module), wherein the node ahead, the DS unit, and the node behind are substantially sequenced in order in accordance with a rebuilding topology. In another instance, the processing module selects two nodes ahead and two nodes behind.

The method continues with the processing module generating a shared secret key corresponding to each of the one or more key pairing entities (138), generates a partial slice (140), encrypts the partial slice with each of the shared secret keys to produce an encrypted slice partial (142), and outputs the encrypted slice partial in accordance with a rebuilding topology (144).

It is noted that terminologies as may be used herein such as bit stream, stream, signal sequence, etc. (or their equivalents) have been used interchangeably to describe digital information whose content corresponds to any of a number of desired types (e.g., data, video, speech, audio, etc. any of which may generally be referred to as ‘data’).

As may be used herein, the terms “substantially” and “approximately” provides an industry-accepted tolerance for its corresponding term and/or relativity between items. Such an industry-accepted tolerance ranges from less than one percent to fifty percent and corresponds to, but is not limited to, component values, integrated circuit process variations, temperature variations, rise and fall times, and/or thermal noise. Such relativity between items ranges from a difference of a few percent to magnitude differences. As may also be used herein, the term(s) “configured to”, “operably coupled to”, “coupled to”, and/or “coupling” includes direct coupling between items and/or indirect coupling between items via an intervening item (e.g., an item includes, but is not limited to, a component, an element, a circuit, and/or a module) where, for an example of indirect coupling, the intervening item does not modify the information of a signal but may adjust its current level, voltage level, and/or power level. As may further be used herein, inferred coupling (i.e., where one element is coupled to another element by inference) includes direct and indirect coupling between two items in the same manner as “coupled to”. As may even further be used herein, the term “configured to”, “operable to”, “coupled to”, or “operably coupled to” indicates that an item includes one or more of power connections, input(s), output(s), etc., to perform, when activated, one or more its corresponding functions and may further include inferred coupling to one or more other items. As may still further be used herein, the term “associated with”, includes direct and/or indirect coupling of separate items and/or one item being embedded within another item.

As may be used herein, the term “compares favorably”, indicates that a comparison between two or more items, signals, etc., provides a desired relationship. For example, when the desired relationship is that signal 1 has a greater magnitude than signal 2, a favorable comparison may be achieved when the magnitude of signal 1 is greater than that of signal 2 or when the magnitude of signal 2 is less than that of signal 1. As may be used herein, the term “compares unfavorably”, indicates that a comparison between two or more items, signals, etc., fails to provide the desired relationship.

As may also be used herein, the terms “processing module”, “processing circuit”, “processor”, and/or “processing unit” may be a single processing device or a plurality of processing devices. Such a processing device may be a microprocessor, micro-controller, digital signal processor, microcomputer, central processing unit, field programmable gate array, programmable logic device, state machine, logic circuitry, analog circuitry, digital circuitry, and/or any device that manipulates signals (analog and/or digital) based on hard coding of the circuitry and/or operational instructions. The processing module, module, processing circuit, and/or processing unit may be, or further include, memory and/or an integrated memory element, which may be a single memory device, a plurality of memory devices, and/or embedded circuitry of another processing module, module, processing circuit, and/or processing unit. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. Note that if the processing module, module, processing circuit, and/or processing unit includes more than one processing device, the processing devices may be centrally located (e.g., directly coupled together via a wired and/or wireless bus structure) or may be distributedly located (e.g., cloud computing via indirect coupling via a local area network and/or a wide area network). Further note that if the processing module, module, processing circuit, and/or processing unit implements one or more of its functions via a state machine, analog circuitry, digital circuitry, and/or logic circuitry, the memory and/or memory element storing the corresponding operational instructions may be embedded within, or external to, the circuitry comprising the state machine, analog circuitry, digital circuitry, and/or logic circuitry. Still further note that, the memory element may store, and the processing module, module, processing circuit, and/or processing unit executes, hard coded and/or operational instructions corresponding to at least some of the steps and/or functions illustrated in one or more of the Figures. Such a memory device or memory element can be included in an article of manufacture.

One or more embodiments have been described above with the aid of method steps illustrating the performance of specified functions and relationships thereof. The boundaries and sequence of these functional building blocks and method steps have been arbitrarily defined herein for convenience of description. Alternate boundaries and sequences can be defined so long as the specified functions and relationships are appropriately performed. Any such alternate boundaries or sequences are thus within the scope and spirit of the claims. Further, the boundaries of these functional building blocks have been arbitrarily defined for convenience of description. Alternate boundaries could be defined as long as the certain significant functions are appropriately performed. Similarly, flow diagram blocks may also have been arbitrarily defined herein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence could have been defined otherwise and still perform the certain significant functionality. Such alternate definitions of both functional building blocks and flow diagram blocks and sequences are thus within the scope and spirit of the claims. One of average skill in the art will also recognize that the functional building blocks, and other illustrative blocks, modules and components herein, can be implemented as illustrated or by discrete components, application specific integrated circuits, processors executing appropriate software and the like or any combination thereof.

In addition, a flow diagram may include a “start” and/or “continue” indication. The “start” and “continue” indications reflect that the steps presented can optionally be incorporated in or otherwise used in conjunction with other routines. In this context, “start” indicates the beginning of the first step presented and may be preceded by other activities not specifically shown. Further, the “continue” indication reflects that the steps presented may be performed multiple times and/or may be succeeded by other activities not specifically shown. Further, while a flow diagram indicates a particular ordering of steps, other orderings are likewise possible provided that the principles of causality are maintained.

The one or more embodiments are used herein to illustrate one or more aspects, one or more features, one or more concepts, and/or one or more examples. A physical embodiment of an apparatus, an article of manufacture, a machine, and/or of a process may include one or more of the aspects, features, concepts, examples, etc. described with reference to one or more of the embodiments discussed herein. Further, from figure to figure, the embodiments may incorporate the same or similarly named functions, steps, modules, etc. that may use the same or different reference numbers and, as such, the functions, steps, modules, etc. may be the same or similar functions, steps, modules, etc. or different ones.

Unless specifically stated to the contra, signals to, from, and/or between elements in a figure of any of the figures presented herein may be analog or digital, continuous time or discrete time, and single-ended or differential. For instance, if a signal path is shown as a single-ended path, it also represents a differential signal path. Similarly, if a signal path is shown as a differential path, it also represents a single-ended signal path. While one or more particular architectures are described herein, other architectures can likewise be implemented that use one or more data buses not expressly shown, direct connectivity between elements, and/or indirect coupling between other elements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of the embodiments. A module implements one or more functions via a device such as a processor or other processing device or other hardware that may include or operate in association with a memory that stores operational instructions. A module may operate independently and/or in conjunction with software and/or firmware. As also used herein, a module may contain one or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes one or more memory elements. A memory element may be a separate memory device, multiple memory devices, or a set of memory locations within a memory device. Such a memory device may be a read-only memory, random access memory, volatile memory, non-volatile memory, static memory, dynamic memory, flash memory, cache memory, and/or any device that stores digital information. The memory device may be in a form a solid state memory, a hard drive memory, cloud memory, thumb drive, server memory, computing device memory, and/or other physical medium for storing digital information.

While particular combinations of various functions and features of the one or more embodiments have been expressly described herein, other combinations of these features and functions are likewise possible. The present disclosure is not limited by the particular examples disclosed herein and expressly incorporates these other combinations.

Claims

What is claimed is:

1. A method for use in a distributed storage network (DSN) including a plurality of distributed storage (DS) units, the method comprising:

receiving, at a DS unit, a rebuilding request indicating that the DS unit is to provide an encrypted partial slice to a requesting DS unit included in the DS network;

determining key pairing requirements associated with the rebuilding request;

selecting an even number of key pairing entities based on the key pairing requirements, the even number of key pairing entities being fewer than a decode threshold number of key pairing entities, wherein the selecting an even number of key pairing entities includes optimizing a match of the key pairing requirements to an estimated performance and estimated security associated with a desired number of candidate key pairing entities;

generating shared secret keys corresponding to each of the even number of key pairing entities;

generating an encrypted partial slice by encrypting a partial slice associated with the DS unit using the shared secret keys corresponding to each of the even number of key pairing entities; and

transmitting the encrypted partial slice to the requesting DS unit in accordance with a rebuilding topology.

2. The method of claim 1, further comprising:

determining candidate key pairing entities; and

selecting the even number of key pairing entities from among the candidate key pairing entities.

3. The method of claim 2, further comprising:

determining candidate key pairing entities based on a rebuilding topology.

4. The method of claim 3, further including:

selecting, as the even number of key pairing entities, a node ahead of the DS unit and a node behind the DS unit.

5. The method of claim 2, further comprising:

determining candidate key pairing entities based on rebuilding participants.

6. The method of claim 1, further comprising:

determining the key pairing requirements based on at least one of the following: the rebuilding request, a predetermination, a message, a DSN performance indicator, a DSN security indicator, a vault ID, or a requester ID.

7. A distributed storage (DS) unit included in a distributed storage network (DSN) including a plurality of DS units, the DS unit comprising:

a computing core including a processor and associated memory;

a communications interface, coupled to the computing core, and configured to receive a rebuilding request indicating that the DS unit is to provide an encrypted partial slice to a requesting DS unit included in the DS network;

the computing core configured to:

determine key pairing requirements associated with the rebuilding request;

select an even number of key pairing entities based on the key pairing requirements, the even number of key pairing entities being fewer than a decode threshold number of key pairing entities, wherein the selecting an even number of key pairing entities includes optimizing a match of the key pairing requirements to an estimated performance and estimated security associated with a desired number of candidate key pairing entities;

generate shared secret keys corresponding to each of the even number of key pairing entities;

generate an encrypted partial slice by encrypting a partial slice associated with the DS unit using the shared secret keys corresponding to each of the even number of key pairing entities; and

transmit the encrypted partial slice to the requesting DS unit in accordance with a rebuilding topology.

8. The distributed storage (DS) unit of claim 7, further comprising:

determining candidate key pairing entities; and

9. The distributed storage (DS) unit of claim 8, further comprising:

determining candidate key pairing entities based on a rebuilding topology.

10. The distributed storage (DS) unit of claim 9, further including:

11. The distributed storage (DS) unit of claim 8, further comprising:

determining candidate key pairing entities based on rebuilding participants.

12. The distributed storage (DS) unit of claim 7, further comprising:

13. A distributed storage network (DSN) comprising:

a plurality of distributed storage (DS) units each of the plurality of DS units including a processor and associated memory;

a requesting DS unit configured to transmit a rebuilding request to at least one other DS unit, the rebuilding request indicating that the at least one other DS unit is to provide an encrypted partial slice to the requesting DS unit;

the at least one other DS unit configured to respond to the rebuilding request by:

determining key pairing requirements associated with the rebuilding request;

generating an encrypted partial slice by encrypting a partial slice associated with the at least one other DS unit using the shared secret keys corresponding to each of the even number of key pairing entities; and

14. The distributed storage network (DSN) of claim 13, further comprising:

determining candidate key pairing entities; and

15. The distributed storage network (DSN) of claim 14, further comprising:

determining candidate key pairing entities based on at least one of a rebuilding topology or rebuilding participants.

16. The distributed storage network (DSN) of claim 15, further including:

selecting, as the even number of key pairing entities, a node ahead of the at least one other DS unit and a node behind the at least one other DS unit.

17. The distributed storage network (DSN) of claim 13, further comprising: