US 8,429,428 B2Grant
System and method for providing encryption in storage operations in a storage network, such as for use by application service providers that provide data storage services
Issue Date:2013-04-23
•16 Claims
•14 Drawing Sheets
Abstract
In accordance with embodiments of the invention, a method is provided for performing a storage operation in a pipeline storage system in which one or more data streams containing data to be stored are written into data chunks. The method includes generating an encryption key associated with a first archive file to be stored when encryption is requested for the storage operation, encrypting the archive data from the data stream using the encryption key to create an encrypted data chunk when a data stream containing the archive file is processed in the pipeline storage system, storing the encrypted data chunk on a storage medium, and storing the encryption key in a manner accessible during a restore operation of the encrypted data chunk.
Metadata
Assignee
- CommVault Systems, Inc.
Inventors
- Paul Ignatius
- Anand Prahlad
- Mahesh Tyagarajan
- Manoj Vijayan Retnamma
- Arun Amarendran
- Rajiv Kottomtharayil
Application Information
Application Number:US 12/796,007
Filing Date:2010-06-08
Priority Date:1998-03-11
Art Unit:2432
Classifications
IPC:
G06F11/00
Patent Drawings (14 sheets)
Description
Cross-Reference to Related Application(s)
[0001] This application is continuation of U.S. patent application Ser. No. 11/843,453 titled SYSTEM AND METHOD FOR PROVIDING ENCRYPTION IN PIPELINED STORAGE OPERATIONS IN A STORAGE NETWORK, filed Aug. 22, 2007, now U.S. Pat. No. 7,739,381, which is continuation of U.S. patent application Ser. No. 10/990,284, titled SYSTEM AND METHOD FOR PROVIDING ENCRYPTION IN A STORAGE NETWORK BY STORING A SECURED ENCRYPTION KEY WITH ENCRYPTED ARCHIVE DATA IN AN ARCHIVE STORAGE DEVICE, filed Nov. 15, 2004, now U.S. Pat. No. 7,277,941, which is a continuation-in-part of U.S. patent application Ser. No. 10/144,683 titled PIPELINED HIGH SPEED DATA TRANSFER MECHANISM, filed May 13, 2002, now U.S. Pat. No. 7,401,154, which was a continuation of U.S. patent application Ser. No. 09/038,440 filed Mar. 11, 1998, now U.S. Pat. No. 6,418,478; all of which are hereby incorporated by reference in their entireties.
[0002] Application Ser. No. 10/990,284 also claims the benefit of U.S. Provisional Patent Application No. 60/519,526 titled SYSTEM AND METHOD FOR PERFORMING PIPELINED STORAGE OPERATIONS IN A STORAGE NETWORK, filed Nov. 13, 2003, which application is incorporated herein by reference in its entirety.
[0003] This application is related to the following patents and pending applications, each of which is hereby incorporated herein by reference in its entirety:
-
- [0004] Application Ser. No. 10/990,357 titled SYSTEM AND METHOD FOR COMBINING DATA STREAMS IN PIPELINED STORAGE OPERATIONS IN A STORAGE NETWORK, filed Nov. 15, 2004, now U.S. Pat. No. 7,315,923;
- [0005] Application Ser. No. 09/495,751, titled HIGH SPEED TRANSFER MECHANISM, filed Feb. 1, 2000, now U.S. Pat. No. 7,209,972;
- [0006] Application Ser. No. 09/610,738, titled MODULAR BACKUP AND RETRIEVAL SYSTEM USED IN CONJUNCTION WITH A STORAGE AREA NETWORK, filed Jul. 6, 2000, now U.S. Pat. No. 7,035,880;
- [0007] Application Ser. No. 09/774,268, titled LOGICAL VIEW AND ACCESS TO PHYSICAL STORAGE IN MODULAR DATA AND STORAGE MANAGEMENT SYSTEM, filed Jan. 30, 2001, now U.S. Pat. No. 6,542,972;
- [0008] Application Ser. No. 10/658,095, titled DYNAMIC STORAGE DEVICE POOLING IN A COMPUTER SYSTEM, filed Sep. 9, 2003, now U.S. Pat. No. 7,130,970; and
- [0009] Application Ser. No. 60/460,234, titled SYSTEM AND METHOD FOR PERFORMING STORAGE OPERATIONS IN A COMPUTER NETWORK, filed Apr. 3, 2003.
Technical Field
[0010] The invention relates to data transfer mechanisms, and in particular, to a software-based, high speed data pipe for providing high speed and reliable data transfer between computers.
Background
[0011] Data, in the process of being archived or transferred from one location to another, will pass through various phases where different operations such as compression, network transfer, storage, etc. will take place on it. There are essentially two approaches that can be taken when implementing such a transfer mechanism. One would be to split the archival process into sub-tasks, each of which would perform a specific function (e.g. Compression). This would then require copying of data between the sub-tasks, which could prove processor intensive. The other method would be to minimize copies, and have a monolithic program performing all of the archival functions. The downside to this would be loss of parallelism. A third alternative would of course be to use threads to do these tasks and use thread-signaling protocols, however, it is realized that this would not be entirely practical since threads are not fully supported on many computing platforms.
[0012] Accordingly, it is highly desirable to obtain a high-speed data transfer mechanism implemented in software and developed for the needs of high speed and reliable data transfer between computers. It is also desirable to provide a mechanism to encrypt the data being transferred.
Summary
[0013] In accordance with embodiments of the invention, a method is provided for performing a storage operation in a pipeline storage system in which one or more data streams containing data to be stored are written into data chunks. The method includes generating an encryption key associated with a first archive file to be stored when encryption is requested for the storage operation, encrypting the archive data from the data stream using the encryption key to create an encrypted data chunk when a data stream containing the archive file is processed in the pipeline storage system, storing the encrypted data chunk on a storage medium, and storing the encryption key in a manner accessible during a restore operation of the encrypted data chunk.
Brief Description of the Drawings
[0014] The invention will be better understood with reference to the following drawings, in which:
[0015] FIG. 1A is a block diagram of a network architecture for a system to perform storage operations on electronic data in a computer network according to an embodiment of the invention.
[0016] FIG. 1B is a block diagram of the data pipe architecture in accordance with one embodiment of the present invention.
[0017] FIG. 2A is a schematic of the data pipe transfer process on a single computer according to an embodiment of the invention.
[0018] FIG. 2B is a schematic of the data pipe transfer process on multiple computers according to another embodiment of the invention.
[0019] FIG. 2C is a schematic of the data pipe transfer buffer allocation process from a buffer pool stored in the shared memory according to an embodiment of the invention.
[0020] FIG. 2D is a schematic illustrating the controlling relationship of the master monitor process to the various attached processes according to an embodiment of the invention.
[0021] FIGS. 3A-3C illustrate various messages transferred between application processes and the master monitor process according to an embodiment of the invention.
[0022] FIG. 4 is a schematic of the module attachment process to shared memory space in accordance with the present invention.
[0023] FIGS. 5A-5B depict flow diagrams of the operation of the sequencer and resequencer processes according to the present invention.
[0024] FIG. 6 depicts an exemplary data transfer flow among various processing stages within the pipeline according to the present invention.
[0025] FIG. 7 illustrates a data pipe transfer process on multiple computers having processes with multiple instantiations according to an embodiment of the present invention.
[0026] FIG. 8 depicts a screenshot of a user interface according to an embodiment of the present invention.
Detailed Description
[0027] The present invention includes methods and systems operating in conjunction with a modular storage system to enable computers on a network to share storage devices on a physical and logical level. An exemplary modular storage system is the GALAXY™ backup and retrieval system and QiNetix™ storage management system available from CommVault Systems of New Jersey. The modular architecture underlying this system is described in the above referenced patent applications, each of which is incorporated herein.
[0028] Preferred embodiments of the invention are now described with reference to the drawings. An embodiment of the system of the present invention is shown in FIG. 1 . As shown, the system includes a client 8, a data agent 95A, an information store 90A, a storage manager (or storage management component) 100A, a jobs agent 102A, a storage manager index 107A, one or more media management components (or media agent) 105A, one or more media agent indexes 110A, and one or more storage devices 115A. Although FIG. 1 depicts a system having two media agents 105A, there may be one media agent 105A, or a plurality of media agents 105A providing communication between the client 8, storage manager 100A and the storage devices 115A. In addition, the system can include one or a plurality of storage devices 115A.
[0029] A client 8 can be any networked client 8 and preferably includes at least one attached information store 90A. The information store 90A may be any memory device or local data storage device known in the art, such as a hard drive, CD-ROM drive, tape drive, RAM, or other types of magnetic, optical, digital and/or analog local storage. In some embodiments of the invention, the client 8 includes at least one data agent 95A, which is a software module that is generally responsible for performing storage operations on data of a client 8 stored in information store 90A or other memory location. Storage operations include, but are not limited to, creation, storage, retrieval, migration, deletion, and tracking of primary or production volume data, secondary volume data, primary copies, secondary copies, auxiliary copies, snapshot copies, backup copies, incremental copies, differential copies, synthetic copies, HSM copies, archive copies, Information Lifecycle Management (“ILM”) copies, and other types of copies and versions of electronic data. In some embodiments of the invention, the system provides at least one, and typically a plurality of data agents 95A for each client, each data agent 95A is intended to backup, migrate, and recover data associated with a different application. For example, a client 8 may have different individual data agents 95A designed to handle Microsoft Exchange data, Lotus Notes data, Microsoft Windows file system data, Microsoft Active Directory Objects data, and other types of data known in the art.
[0030] The storage manager 100A is generally a software module or application that coordinates and controls the system, for example, the storage manager 100A manages and controls storage operations performed by the system. The storage manager 100A communicates with all components of the system including client 8, data agent 95A, media agent 105A, and storage devices 115A to initiate and manage storage operations. The storage manager 100A preferably has an index 107A, further described herein, for storing data related to storage operations. In general, the storage manager 100A communicates with storage devices 115A via a media agent 105A. In some embodiments, the storage manager 100A communicates directly with the storage devices 115A.
[0031] The system includes one or more media agent 105A. The media agent 105A is generally a software module that conducts data, as directed by the storage manager 100A, between the client 8 and one or more storage devices 115A, for example, a tape library, a hard drive, a magnetic media storage device, an optical media storage device, or other storage device. The media agent 105A is communicatively coupled with and controls the storage device 115A. For example, the media agent 105A might instruct a storage device 115A to perform a storage operation, e.g., archive, migrate, or restore application specific data. The media agent 105A generally communicates with the storage device 115A via a local bus such as a SCSI adaptor.
[0032] Each media agent 105A maintains an index cache 110A which stores index data that the system generates during storage operations as further described herein. For example, storage operations for Microsoft Exchange data generate index data. Media management index data includes, for example, information regarding the location of the stored data on a particular media, information regarding the content of the information stored such as file names, sizes, creation dates, formats, application types, and other file-related criteria, information regarding one or more clients associated with the information stored, information regarding one or more storage policies, storage criteria, or storage preferences associated with the information stored, compression information, retention-related information, encryption-related information, stream-related information, and other types of information. Index data thus provides the system with an efficient mechanism for performing storage operations including locating user files for recovery operations and for managing and tracking stored data.
[0033] The system generally maintains two copies of the media management index data regarding particular stored data. A first copy is generally stored with the data copied to a storage device 115A. Thus, a tape may contain the stored data as well as index information related to the stored data. In the event of a system restore, the index information stored with the stored data can be used to rebuild a media agent index 110A or other index useful in performing storage operations. In addition, the media agent 105A that controls the storage operation also generally writes an additional copy of the index data to its index cache 110A. The data in the media agent index cache 110A is generally stored on faster media, such as magnetic media, and is thus readily available to the system for use in storage operations and other activities without having to be first retrieved from the storage device 115A.
[0034] The storage manager 100A also maintains an index cache 107A. Storage manager index data is used to indicate, track, and associate logical relationships and associations between components of the system, user preferences, management tasks, and other useful data. For example, the storage manager 100A might use its index cache 107A to track logical associations between media agent 105A and storage devices 115A. The storage manager 100A may also use its index cache 107A to track the status of storage operations to be performed, storage patterns associated with the system components such as media use, storage growth, network bandwidth, service level agreement (“SLA”) compliance levels, data protection levels, storage policy information, storage criteria associated with user preferences, retention criteria, storage operation preferences, and other storage-related information.
[0035] A storage policy is generally a data structure or other information which includes a set of preferences and other storage criteria for performing a storage operation. The preferences and storage criteria may include, but are not limited to: a storage location, relationships between system components, network pathway to utilize, retention policies, data characteristics, compression or encryption requirements, preferred system components to utilize in a storage operation, and other criteria relating to a storage operation. A storage policy may be stored to a storage manager index, to archive media as metadata for use in restore operations or other storage operations, or to other locations or components of the system.
[0036] Index caches 107A and 110A typically reside on their corresponding storage component's hard disk or other fixed storage device. For example, the jobs agent 102A of a storage manager 100A may retrieve storage manager index 107A data regarding a storage policy and storage operation to be performed or scheduled for a particular client 8. The jobs agent 102A, either directly or via another system module, communicates with the data agent 95A at the client 8 regarding the storage operation. In some embodiments, the jobs agent 102A also retrieves from the index cache 107A a storage policy associated with the client 8 and uses information from the storage policy to communicate to the data agent 95A one or more media agents 105A associated with performing storage operations for that particular client 8 as well as other information regarding the storage operation to be performed such as retention criteria, encryption criteria, streaming criteria, etc. The data agent 95A then packages or otherwise manipulates the client information stored in the client information store 90A in accordance with the storage policy information and/or according to a user preference, and communicates this client data to the appropriate media agent(s) 100A for processing. The media agent(s) 105A store the data according to storage preferences associated with the storage policy including storing the generated index data with the stored data, as well as storing a copy of the generated index data in the media agent index cache 110A.
[0037] In some embodiments, components of the system may reside and execute on the same computer. In some embodiments, a client component such as a data agent 95A, a media agent 105A, or a storage manager 100A coordinates and directs local archiving, migration, and retrieval application functions as further described in application Ser. No. 09/610,738. These client components can function independently or together with other similar client components.
[0038] Data and other information is transported throughout the system via buffers and network pathways including, among others, a high-speed data transfer mechanism, such as the CommVault DataPipe™, as further described in U.S. Pat. No. 6,418,478 and application Ser. No. 09/495,751, each of which is hereby incorporated herein by reference in its entirety. Self describing tag headers are disclosed in these applications wherein data is transferred between a flexible grouping of data transport modules each supporting a separate function and leveraging buffers in a shared memory space. Thus, a data transport module receives a chunk of data and decodes how the data should be processed according to information contained in the chunk's header, and in some embodiments, the chunk's trailer. U.S. Pat. No. 6,418,478 and application Ser. No. 09/495,751 generally address “logical data” transported via TCP/IP, however, embodiments of the invention herein are also contemplated which are directed to transporting, multiplexing, encrypting, and generally processing block level data as disclosed, for example, in pending application Ser. No. 10/803,542, titled Method And System For Transferring Data In A Storage Operation, which is hereby incorporated herein by reference in its entirety.
[0039] As discussed, these applications generally disclose systems and methods of processing logical data. Thus, for example, contiguous blocks of data from a file might be written on a first volume as blocks 1, 2, 3, 4, 5, etc. The operating system of the host associated with the first volume would assist in packaging the data adding additional OS-specific information to the chunks. Thus, when transported and stored on a second volume, the blocks might be written to the second in a non-contiguous order such as blocks 2, 1, 5, 3, 4. On a restore storage operation, the blocks could (due to the OS-specific information and other information) be restored to the first volume in contiguous order, but there was no control over how the blocks were laid out or written to the second volume. Incremental block level backups of file data was therefore extremely difficult if not impossible in such a system since there was no discernable relationship between how blocks were written on the first volume and how they were written on the second volume.
[0040] Thus, in some embodiments, the system supports transport and incremental backups (and other storage operations) of block level data via a TCP/IP (and other transport protocols) over a LAN, WAN, SAN, etc. Additional data is added to the multi-tag header discussed in the applications referenced above which communicates how each block was written on the first volume. Thus, for example, a header might contain a file map of how the blocks were written on the first volume and the map could be used to write the blocks in similar order on the second volume. In other embodiments, each chunk header might contain a pointer or other similar data structure indicating the chunk's position relative to other chunks in the file. Thus, when a file block or other block changed on the first volume, the system could identify and update the corresponding copy of the block located on the second volume and effectively perform an incremental backup or other storage operation.
[0041] In the system, for example as in the CommVault Galaxy system, archives are grouped by Storage Policy. Many clients/sub clients can point to the same Storage Policy. Each Storage Policy has a Primary copy and zero or more Secondary copies. Each Copy has one or more streams related to the number of Drives in a Drive Pool.
[0042] The system uses a tape media to its maximum capacity and throughput by multiplexing data from several clients onto the same media at the same time. The system allows for a stream to be reserved more than once by different clients and have multiple data movers write to this same piece of media.
[0043] During backup or other storage operations, data from a data agent to a media agent is transferred over a “Data pipeline” as further described herein and in U.S. Pat. No. 6,418,478 and application Ser. No. 09/495,751. One or more transport processes or modules, such as the Dsbackup in the CommVault Galaxy system, form the tail end on the Media Agent for the pipeline. For example, in the Galaxy system, the Datamover process running as part of Dsbackup is responsible for writing data to the media. For data multiplexing, many such Data movers belonging to different pipelines have to write to the same piece of media. This can be achieved by splitting the Datamover pipeline process into multiple components including a data receiver, a data writer, and other modules as necessary.
The DataPipe
[0044] A DataPipe comprises a named set of tasks executing within one or more computers that cooperate with each other to transfer and process data in a pipelined manner. Within a DataPipe, a pipeline concept is used to improve performance of data transfer across multiple computers in a network. However, within a DataPipe, any stage within the pipeline may have multiple instances, thus greatly increasing the scaleability and performance of the basic pipeline concept.
[0045] The DataPipe mechanism processes data by dividing its processing into logical tasks that can be performed in parallel. It then sequences those tasks in the order in which they are to act on the data. For example, a head task may extract data from a database, a second task may encrypt it, a third may compress it, a fourth may send it out over the network, a fifth may receive it from the network, and a sixth may write it to a tape. The latter two tasks may reside on a different computer than the others, for example.
[0046] All of the tasks that comprise a single DataPipe on a given computer have access to a segment of shared memory that is divided into a number of buffers. A small set of buffer manipulation primitives is used to allocate, free, and transfer buffers between tasks.
[0047] Semaphores (or other OS specific mutual exclusion or signaling primitives) are used to coordinate access to buffers between tasks on a given computer. Special tasks, called network agents, send and receive data across network connections using standard network protocols. These agents enable a DataPipe to connect across multiple computer systems. A single DataPipe can therefore reside on more than one computer and could reside on computers of different types.
[0048] Each task may be implemented as a separate thread, process, or as a procedure depending on the capabilities of the computing system on which the DataPipe is implemented.
[0049] As mentioned previously, each task may be implemented as a separate thread, or process, or as a procedure in a monolithic process (in cases where native platforms don't support any forms of parallel execution or multi processing). For data transfer across network, dedicated network readers and writers ensure communication across the net. FIG. 1B shows a steady state picture of how the DataPipe architecture 10 is set up according to the present invention.
[0050] Referring to FIG. 1B , there is shown a disk 20 residing on a computer machine 30 which houses information or data to be backed up or archived to server computer 40 via DLT device drivers 50 and 60 respectively. As one can ascertain, the DataPipe represents the end-to-end architecture which may be utilized during database backup from the disk drive 20 where the database resides to the tape or optical devices 50 and 60 at server 40. The DataPipe thus removes the network as the limiting factor in backup performance. As a result, the device pool defines the performance capabilities.
[0051] As shown in FIG. 1B , the DataPipe or stream 70 is created for the transfer of data for each device in the device pool to be used simultaneously, which comprises modules 72, 74, 76, and 78 and 50. Similarly, a second DataPipe 80 is shown comprised of modules 82, 84, 76, 78 and 60. Note that if additional DLT devices are used to backup data and parallel further DataPipes would be provided. Since one can ascertain the concept of the DataPipe through explanation of one path or thread by which data is transferred, further description will focus on processing through a single DataPipe or stream 70, as shown in FIG. 1B . At the head of the DataPipe is the collector component 72 which is responsible for obtaining the database information from disk 20. The data is passed down in buffers residing in dedicated shared memory through the pipeline 70, through an optional compression module 74, to the network interface modules 76. At the network interface, data is multiplexed and parallel network paths 77 obtain maximum throughput across the network. Preferably, each network path runs at a rate equal to approximately 10 base T or the number of network paths utilized for each stream as determined by the bandwidth of the network. Note that as higher performance levels are necessary, additional devices may be used simultaneously with additional network interfaces added and utilized to further increase network throughput. On the receiving side, from the database server 40, the device pull appears local to the machine and the DataPipe architecture appears as a cloud with no constraints to performance. Network interface module 78 operates to transfer the data received across the network to device driver 50 for storage at server 40. Thus, the final task of storing or archiving the data is accomplished at DLT device module 50.
[0052] From the preceding discussion, one can ascertain that a pipeline or DataPipe 10 comprises a head task 15 that generates the data to be archived or transferred from store 50, and a tail task 40 which accomplishes the final task of storing or writing the data to store 60, including archiving or restoring on the data as shown in FIG. 2A . One or more middle modules 20, 30 may exist, which processes the data by performing actions such as compression, encryption, content analysis, etc., or by allocating or not allocating new buffers while doing the processing.
[0053] A pipeline on a particular machine can be arranged to provide a feed to another different machine. A schematic diagram is illustrated in FIG. 2B . In this case, the DataPipe resides on more than one computer. This is done with the aid of network agents and control processors 50A, 50B, 60A and 60B. In such cases, the first machine 12A has a head 15 and other modules 20, 30, etc. comprise middle processes, but the tail of this pipeline on this machine is a cluster of dedicated network agents 50A which send data across to the remote machine 12B via standard network protocols. On the remote machine, a cluster of dedicated network reader agents 50B act as the head, and along with other modules such as middle (not shown) and tail 70, constitute the pipeline on that machine.
[0054] In addition to the transferring of data from one computer to another, a unique capability of the datapipe invention is the ability to scale to enable full utilization of the bandwidth of a network, and to fully utilize the number of peripheral devices such as tape drives, or fully utilize other hardware components such as CPUs. The scaleability of a DataPipe is achieved by using multiple instances of each task in the pipeline.
[0055] For example, multiple head tasks operating in parallel may gather data from a database and deposit it into buffers. Those buffers may then be processed by several parallel tasks that perform a function such as encryption. The encryption tasks in turn may feed several parallel tasks to perform compression, and several parallel tasks may perform network send operations to fully exploit network bandwidth. On the target computer, several network reader tasks may receive data, which is written to multiple tape units by several tasks. All of these tasks on both computers are part of the same DataPipe and collectively perform the job of moving data from the database to tape units. They do this job extremely efficiently by fully utilizing all available bandwidth and hardware allocated to the DataPipe while also minimizing CPU cycles by avoiding unnecessary copying of the data as it moves from one stage of the DataPipe to the next.
[0056] FIG. 2B shows the multiple computer case where a single head task (collect process) gathers data from the disk 40 and deposits it into buffers. The buffers are then processed by several parallel instantiations of compression process 20 which upon completion of processing of each buffer for each instantiation sends the process buffer to process 30 which performs content analysis, and sends the processed buffer data to several network agent tasks 50A or instantiations, which perform the network operations to send the data over the physical network 55 where it is received and processed by corresponding network agents 50B on the remote computer 12B and sent to tail backup/restore process 70 for storage or writing to DLT drive 80.
[0057] In general, there could be N stages in a given DataPipe pipeline. At each stage of the pipeline, there could be p instances of a given module task. These N stages could all be on the local machine or could be split across two different machines in which case there are network writers and network readers (i.e. pseudo tail and head network agents) which work together to ensure continuity in the pipeline.
[0058] Referring to FIG. 2B , each DataPipe has a dedicated memory segment 85 on each machine on which the DataPipe resides. For example, a DataPipe that sends data from machine 12A to machine 12B has two dedicated memory segments, one on machine A and one on machine B. Tasks that are part of this DataPipe may allocate and free buffers within these memory segments. Of course, tasks operating on machine 12A may only allocate or free buffers within the memory segment 85 on machine A and likewise for tasks on machine B. Thus, any of these modules may allocate or free segments of a single large shared memory on each machine dedicated for the use of this particular pipeline.
Buffer Manipulation Primitives
[0059] Referring now to FIG. 2C , each task or process (15) that wishes to allocate a buffer does it from a buffer pool 75 stored in the shared memory segment 85 owned by the DataPipe using AllocBuf( ) Each task that wishes to process incoming data from the previous task executes a receive call using ReceiveBuf( ) Each task that wishes to relinquish control of a particular buffer so that the next task can operate on it, performs a SendBuf( ) on that buffer to send it to the next task. Each task that wishes to destroy a buffer and return it into the buffer pool, does so by executing a FreeBuf( ) on that buffer.
[0060] Master_Monitor is connected to a predefined port, to enable it to communicate with its peers on other computer systems. Master_Monitor monitors the status of all DataPipes under its control at all times and is able to provide status of the DataPipe to the application software that uses the DataPipe.
[0061] To accomplish these above tasks, a master manager program called Master_Monitor executes in the preferred embodiment as a daemon on all process machines, listening on a well-known port, to serve requirements of pipeline operations. Master_Monitor functions to monitor status of all pipelines under its control at all times and reports status of the pipeline to all its sub-modules. As shown in FIGS. 2B and 2D , Master_Monitor includes control messaging sockets 92 open to all modules through which it can control or change status of execution of each module. Master_Monitor 90 further includes functions which monitor status and listings of all centrally shared resources (among various modules of the same pipeline) such as shared memory or semaphores or any similar resource. Master_Monitor unless otherwise requested will initiate all modules of the pipeline either by fork( ) or thread_create( ) or a similar OS specific thread of control initiation mechanism. Master_Monitor will permit initiation of a pipeline with proper authentication. This initiator process can identify itself as either a head process or a tail process, which will later attach itself to the pipeline. (Exception is made in the case of a networking module, for this facility. A network process will not be allowed to attach itself as a the head or tail of any pipeline.)
DataPipe Initiation
[0062] Referring now to FIG. 3A in conjunction with FIGS. 1 and 2A-D, a DataPipe is created by calling Master_Monitor and passing it an Initiate_Pipe message. In this message, parameters such as the DataPipe name, DataPipe component module names, the number of parallel instances for each component, properties of each component (e.g. whether they allocate buffers or not), local and remote machines involved in the DataPipe, direction of flow, nature of the invocation program etc. are passed to Master_Monitor. Note that the term “module” refers to a program that is executed as a task as part of an instance of a DataPipe. Each module may have more than one instance (e.g. execute as more than one task) within a DataPipe.
[0063] Referring now to FIG. 3B , depending upon the nature of the invocation program, it may be required that the process invoking the DataPipe needs to identify itself to the local Master_Monitor 90A and attach itself to the DataPipe as a head or tail task. In order to operate over a network on two computers, the Master_Monitor 90 initiates a Network Controller Process 60 on the first machine which contacts Master_Monitor 90B on the second machine where this DataPipe is to be completed using an Extend Pipe message. All information required for establishing the second side of the DataPipe is passed along with this call so that the DataPipe is completely established across both machines.
Identification
[0064] The process responsible for initiation of the pipeline constructs a name for the pipeline using its own process Id, a time stamp, and the name of the machine where the initiator process is running. This pipeline name is passed along with both the Initiate-Pipe as well as the EXTEND_Pipe message so that the pipeline is identified with the same name on all computers on which it is operating (i.e. both the remote as well as the local machine). All shared memory segments and semaphores (reference numeral 85 of FIG. 2C ) attached to a particular pipeline are name referenced with this pipeline name and definite offsets. Hence the process of identification of a specific semaphore or shared memory associated with this pipeline is easy and accessible for all processes, and bound modules (i.e., modules for which control is initiated by the Master_Monitor). Each unbound module (i.e., a module not initiated via Master_Monitor, which attaches itself after the pipeline is initiated) must identify itself to its local Master_Monitor via a SEND_IDENT message shown in FIG. 3C . This message contains the name of the pipeline the unbound module wants to attach itself to, a control socket, and a process/thread id, which Master_Monitor uses to monitor status of this particular module.
Data Transfer Implementation
[0065] Allocation: Receive: Send: Free
[0066] Directing attention to FIG. 2C and FIG. 4 , buffers are allocated using the call AllocBuf( ) from a common pool of buffers specified for the particular pipeline. The pool consists of a single large shared memory space 75 with Max Buffers number of equally sized buffers and an ‘rcq’ structure. The ‘rcq’ structure illustrated in FIG. 4 , contains input and output queues for each stage of the pipeline on that particular machine. Access to shared memory is controlled using a reader writer semaphore.
[0067] As shown in FIG. 4 , the input queue of an ith stage module is the output queue of the (I−1)th stage module. The input queue of the first module is the output queue of the last module of the pipeline on that machine. Allocation is always performed done from the input queue of the first module or process. However, to ensure that no allocation task can unfairly consume buffers, allocation of buffers to each module is limited to a threshold value of Max_Buffers/NA, where NA is the number of allocators in the pipeline on this particular machine. These parameters are stored under control of the Master_Monitor program, which determines whether any process has exceeded its allocation. This means there could be K unfreed buffers in the system allocated by a single instance of a module H, where K is Max_Buffers/NA. Further allocation by module H will be possible when a buffer allocated by H gets freed.
[0068] All FreeBuf( ) calls free their buffers into the input queue of first module. By the same rule, first stage modules are never permitted to do a ReceiveBuf( ) but are permitted to do AllocBuf( ) On the other hand, tail processes are permitted to perform only FreeBuf( ) and never permitted to do a SendBuf( ) All other modules can Receive, Allocate, Send, and Free buffers. First stage modules always perform SendBuf( ) after they execute each AllocBuf( )
[0069] Each queue 95 is associated with a semaphore to guarantee orderly access to shared memory and which gets triggered upon actions such as AllocBuf( ) ReceiveBuf( ) SendBuf( ) and FreeBuf( ) Dedicated network agents thus map themselves across any network interface on the system, as long as data propagation is ensured. The number of network agents per pipeline is a configurable parameter, which helps this mechanism exploit maximum data transfer bandwidth available on the network over which it is operating. A single dedicated parent network thread/process monitors performance and status of all network agents on that particular machine for a particular pipeline.
[0070] Referring again to FIG. 4 , upon allocation of a buffer by AllocBuf( ) or receipt of a buffer by ReceiveBuf( ) the buffer is taken off from the input queue and assigned to the module which performed the call. Upon completion of processing on this buffer, it is passed forward by mean of SendBuf( ) or FreeBuf( ) and the buffer is forwarded to its destination queue or it is freed for reuse by FreeBuf( ) AllocBuf( ) decrements the input queue semaphore of the first module and also decrements the semaphore which is the allocator Index for this particular module. Each FreeBuf( ) increments the allocator Index of the module who allocated this particular buffer. Information relevant to this operation is always available along with the buffer with which we are performing the free operation.
Attachments
[0071] As the identification process is completed, all modules attach themselves to a specific shared memory space segment that is shared among modules on that machine for this particular pipeline. This shared memory segment has many data buffers, input queues for all stages on the pipeline, and their initial values. Each module identifies its own input queues and output queues depending on the stage that module is supposed to run at, and initial queue (first stage) is populated with number of data segments for sharing on this particular pipeline. Also all modules attach themselves to an allocator semaphore array, which controls the number of buffers allocated by a specific module that can be active in the pipeline.
Data Integrity
[0072] Integrity of the data passed along and the sequencing of data are maintained in part by a pair of special purpose modules termed sequencer and resequencer processes. FIGS. 5A and 5B provide diagrams of the operation of the sequencer and resequencer processes respectively. Referring to FIG. 5A , the sequencer process receives each buffer (module 10), reads the current sequence number stored in memory (module 20), and then stamps the buffer, and then stamps the buffer with the current sequence number (module 30) and sends the stamped buffer to the next stage for processing (module 40). The current sequence number is then incremented (module 50) and the process is repeated for each buffer received by the sequencer. The resequencer is operative to receive all input buffers and store them internally and wait for the required predecessor buffers to show up at the input queue before forwarding them all in the next sequence to the next stage of processing.
[0073] Referring now to FIG. 5B , the resequencer receives a buffer (module 10) of data and determines the sequence number associated with that buffer (module 20). The buffer is then stored in internal memory (module 30) and a determination is made as to whether all preceding sequence numbers associated with buffers have been received and stored (module 40). Until then, the re-sequencer waits for the required predecessor buffers to show up at the input queue. When all predecessor buffers are available, these buffers are sent (module 50) to the next processor stage. The sequencer/re-sequencer process pairs thus ensure proper data sequencing across a set of network reader/writer modules having multiple instantiations of a particular process. Note however, that when there is only one instance of a module present at any particular stage, by virtue of the queuing mechanism available with all input queues, data sequence in the right order is insured.
[0074] Hence, in the preferred embodiment, all data pipe transfers employing multi-instance stages via the sequencer/resequencer processes ensure that the input sequence of sequence numbers are not violated for each instance of the module. Further, the restriction that all modules of a specific multi-instance stage should be of the same type eliminates the chances for preferential behavior.
Fairness
[0075] The concept of fairness means that each task will be assured of getting the input buffers it needs to operate on without waiting longer than necessary. Fairness among the modules in a given DataPipe where no stage of the pipeline has more than one instance is automatic. As the tail task frees a buffer it enters the free buffer pool where it may enable the head task to allocate it and begin processing. All tasks in the DataPipe operate a maximum speed overlapping the processing done by other tasks in the preceding or following stage of the pipeline.
[0076] If a DataPipe has stages consisting of parallel instances of a task, fairness among those tasks is assured by using an allocator semaphore which counts from Max_Buffers/NA (where NA is the number of allocators for this DataPipe on this particular machine) downward to zero. All FreeBuf( ) increment this semaphore back, however, there could be only Max_Buffers/NA buffers allocated by any allocator module in this DataPipe. This ensures that all allocators get a fair share of the available total number of input buffers. If a particular process attempts to allocate more buffers than it is allowed, the master_monitor process prevents such allocation, causing the process to either terminate or wait until a buffer currently allocated to the process becomes freed thereby incrementing the semaphore back up to allow the process to allocate another buffer.
Control Messages
[0077] All instances of all modules have a control socket to Master_Monitor over which control messages are exchanged. All network readers/writers have an analogous control socket to their parent network agent. The parent network agent itself has a control socket to Master_Monitor. Each module periodically checks its control socket for any messages from Master_Monitor. Critical information such as a STOP_PIPE message is passed to Master_Monitor via this mechanism.
Status Monitoring
[0078] Each module initiated by Master_Monitor on a given machine is monitored by either a parent network process (in the case of network reader or writer), or by Master_Monitor itself, for states of execution. In case any module is reported as having terminated abnormally, Master_Monitor identifies this exception, and signals all the modules on that particular pipeline to stop. This is done by means of control messages through control sockets as described previously. Upon safely stopping all modules pertaining to this particular pipeline, it signals the remote machine's Master_Monitor to stop the remote side of this particular pipeline and entire pipeline is shut down safely by means of control message signaling.
Implementation
[0079] In a preferred embodiment, DataPipe is implemented on Sun Solaris or HP-UX operating systems and incorporated into Release 2.7 of CommVault System's Vault98 storage management product.
[0080] FIG. 6 is an illustrative example of the sequence of primitive commands used to set up a DataPipe. The DataPipe is then used to process data in three modules named A, B and C.
[0081] To set up the DataPipe the Master_Monitor for this is called giving it the name of the DataPipe and the names of the modules that will use the pipe (module 10).
[0082] Master_Monitor (Initiate_Pipe(Sample_pipe,A,B,C)).
[0083] Within the logic of module A, Alloc_Buf( ) function is then called to obtain a buffer (20). The logic of module A may perform any actions it wants to fill the buffer with useful data. When it has completed its processing of the buffer (30), it calls SendBuf( ) to send the buffer to module B for processing (40). Module A then repeats its function by again calling Alloc_Buf( ) to obtain the next buffer.
[0084] The logic of module B calls ReceiveBuf( ) to obtain a buffer of data from module A (50). It then operates on the buffer by performing processing as required (60). When it is finished with the buffer it calls SendBuf( ) to send that buffer to module C (70).
[0085] Module B then repeats if function by again calling ReceiveBuf( ) to obtain the next buffer from module A.
[0086] Module C obtains a buffer of data from module B by calling ReceiveBuf( ) When it has completed its processing of the data in that buffer (90), it calls FreeBuf( ) to release the buffer (100). Like the other two modules, it loops back to receive the next buffer form module B.
[0087] The primitives used to allocate, free, send, and receive buffers are synchronized by the use of semaphores. This ensures coordination between the modules so that the receiving module does not start processing data before the sending module has finished with it. If no buffer is available, the AllocBuf or ReceiveBuf primitives will wait until one is available. All three modules operate in parallel as separate tasks. The order of processing from A to B to C is established in the initial call to Master_Monitor that established the DataPipe.
[0088] Referring now to FIG. 7 , there is shown another embodiment of the DataPipe apparatus as it is used within Vault98 to provide a high speed path between a “client” system containing a large database that is being backed up to the “CommServ” server and stored as archive files on a DLT drive. Everything on the collect side, of the physical network are part of the client software configuration, whereas everything on the DLT drive side of the physical network are part of the server software configuration. The “collect” activities on the client prepare data to be sent over the DataPipe to the CommServ.
[0089] FIG. 7 , which is similar to FIG. 2B , depicts a two computer configuration where a header task 15, identified as a collect process, is initiated via Master_Monitor daemon 90A on the first computer. Collector 15 retrieves data from the disk and allocates the buffer from the shared memory 85A for processing the data to be transferred. Collector 15 then sends the data to the compression process 20 which functions to compress the data as it moves over the pipe. As shown in FIG. 7 , multiple instantiations of compression module 20 are provided at this stage for effectively processing the data as it flows across the system. Accordingly, sequencer 17 initiated by Master_Monitor 90A is coupled directly between collect module 15 and compressor module 20 to stamp each of the buffers with the sequence number as described previously. Re-sequencer module 23 is coupled to the output queue of the compression module 20 instantiations to properly reorder and re-sequence the buffers sent from the instantiations of module 20 to content analysis module 30. Content analysis module 30 then receives the buffers from re-sequencer 23, processes the data, and sends the buffers to sequencer 33, which again stamps the buffers and sends them to multiple instantiations of network agents 50A for processing across the physical network via standard network protocol such as TCP IP, FTP, ICMP etc. Network agents 50B are instantiated by network control processor 60B in communication with remote Master_Monitor 90B to provide multiple network agent instantiations, where each agent on the remote side uniquely corresponds and communicates with corresponding agent on the local side. In the preferred embodiment, each network agent 50A on the local side performs a copy of the data in the buffer for transfer over the physical network to its corresponding network agent 50B on the remote side and then performs a free buffer function call to free the buffers associated with shared memory 85A for reallocation. On the remote side, the network agent 50B receives the data transferred over the network and acts as a header on the remote side to allocate each of the buffers in shared memory 85B. These buffers are then sent to re-sequencer 53 which stores buffers received in internal memory until each of the predecessor buffers are received, and then forwards them to the backup restore process 70 via the send buff function. The backup restore process then functions to write the contents of each of the buffers received to DLT drive 80, and upon completion, frees each of those buffers to permit further reallocation in the buffer pool and shared memory 85B. As one can see, this pipeline could be set up over any high speed network, such as ATM, FDDI, etc. The pipeline is capable of utilizing entire practical bandwidth available on the physical network by means of multiple network agents. In cases where real high speed networks are available (networks which have transfer rates higher than DLT drives), multiple pipelines are set up, to utilize resources available to the full extent.
Encryption
[0090] As discussed above, the system also supports encrypted pipelined data transfer by allowing for encryption to be one of the processes or tasks performed in the datapipe.
[0091] Data protection in storage management systems is a tradeoff between user's convenience and security, speed of operation and capabilities of the encryption algorithm, length of the encryption keys, government restrictions, and other elements known in the art. There are many encryption algorithms available that vary by strength, speed and other parameters. Most encryption algorithms, however, offer various ways to manage the encryption keys. For example, some implementations include hardware USB devices that can store user's private keys. Whenever that user needs an access to some encrypted material, the hardware unit is inserted into the USB slot, and the key is retrieved from the unit. Some units have built-in encrypting capabilities, providing additional security: the key no longer has to travel over the USB bus. All crypto operations are conducted within the unit itself.
[0092] More conventional implementations involve storing secret keys in so-called key rings (technically just binary files with some specific format) protected with a user's pass-phrase. The user's pass-phrase is stored nowhere but in the user's head, so the secret keys can be considered to be almost secure. “Almost” because the security of the keys now depend on a human-selected word or phrase, and human languages are known to be quite redundant (1.3 bits for a letter in average English text), plus some sort of dictionary attack is possible. Thus, users and system administrators must chose a system of key management that best suits their particular needs.
[0093] Users and system administrators also confront the problem of key distribution. If there is more than one computer involved, there will be need for transferring keys from one machine to the other. One can say that a “secure” link is needed. But the security of such “secure” link has to be guaranteed by some other key, which should have been distributed first, but for distribution of which another secure session would be needed, etc. etc.
[0094] When transferring encrypted data, users generally must confront key management issues and often will want to have precise control over where sensitive information is stored and how this information is stored. In some embodiments, users only want some minimum scrambling, or want only the security of the pipeline connection for secure over-the-network data transfer, and prefer not to enter pass-phrases or use other methods every time they wish to encrypt or decrypt data. Such users will probably be satisfied storing the keys in some scrambled form on the CommServe, media agents, storage media, or other elements of the system. Thus, in some embodiments, for example, in the CommVault Galaxy system, the key management problem divides in two: key management on the CommServe or storage manager and key management on the backup media.
[0095] To be able to restore encrypted data back, the data encryption keys must generally be stored somewhere. While it is possible to store keys on the media itself where encrypted data is being stored, keys are generally stored in the storage manager or CommServe database/index cache. The CommServe can be configured to trust sensitive data to it unconditionally, or users may agree to store such data on the CommServe, provided that some additional protection is involved. For example, additional protection could be a pass-phrase that only customer knows.
[0096] Thus, as far as key storage on the CommServe is concerned, we generally have two cases: strong (where keys are encrypted with a pass-phrase) and weak (where keys are simply scrambled in the index cache)
[0097] With strong encryption key management (also referred to herein as “CS_KM_STRONG”), the data encryption keys are stored on the CommServe protected by some sort of a pass-phrase. For example, the pass-phrase may exist only in the customers head. Such an encryption scheme offers many benefits. For example, even though the data encryption keys are kept on the CommServe and can be accessed by the storage management software, such as CommVault's Galaxy software, when needed, the storage manager still lacks one important piece of information without which the encryption keys cannot be reconstructed—the user's pass-phrase. Without this pass-phrase the keys are unusable, and the data is unrecoverable.
[0098] In some embodiments, the system prompts the user to enter the pass-phrase every time when a restore is attempted. In other embodiments, the system does not prompt users to enter pass-phrases during the backup (so that Galaxy could get the data encryption key to perform the backup encryption).
[0099] Asymmetric public-key cryptography is used to facilitate this latter method. Asymmetric algorithms use two keys instead of one. The first key (called public) is not protected, and is used to encrypt the data. The second key (called private) is guarded by all means, and can be used to decrypt the data. Thus, in some embodiments, the system encrypts backup data with the public key (which can be stored unprotected in the CS database), and decrypt backup data with the private key (which will be protected by user's pass-phrase). In some embodiments as further described herein, poor performance of asymmetric crypto algorithms may avoided by using symmetric cipher to perform data encryption, and storing the symmetric data encryption key encrypted with the asymmetric public key.
[0100] With weak encryption key management (also referred to herein as “CS_KM_WEAK”), keys are merely scrambled in the storage manager index cache and do not generally require a pass-phrase. For example, in some embodiments, users may consider their CommServes to be secure or at minimal risk and thus not require a strong encryption key management scheme as discussed above. Also, users may dislike the additional inconvenience of having a pass-phrase to remember and enter during restores.
[0101] Thus, the data encryption key is stored in a scrambled form in the database. Something is generally referred to as “scrambled” if it's made unintelligible by some sort of built-in algorithm, which is not controlled by any key or pass-phrase that would exist separately from this algorithm. Clearly, scrambling is potentially less secure than strong encryption key management, because by isolating the scrambling/descrambling code in the Galaxy binaries, any scrambled information can be restored to its original form. The advantage of scrambling (weak) over pass-phrase (strong) encryption is that both backups and restores will not require user to provide any extra information (such as the pass-phrase).
[0102] In some embodiments, for example, in an application service provider (“ASP”) setting or other similar setting, trust level varies between components of the system. For example, an ASP might maintain Media Agents and CommServes in an ASP-controlled data center, but the system's Data Agents might belong to the ASP's customers. Thus, the Data Agents may or may not be configured to fully trust the ASP to handle their data. In this situation the data being backed up belongs to the customers, and the customers completely trust Data Agents (because they're in customer's physical control), but Media Agents and CommServe databases are handled by ASP, so customers don't really trust either of them.
[0103] One possible solution is to protect everything with a pass-phrase, which the ASP's customers can set without the ASP's knowledge. There is no real problem here except for the customer now having to specify pass-phrase each time when they perform restore operation. In some embodiments, however, this minor inconvenience can be worked around by means of pass-phrase export files. These files are kept on the Data Agent in a dedicated directory (e.g. /opt/galaxy/PF or some other similar directory) and contain Data Agent's pass-phrase in some scrambled form. Thus, each time a restore starts, the restore process looks for the pass-phrase export files on the destination machine, and if such file is found, use the enclosed pass-phrase to unlock the encryption keys. Thus, the customer can restore his data to his machines w/o having to provide a pass-phrase, but for anyone else (including the ASP), data restoration is impossible without the pass-phrase.
[0104] In some embodiments, unattended Synthetic Full backups present a different problem. Synthetic Full backups combine a full backup with several incrementals to produce a new full backup. This combining involves running backup and restore pipelines. Since restoring encrypted data generally requires a pass-phrase, unattended SynthFull backups are often impossible when CommServe security is CS_KM_STRONG.
[0105] One possible work around this problem is to have a copy of asymmetric public key stored scrambled (rather than encrypted with the user pass-phrase) specially for running SynthFull backup processes. The hack is gross, because in theory, the system could be directed to use the same key to run restores as well. Cryptographic protection thus gets reduced to protection by code.
[0106] Generally, encryption keys are not stored on backup media with the information that they protect since doing so is somewhat akin to locking a house and then putting the keys under the doormat. Yet, if the system doesn't store any information on the backup media, the recovery of data in case of disasters (such as a CommServe failure) will generally be extremely difficult if not impossible. Again, there is a tradeoff here between the overall security of the storage management system and the user's convenience. Thus, in some embodiment, key management on the backup media does occur.
[0107] For the key management on the media, there are a number of distinct security levels. The first is merely scrambling keys on the backup media. Due to its potential weaknesses as further described below, this method of media key management is referred to herein as MM_KM_WEAK throughout the rest of the document. One weakness to this method is that anyone able to figure out the scrambling algorithm (or anyone able to invoke unscrambling code) will be able to fully recover the backup media without any additional knowledge required. All the strengths of encryption algorithms employed by the system are thus likely nullified by this loophole. Yet, this scheme has some advantages, and some uses: (1) The user never has to remember or enter a pass-phrase. All backups/restores remain fully automatic, and the encryption is 100% transparent to the operator. (2) The data traveling over the pipeline is still encrypted and protected against interception by an eavesdropper. Thus, in some situations, MM_KM_WEAK may be desirable.
[0108] Another scheme is strong media key management (“MM_KM_STRONG”). In this embodiment, data encryption keys are stored on the media, but we additionally encrypt them with the user's pass-phrase. The pass-phrase becomes the crucial information that will exist only in the customer head, without which the data cannot generally be reconstructed by third party or even by an encrypted data recovery tool such as CommVault's Galaxy DrTool.
[0109] The final method of media key management is referred to herein as paranoid (“MM_KM_PARANOID”). In this case there are NO keys stored on the media at all. Data recovery without the CommServe database will generally be impossible and data recover tools such as DrTool will not work since the encrypted data on the media will not contain any additional information these tools require to decrypt and recover the data.
[0110] The tables below summarize various advantages and disadvantages of key management schemes on the storage manager and on backup media according to embodiments of the invention:
[0111]
| CommServe key management. | ||
| Method | Advantages | Disadvantages |
| CS_KM_WEAK | No user interaction required to perform | The CommServe database becomes the |
| backups or restores. | most vulnerable place. Anyone who | |
| No pass-phrase to remember. | has access to it can recover the | |
| The data is still securely protected in | encryption key and restore any | |
| transit and on tape (as long as the | data. | |
| media security is not MM_KM_WEAK) | ||
| CS_KM_STRONG | W/o user's pass-phrase it's impossible | User has to provide a pass-phrase |
| to recover the encryption keys and data even | during restores | |
| in the case if CommServe database becomes | The pass-phrase becomes the weakest link | |
| compromised. | of the entire data protection scheme. | |
[0112]
| Media key management | ||
| Method | Advantages | Disadvantages |
| MM_KM_WEAK | No pass-phrase to remember in order | The data on tape becomes basically “scrambled”. |
| to run DrTool. | Anyone having the knowledge of the principles | |
| The data is still securely protected | of the “scrambling” algorithm or knowing | |
| in transit in pipeline. | how to invoke it in Galaxy DLL can recover the data. | |
| MM_KM_STRONG | Even though the data encryption key is | While the data encryption keys are protected with the |
| stored on the media, it is protected by | pass-phrase, the whole data protection scheme now | |
| user's pass-phrase, w/o which the | becomes as week as this pass-phrase. This should | |
| data is unrecoverable. | be made very clear to the user. | |
| DrTool can recover data. | DrTool will ask user for pass-phrase. | |
| MM_KM_PARANOID | There are no keys stored on the media. | Data recovery is impossible w/o Galaxy CommServe |
| Having just the media it's completely | database. | |
| impossible to recover any data from it. | DrTool won't work. | |
[0113] Besides the encryption key management/storage problem discussed above, there is also a key exchange problem: even if the keys are stored on the CommServe in a secure way, they generally must be somehow transferred to the IDA and MA—the places where the real data encryption or decryption generally takes place.
[0114] If the keys are distributed in a clear text form, they can easily be intercepted by an eavesdropper, and used later to restore backup data. This method is the least secure and should generally be avoided if possible.
[0115] If keys are distributed in “scrambled” form, the eavesdropper's task becomes more difficult, but still possible via the usual scrambling drawback. Once an entry point to the system's unscrambling routing is found and negotiated, for example to the Galaxy CvLib DLL, any scrambled message can be recovered.
[0116] If keys are distributed encrypted with some user's chosen password, the user would have to enter that password twice for each client/MA: once on the client itself, second time on the CommServe, so that the password would be stored somewhere in registry for further usage, and would never appear on the network. While providing an illusion of security, this third method is, however, potentially inconvenient for the user (too many passwords to enter), and the security gain is not that great: the passwords will have to be stored in file or registry anyway, and they can appear there only in the “scrambled” form (unless we ask user to enter yet another password, etc. etc.). Thus in some embodiments, a variant of this scheme uses an automatically chosen password that requires no user interaction and still yields a good security. For example, the system uses a session network password to encrypt encryption keys when they're sent between the machines. Each client computer has a unique session network password, and CommServe knows all these passwords, so they become a very good candidate for data key encryption before sending them over the network. Since IDAs and MAs don't know each other's network password, they cannot easily exchange keys, so, in some embodiments, it becomes the responsibility of the CommServe to generate random data encryption key and to pass it to IDA and/or MA—depending on where the encryption should take place.
[0117] This section describes various aspects of data encryption implementation according to embodiments of the invention, and relies upon the following variables:
[0118]
| Di | i-th block of plaintext data |
| Ei | i-th block of encrypted data |
| KBF | Blowfish encryption key |
| KBFenc | Blowfish key encrypted with RSA public key. |
| KBFenc,db | Blowfish key encrypted with RSA public key and |
| converted to ASCII for storing in the CS database. | |
| KBFnetenc | Blowfish key encrypted with network password for |
| transmission over the network to IDA or MA. | |
| IVBF | Initialization vector used in Blowfish CBC mode - |
| unique 64-bit number distributed along with the KBF. | |
| KRSApub | RSA public key |
| KRSApubdb | RSA public key as it's stored in the CS database |
| KRSApri | RSA private key |
| KRSAprienc | RSA private key encrypted with pass-phrase |
| KRSAprienc,db | RSA private key encrypted with pass-phrase and |
| converted to ASCII for storing in the CS database | |
| PassPhrase | User-specified pass-phrase, or a built-in pass-phrase |
| for CS_KM_WEAK or MM_KM_WEAK key | |
| management modes. | |
| NetPass | Network password of a particular Galaxy machine |
| BF(Di, KBF) | Blowfish algorithm applied to block Di using key KBF |
| RSA(Di, KRSApub) | RSA algorithm applied to Di using KRSApub key. |
| RSA−1(Ei, KRSApri) | RSA algorithm applied to Ei using KRSAPri key. |
| Scramble(Di) | Data block Di converted to ASCII and scrambled (i.e. |
| encrypted with some built-in key, probably | |
| randomized and protected by CRC32) | |
| MD5(T) | MD5 hash function producing a 128-bit hash value of |
| arbitrary length text T. It's used to reduce pass-phrase | |
| down to a 128-bit number, which can then be used as a | |
| key in Blowfish encryption. | |
[0119] Thus, exemplary encryption schemes and methods according to embodiments of the invention can be represented as follows:
[0120] In some embodiments, the KRSApri key encrypted with a user-selectable pass-phrase according to this equation:
KRSAprienc=BF(KKRSApri,MD5(PassPhrase))
KRSAprienc=BF(KKRSApri,MD5(PassPhrase))
[0121] Before storing into the database it is scrambled and converted to ASCII:
KRSAprienc,db=Scramble(KRSAprienc)
KRSAprienc,db=Scramble(KRSAprienc)
[0122] In some embodiments, during restores the KRSAprienc, db key is decrypted back to KRSApri according to this formula:
KRSApri=BF(Scramble−1(KRSAprienc,db),MD5(PassPhrase))
KRSApri=BF(Scramble−1(KRSAprienc,db),MD5(PassPhrase))
[0123] In some embodiments, the KRSApub key is stored in the database in this scrambled ASCII format:
KRSApubdb=Scramble(KRSApub)
KRSApubdb=Scramble(KRSApub)
[0124] And the reverse transformation is represented as follows:
KRSApub=Scramble−1(KRSApubdb)
KRSApub=Scramble−1(KRSApubdb)
[0125] In some embodiments, the backup data text is encoded as follows:
EiBF(Di,KBF) ECB (Electronic Codeblock Mode)
or
E0=BF(D0
IVBF,KBF) CBC (Cipher Block Chaining Mode)
Ei=BF(DiEi-1,KBF)
EiBF(Di,KBF) ECB (Electronic Codeblock Mode)
or
E0=BF(D0
IVBF,KBF) CBC (Cipher Block Chaining Mode)
Ei=BF(Di
Ei-1,KBF)
[0126] In some embodiments, during restores, the encoded data will be decrypted as follows:
Di=BF(Ei,KBF) ECB Mode
or
D0=BF(E0,KBF)IVBF CBCMode
Di=BF(Ei,KBF)Ei-1
Di=BF(Ei,KBF) ECB Mode
or
D0=BF(E0,KBF)
IVBF CBCMode
Di=BF(Ei,KBF)
Ei-1
[0127] Before being stored into the database, the backup data key KBF (chosen randomly for every backup) is encrypted according to this formula in some embodiments:
KBFenc=RSA(KBR,KRSApub)
KBFenc=RSA(KBR,KRSApub)
[0128] In the database it is stored in the scrambled ASCII format in some embodiments:
KBFenc,db=Scramble(KBFenc)
KBFenc,db=Scramble(KBFenc)
[0129] In some embodiments, during restores the KBF key will be recovered from the database according to this formula:
KBF=RSA−1(Scramble−1(KBFenc,db),KRSApri)
KBF=RSA−1(Scramble−1(KBFenc,db),KRSApri)
[0130] And KRSApri is decrypted from KRSAprienc, db as described above.
[0131] In some embodiments, before being transmitted from CS to IDA or MA, the KBF key is encrypted with the client's network password according to this formula:
KBFnetenc=BF(KBF,NetPass)
KBFnetenc=BF(KBF,NetPass)
[0132] In some embodiments, the client obtains KBF from KBFnetenc using this formula:
KBF=BF(KBFnetenc,NetPass)
KBF=BF(KBFnetenc,NetPass)
[0133] There are three categories of encryption-related settings that are stored in the storage manager database/index cache:
-
- [0134] 1. The Blowfish data stream encryption key KBFenc, db—per archive file.
- [0135] 2. The RSA public keys (KRSApubdb, KRSAprienc, db) and key management options—per client
- [0136] 3. Encryption flag (ENC_NONE, ENC_NETWORK_ONLY, ENC_MEDIA_ONLY, ENC_MEDIA_AND_NETWORK)—per subclient
[0137] The KBF keys are generated randomly for every archive file. The KRSApub and KRSApri are created once per client. All subclients will share the same RSA keys, the same pass-phrase and the same key management settings. To be able to turn encryption ON/OFF individually for every subclient, the “encryption ON” flag should be stored per subclient.
[0138] Encryption settings and their related GUIs are generally split into two groups: those that are specified for the entire client computer, and those that can be customized on a per-subclient basis.
[0139] The settings specified for the entire client computer (all subclients) are summarized in the screenshot in FIG. 8 . The screenshot contains the suggested names and layout of the controls that are presented to the user. As used herein, key management terminology in FIG. 8 corresponds as follows:
-
- [0140] 1. “Regular Restore Access” corresponds to CS_KM_WEAK
- [0141] 2. “Restore Access with a pass-phrase” corresponds to CS_KM_STRONG,
- [0142] 3. “Direct Media Access via Media Password” corresponds to MM_KM_WEAK,
- [0143] 4. “Direct Media Access via pass-phrase” corresponds to MM_KM_STRONG, and
- [0144] 5. “No Direct Media Access” corresponds to MM_KM_PARANOID.
[0145] When “Pass-phrase: <Export>” button is pressed in FIG. 8 , a dialog box is displayed which allows the user to enter the pass phrase. The dialog box contains the list of all client computers configured on the CommServe. The default value is the name of the client for which the encryption settings are being edited. When “Pass-phrase: <Reset>” button is pressed in FIG. 8 , a dialog box is displayed which allows the user to reset the pass phrase.
[0146] There is minimal space in the self describing multi-tag headers to specify additional information regarding the encryption functionality disclosed herein. In some embodiments, the system also uses a new header variable or field, but this results in a loss of compatibility with earlier clients.
[0147] Unlike compression, when encrypting data an expansion of the data size is possible and in some cases expected. For example, since the Blowfish algorithm is a block cipher, it will pad data to the block boundary (64 bits). Thus, it can add up to 7 bytes to data associated with every tag header. This padding is not an issue though because when backup data is put into the pipeline buffer, it's aligned on the boundary of 8. And since 64 bits constitute exactly 8 bytes, Blowfish will merely consume the unused alignment bytes, and no data expansion will occur. Unfortunately, lack of data expansion described above is true only for the simplest mode of Blowfish operation. If one implements a more secure CBC mode, or even just adds a 32-bit CRC32 checksum to guarantee data consistency, we will observe expansion of up to 4+8 bytes per tag header (CRC32+IV).
[0148] Current data pipeline code already implements a failsafe margin (at least 2 KB in some embodiments) used by the compression module during data compression (and released afterwards), so the same can be done for encryption as well. In fact, the encryption module uses the same margin, which is already there for compression. If user backs up a great deal of tiny files, there will be 12*N bytes expansion, where N is the number of tag headers that fit one pipeline buffer (32K). The 2 KB failsafe buffer will be exhausted if average file size is 96 bytes (32K/(size+96)*12=2K). Thus, the appropriate fall-back mechanism will have to be implemented in the encryption module, which would automatically allocate a new pipeline buffer, should this become necessary.
[0149] Each tag header will have a flag indicating whether the data has been encrypted or not. Since there is a 32-bit “compressed_data” flag already present in that structure, and that flag can take only values of 0 and 1, we can use the second byte of the integer to specify encryption algorithm to use. Other values of that byte can be reserved for encryption algorithms that may be implemented.
[0150] It may also be necessary to track the size of the data after it has been encrypted. For compression this is done by utilizing a second field of the tag header. For encryption another field out of the tag header is allocated for this purpose, or the compressed size replaced with the encrypted size and save the compressed size in an encryption header that would follow every tag header.
[0151] The system also uses chunk trailers from the data pipeline to store encryption information. Every chunk is followed by a chunk trailer that contains information about archive files encoded in the chunk. This information is used by data recovery tools, such as DrTool, to recover data in the absence of the CommServe database. For example, in some embodiments, the Chunk Trailer is the natural place where encryption keys can be stored to allow DrTool successfully decrypt the data without contacting the CS for the KBF.
[0152] In some embodiments, the Chunk Trailer is an ASCII entity comprised of two columns (one for variable names, the other one for the values). Depending on the media key management security level, the following information may be stored in the Chunk Trailer:
[0153]
| Parameter | Description |
|---|---|
| Cipher | An integer identifying the cipher that was used |
| to encrypt backup data: | |
| 0 - Data is not encrypted | |
| 1 - Data is encrypted with Blowfish | |
| BFKey | Blowfish key encrypted with RSA public key |
| RSAPriKey | RSA private key encrypted with the user or |
| built-in pass-phrase | |
| RSAUserPassPhrase | A flag (taking the values of 0 or 1) specifying |
| whether the RSAPriKey is encrypted with user | |
| pass-phrase (1) or a built-in pass-phrase (0). | |
[0154] In the course of a backup, the following encryption-related events generally occur. Note that encryption can take place on a data agent or a media agent. Moreover, if network encryption is ON, but media encryption is OFF (ENC_NETWORK_ONLY), decryption may be happening as well:
-
- [0155] 1. The system initiates a request to initialize encryption modules in the data pipeline. For example, CvArchive on IDA sends CVA_GET_PIPELINEINFO_REQ to the ArchiveManager and gets back encryption settings for the specified appld (subclient). These encryption settings are used to initialize INIT_PL buffer dispatched down the pipeline.
- [0156] 2. An encryption module, for example, CvDataPipe, analyses the encryption settings in the INIT_PL buffer and brings up encrypt/decrypt modules on the IDA or MA as needed
- [0157] 3. The system generates a new encryption key associated with a new archive file that is to be created. For example, CvArchive sends CVA_ALLOC_AFILEID_REQ to ArchiveManager as part of creating a new archive file. ArchiveManager generates a new random Blowfish key KBF and stores it in its memory.
- [0158] 4. The encryption key is propagated to the appropriate encryption modules. For example, CvArchive sends PL_FS_CREATE_AFILE down the pipeline. “encrypt” and “decrypt” modules intercept this buffer and request archive file encryption key KBF from ArchiveManager via CVA_GET_AFILE_BACKUP_KEY. ArchiveManager returns the temporary key that was generated in the previous step.
- [0159] 5. Backup data is being sent through the pipeline and “encrypt” and “decrypt” modules process it as needed: For example, every PL_DATA buffer (tag_header_t::buf_type==PL_DATA) is encrypted, and encryption flag is set in the tag_header_t or other field as appropriate.
- [0160] 6. The chunk trailer is propagated with information regarding encryption and other actions that were taken on the chunk. For example, when it's time to close the current chunk, DataMover sends CVA_GET_CLOSECHUNKINFO_REQ to ArchiveManager, gets KBFenc, db and KRSAprienc, db for every archive file in the chunk, and stores them in the chunk trailer.
- [0161] 7. The archive file encryption key is stored for future use. For example, when it's time to close an archive file, DataMover sends CVA_FIN_AFILE_COPY_REQ to the ArchiveManager. ArchiveManager encrypts the temporary KBF for this archive file with the client's KRSApub, stores the result into archFile table, and purges temporary KBF from memory.
[0162] The following events generally occur in a restore operation:
-
- [0163] 1. The system, depending on whether strong or weak key encryption is used, checks to determine whether a pass phrase is required. If a pass phrase is required the system determines whether the phrase has been provided. For example, CvArchive checks whether pass-phrase was specified by user when he initiated restore, and whether this pass-phrase was passed to CvArchive via restore parameters.
- [0164] 2. In some embodiments, the system check for pass-phrase export files if no pass-phrase is provided. For example, if user didn't specify any pass-phrase, CvArchive browses pass-phrase export files in a Galaxy directory on IDA (e.g. /opt/galaxy/PF) looking for the file that would correspond to the current appId (pass-phrase will be stored together with the client ID that they correspond to, and client ID can be derived from the appId if needed).
- [0165] 3. The restore archive process sends the archive manager the passphrase. For example, in some embodiments CvArchive sends CVA_GETPIPELINEINFO_FOR_RESTORE_REQ to the ArchiveManager, and includes the pass-phrase, if it was located in the previous two steps.
- [0166] 4. The archive manager attempts to unlock the private key. For example, in some embodiments, the ArchiveManager process tries to unlock RSA private key KRSApri as per the following algorithm:
- [0167] a. If rsaPriKeyBPF for this subclient is not empty in the clientEnc table, ArchiveManager decrypts rsaPriKeyBPF using the built-in pass-phrase.
- [0168] b. If rsaPriKeyUPF for this subclient is not empty in the clientEnc table, ArchiveManager decrypts rsaPriKeyUPF using the pass-phrase supplied by CvArchive.
- [0169] c. If KRSApri was obtained in the previous steps, it's stored in ArchiveManager's memory for the duration of the restore.
- [0170] 5. The encrypt and decrypt modules are initiated. For example, CvArchive causes CvDataPipe to bring up encrypt/decrypt modules (“encrypt” on the MA and “decrypt” on the IDA). Note that like compress/uncompress, these modules will be brought up every time when restore runs. Whether they actually do something or not will be determined during the restore itself.
- [0171] 6. Buffers are allocated to archive files being restored. For example, in some embodiments, for every archive file being restored, fsRestoreHead sends new PL_FS_OPEN_AFILE buffer down the pipeline.
- [0172] 7. The decrypt/encrypt modules retrieve the appropriate key to process the archive file buffers. For example, the decrypt/encrypt modules intercept this buffer and issue CVA_GET AFILE_RESTORE KEY to ArchiveManager in order to retrieve KBF for this archive file.
- [0173] 8. ArchiveManager does the following:
- [0174] a. If there is already a decrypted KBF in memory for this archive file (as a result of a previous CVA_GET_AFILE_RESTORE_KEY request), it's returned immediately.
- [0175] b. If archFile.dataEncKey!=NULL for this archive file (data is encrypted on media), the KBF is obtained by decrypting archFile.dataEncKey with the KRSApri that was unlocked during pipeline setup. If KRSApri wasn't unlocked because user or CvArchive didn't specify a pass-phrase, ArchiveManager should issue an event message saying that a pass-phrase is required, and should abort the restore.
- [0176] c. If archive file is not encrypted on the media, but subclient's network encryption is ON, a random KBF is generated and is stored in memory.
- [0177] 9. Depending on whether KBF returned from ArchiveManager was dynamically generated or not, “encrypt” module either encrypts passing data or sends it unchanged (if the key wasn't generated dynamically, it means that the data is already encrypted on the media, so it can be sent across the network w/o extra encryption).
- [0178] 10. “decrypt” module decrypts every tag data that has encryption flag set in the tag header.
- [0179] 11. The encryption key is removed from memory at the end of the archive file restore. For example, at the end of archive file restore, fsRestoreHead sends via CvArchive CVA_FORGET_AFILE_RESTORE_KEY to the ArchiveManager, which causes it to forget the KBF for the current archive file.
- [0180] 12. At the end of restore, fsRestoreHead sends via CvArchive CVA_FORGET_RSAPRI_KEY to ArchiveManager causing it purge KRSApri from memory.
[0181] The following sequence occurs during disaster recovery operations, for example, when the storage manager is unavailable or at other times:
-
- [0182] 1. While doing the initial media scan, DrTool should read chunk trailers and include encryption-related parameters in the structure, which are then returned to the middle layer:
- [0183] a. Let cipher=Cipher (or FALSE, if Cipher is missing)
- [0184] b. Let bfKeyEnc=BFKey (or NULL, if BFKey is missing)
- [0185] c. Let rsaPriKeyUPF=RSApriKey (or NULLm if BFKey is missing)
- [0186] d. Let rsaPassPhraseNeeded=RSAUserPassPhrase (or FALSE, if missing)
- [0187] 2. Middle layer should store the encryption parameters (cipher, bfKeyEnc, rsaPriKeyUPF and rsaPassPhraseNeeded) in the CTree database along with other archive file-related settings.
- [0188] 3. When doing the real restore, the middle or GUI layer of DrTool should do the following:
- [0189] a. Compile the list of archive files that have to be restored
- [0190] b. For every archive file in the list:
- [0191] i. If cipher==FALSE, skip the following steps
- [0192] ii. If bfKeyEnc==NULL, skip the following steps
- [0193] iii. If rsaPassPhraseNeeded==TRUE, prompt user for a pass-phrase and let passPhrase be what user enters. Otherwise let passPhrase be the built-in pass-phrase.
- [0194] iv. Decrypt rsaPriKeyUPF using the passPhrase from the previous step to obtain rsaPriKey.
- [0195] v. Decrypt bfKeyEnc using rsaPriKey to obtain bfKey
- [0196] c. For every new archive file being open during restore:
- [0197] i. If cipher==FALSE, skip the following steps
- [0198] ii. If bfKey==NULL abort with “Encrypted data is not recoverable” error
- [0199] iii. For every tag_header_t from this archive file,
- [0200] 1. If second byte of tag_header_t::compressed_data is 0, do nothing
- [0201] 2. Otherwise decrypt tag data using bfKey
- [0182] 1. While doing the initial media scan, DrTool should read chunk trailers and include encryption-related parameters in the structure, which are then returned to the middle layer:
[0202] In some embodiments, the system employs an encryption API on top of OpenSSL, for example, CommVault's CvDataCrypt API, that implements appropriate format of tag data encryption, scrambling, etc.
[0203] All keys are generally converted to ASCII form before storing them in the database.
[0204] The scrambler function randomizes the binary data, computes checksum, and encrypts the whole thing using some built-in key.
[0205] Systems and modules described herein may comprise software, firmware, hardware, or any combination(s) of software, firmware, or hardware suitable for the purposes described herein. Software and other modules may reside on servers, workstations, personal computers, computerized tablets, PDAs, and other devices suitable for the purposes described herein. Software and other modules may be accessible via local memory, via a network, via a browser or other application in an ASP context, or via other means suitable for the purposes described herein. Data structures described herein may comprise computer files, variables, programming arrays, programming structures, or any electronic information storage schemes or methods, or any combinations thereof, suitable for the purposes described herein. User interface elements described herein may comprise elements from graphical user interfaces, command line interfaces, and other interfaces suitable for the purposes described herein. Screenshots presented and described herein can be displayed differently as known in the art to input, access, change, manipulate, modify, alter, and work with information.
[0206] While the invention has been described and illustrated in connection with preferred embodiments, many variations and modifications as will be evident to those skilled in this art may be made without departing from the spirit and scope of the invention, and the invention is thus not to be limited to the precise details of methodology or construction set forth above as such variations and modification are intended to be included within the scope of the invention.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
We claim:
1. A computer-implemented method, to be performed by at least one hardware processor, for storing data for a user, the method comprising:
when storing data for the user:
generating an encryption key associated with the data for the user;
encrypting the data for the user using the generated encryption key to create encrypted data;
storing the encrypted data in a data center associated with a third party;
encrypting the encryption key to create an encrypted encryption key, wherein a password or other information set by the user is required to decrypt the encrypted encryption key; and
storing, by the at least one hardware processor, the encrypted encryption key,
wherein the encrypted encryption key is accessible to allow the encrypted data stored in the data center to be restored during a subsequent restore operation;
wherein the password or other information for decrypting the encrypted encryption key is set by the user without knowledge of the third party, and
wherein the third party is unable to decrypt the encrypted data stored in the data center without first receiving the password or other information from the user.
2. The method of claim 1, wherein the method is performed in a pipeline storage system comprising multiple processes arranged in stages including an encryption process, and wherein encrypting the data is performed by the encryption process.
3. The method of claim 1, further comprising restoring the encrypted data stored in the data center using the password or other information for decrypting the encrypted encryption key, wherein the password or other information for decrypting the encrypted encryption key is contained in a file kept on a data agent belonging to and controlled by the user, and wherein restoring the encrypted data is performed by a restore process which uses the password or other information contained in the file to decrypt the encrypted encryption key.
4. The method of claim 1, wherein storing the encrypted encryption key comprises storing the encrypted encryption key on a storage medium in the data center where the encrypted data is stored.
5. The method of claim 1, wherein the method is performed in a pipeline storage system, wherein the method comprises storing on a first storage device an index of storage media used by the pipeline storage system, and wherein storing the encrypted encryption key comprises storing the encrypted encryption key on the first storage device.
6. The method of claim 1, wherein the method is performed in a pipeline storage system, wherein the pipeline storage system includes a storage management component, and wherein storing the encrypted encryption key comprises storing the encryption key on the storage management component.
7. The method of claim 1, further comprising
inserting a tag in the encrypted data indicating that the encrypted data is encrypted, and
inserting the encrypted encryption key in the tag in the encrypted data.
8. The method of claim 1, further comprising inserting a tag in the encrypted data indicating that the encrypted data is encrypted.
9. A storage management system for storing data for a user, the system comprising:
means for generating an encryption key associated with data for the user;
means for encrypting the data belonging to the user using the generated encryption key to create encrypted data;
means for storing the encrypted data in a data center associated with a third party;
means for encrypting the encryption key to create an encrypted encryption key such that a password or other information set by the user is required to decrypt the encrypted encryption key; and
means for storing the encrypted encryption key such that the encrypted encryption key is accessible to allow the encrypted data stored in the data center to be restored during a subsequent restore operation;
wherein the system is configured such that the password or other information for decrypting the encrypted encryption key is set by the user without knowledge of the third party, and
wherein the third party is unable to decrypt the encrypted data stored in the data center without receiving the password or other information from the user.
10. The system of claim 9, further comprising means for restoring the encrypted data stored in the data center using the password or other information for decrypting the encrypted encryption key, wherein the password or other information for decrypting the encrypted encryption key is contained in a file kept on a data agent, and wherein the means for restoring the encrypted data includes a restore process which uses the password or other information contained in the file to decrypt the encrypted encryption key.
11. The system of claim 9, wherein the system includes a pipeline storage system, wherein a first storage device stores an index of storage media used by the pipeline storage system, and wherein the encrypted encryption key is stored on the first storage device.
12. The system of claim 9, wherein the system includes a pipeline storage system, wherein the pipeline storage system includes a storage management component, and wherein the encryption key is stored on the storage management component.
13. The system of claim 9, further comprising
means for inserting a tag in the encrypted data indicating that the encrypted data is encrypted, and
means for inserting the encrypted encryption key in the tag in the encrypted data.
14. The system of claim 9, further comprising means for inserting a tag in the encrypted data indicating that the encrypted data is encrypted.
15. A non-transitory computer-readable medium having instructions which, when executed by a processor of a data storage system, cause the data storage system to perform a method for storing data for a user, the method comprising:
generating an encryption key associated with data for the user;
encrypting the data belonging to the user using the generated encryption key to create encrypted data;
storing the encrypted data in a data center associated with a third party;
encrypting the encryption key to create an encrypted encryption key, wherein a password or other information set by the user is required to decrypt the encrypted encryption key; and
storing the encrypted encryption key, wherein the encrypted encryption key is accessible to allow the encrypted data stored in the data center during a subsequent restore operation;
wherein the password or other information for decrypting the encrypted encryption key is set by the user without knowledge by the third party, and
wherein the third party is unable to decrypt the encrypted data stored in the data center without first receiving the password or other information from the user.
16. The non-transitory computer-readable medium of claim 15, wherein the method further comprises restoring the encrypted data stored in the data center using the password or other information for decrypting the encrypted encryption key, wherein the password or other information for decrypting the encrypted encryption key is contained in a file kept on a data agent, and wherein restoring the encrypted data is performed by a restore process which uses the password or other information contained in the file to decrypt the encrypted encryption key.
Patent Citations (176)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4296465(A) | 1981-10-01 | Lemak | Applicant |
| US4686620(A) | 1987-08-01 | Ng | Applicant |
| US4995035(A) | 1991-02-01 | Cole et al. | Applicant |
| US5005122(A) | 1991-04-01 | Griffin et al. | Applicant |
| US5093912(A) | 1992-03-01 | Dong et al. | Applicant |
| US5133065(A) | 1992-07-01 | Cheffetz et al. | Applicant |
| US5193154(A) | 1993-03-01 | Kitajima et al. | Applicant |
| US5212772(A) | 1993-05-01 | Masters | Applicant |
| US5226157(A) | 1993-07-01 | Nakano et al. | Applicant |
| US5239647(A) | 1993-08-01 | Anglin et al. | Applicant |
| US5241668(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5241670(A) | 1993-08-01 | Eastridge et al. | Applicant |
| US5276860(A) | 1994-01-01 | Fortier et al. | Applicant |
| US5276867(A) | 1994-01-01 | Kenley et al. | Applicant |
| US5287500(A) | 1994-02-01 | Stoppani, Jr. | Applicant |
| US5301351(A) | 1994-04-01 | Jippo et al. | Applicant |
| US5311509(A) | 1994-05-01 | Heddes et al. | Applicant |
| US5321816(A) | 1994-06-01 | Rogan et al. | Applicant |
| US5333315(A) | 1994-07-01 | Saether et al. | Applicant |
| US5347653(A) | 1994-09-01 | Flynn et al. | Applicant |
| US5410700(A) | 1995-04-01 | Fecteau et al. | Applicant |
| US5448724(A) | 1995-09-01 | Hayashi | Applicant |
| US5491810(A) | 1996-02-01 | Allen | Applicant |
| US5495607(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5504873(A) | 1996-04-01 | Martin et al. | Applicant |
| US5544345(A) | 1996-08-01 | Carpenter et al. | Applicant |
| US5544347(A) | 1996-08-01 | Yanai et al. | Applicant |
| US5559957(A) | 1996-09-01 | Balk | Applicant |
| US5559991(A) | 1996-09-01 | Kanfi | Applicant |
| US5598546(A) | 1997-01-01 | Blomgren | Applicant |
| US5619644(A) | 1997-04-01 | Crockett et al. | Applicant |
| US5638509(A) | 1997-06-01 | Dunphy et al. | Applicant |
| US5673381(A) | 1997-09-01 | Huai et al. | Applicant |
| US5682513(A) | 1997-10-01 | Candelaria et al. | Applicant |
| US5699361(A) | 1997-12-01 | Ding et al. | Applicant |
| US5729743(A) | 1998-03-01 | Squibb | Applicant |
| US5751997(A) | 1998-05-01 | Kullick et al. | Applicant |
| US5752041(A) | 1998-05-01 | Fosdick | Applicant |
| US5758068(A) | 1998-05-01 | Brandt et al. | Applicant |
| US5758359(A) | 1998-05-01 | Saxon | Applicant |
| US5761677(A) | 1998-06-01 | Senator et al. | Applicant |
| US5761734(A) | 1998-06-01 | Pfeffer et al. | Applicant |
| US5764972(A) | 1998-06-01 | Crouse et al. | Applicant |
| US5778395(A) | 1998-07-01 | Whiting et al. | Applicant |
| US5805920(A) | 1998-09-01 | Sprenkle et al. | Applicant |
| US5812398(A) | 1998-09-01 | Nielsen | Applicant |
| US5813009(A) | 1998-09-01 | Johnson et al. | Applicant |
| US5813017(A) | 1998-09-01 | Morris | Applicant |
| US5860104(A) | 1999-01-01 | Witt et al. | Applicant |
| US5875478(A) | 1999-02-01 | Blumenau | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5901327(A) | 1999-05-01 | Ofek | Applicant |
| US5924102(A) | 1999-07-01 | Perks | Applicant |
| US5950205(A) | 1999-09-01 | Aviani, Jr. | Applicant |
| US5956519(A) | 1999-09-01 | Wise et al. | Applicant |
| US5970233(A) | 1999-10-01 | Liu et al. | Applicant |
| US5970255(A) | 1999-10-01 | Tran et al. | Applicant |
| US5974563(A) | 1999-10-01 | Beeler, Jr. | Applicant |
| US5999629(A) | 1999-12-01 | Heer et al. | Applicant |
| US6003089(A) | 1999-12-01 | Shaffer et al. | Applicant |
| US6009274(A) | 1999-12-01 | Fletcher et al. | Applicant |
| US6012090(A) | 2000-01-01 | Chung et al. | Applicant |
| US6021415(A) | 2000-02-01 | Cannon et al. | Applicant |
| US6026414(A) | 2000-02-01 | Anglin | Applicant |
| US6052735(A) | 2000-04-01 | Ulrich et al. | Applicant |
| US6076148(A) | 2000-06-01 | Kedem | Applicant |
| US6094416(A) | 2000-07-01 | Ying | Applicant |
| US6094684(A) | 2000-07-01 | Pallmann | Applicant |
| US6105129(A) | 2000-08-01 | Meier et al. | Applicant |
| US6131095(A) | 2000-10-01 | Low et al. | Applicant |
| US6131190(A) | 2000-10-01 | Sidwell | Applicant |
| US6148412(A) | 2000-11-01 | Cannon et al. | Applicant |
| US6154787(A) | 2000-11-01 | Urevig et al. | Applicant |
| US6161111(A) | 2000-12-01 | Mutalik et al. | Applicant |
| US6167402(A) | 2000-12-01 | Yeager | Applicant |
| US6169976(B1) | 2001-01-01 | Colosso | Applicant |
| US6212512(B1) | 2001-04-01 | Barney et al. | Applicant |
| US6260069(B1) | 2001-07-01 | Anglin | Applicant |
| US6269431(B1) | 2001-07-01 | Dunham | Applicant |
| US6275953(B1) | 2001-08-01 | Vahalia et al. | Applicant |
| US6292783(B1) | 2001-09-01 | Rohler et al. | Applicant |
| US6301592(B1) | 2001-10-01 | Aoyama et al. | Applicant |
| US6324581(B1) | 2001-11-01 | Xu et al. | Applicant |
| US6328766(B1) | 2001-12-01 | Long | Applicant |
| US6330570(B1) | 2001-12-01 | Crighton | Applicant |
| US6330642(B1) | 2001-12-01 | Carteau | Applicant |
| US6343324(B1) | 2002-01-01 | Hubis et al. | Applicant |
| USRE37601(E) | 2002-03-01 | Eastridge et al. | Applicant |
| US6356801(B1) | 2002-03-01 | Goodman et al. | Applicant |
| US6381331(B1) | 2002-04-01 | Kato | Applicant |
| US6389432(B1) | 2002-05-01 | Pothapragada et al. | Applicant |
| US6418478(B1) | 2002-07-01 | Ignatius et al. | Applicant |
| US6421711(B1) | 2002-07-01 | Blumenau et al. | Applicant |
| US6487561(B1) | 2002-11-01 | Ofek et al. | Applicant |
| US6519679(B2) | 2003-02-01 | Devireddy et al. | Applicant |
| US6538669(B1) | 2003-03-01 | Lagueux, Jr. et al. | Applicant |
| US6542972(B2) | 2003-04-01 | Ignatius et al. | Applicant |
| US6564228(B1) | 2003-05-01 | O'Connor | Applicant |
| US6577734(B1) | 2003-06-01 | Etzel et al. | Examiner |
| US6604149(B1) | 2003-08-01 | Deo et al. | Applicant |
| US6654825(B2) | 2003-11-01 | Clapp et al. | Applicant |
| US6658526(B2) | 2003-12-01 | Nguyen et al. | Applicant |
| US6772332(B1) | 2004-08-01 | Boebert et al. | Applicant |
| US6898286(B2) | 2005-05-01 | Murray | Applicant |
| US6973621(B2) | 2005-12-01 | Sie et al. | Applicant |
| US7035880(B1) | 2006-04-01 | Crescenti et al. | Applicant |
| US7130970(B2) | 2006-10-01 | Devassy et al. | Applicant |
| US7209972(B1) | 2007-04-01 | Ignatius et al. | Applicant |
| US7213269(B2) | 2007-05-01 | Orthlieb et al. | Applicant |
| US7277941(B2) | 2007-10-01 | Ignatius et al. | Applicant |
| US7287045(B2) | 2007-10-01 | Saika et al. | Applicant |
| US7315923(B2) | 2008-01-01 | Retnamma et al. | Applicant |
| US7320068(B2) | 2008-01-01 | Zimniewicz et al. | Applicant |
| US7328189(B2) | 2008-02-01 | Ling | Applicant |
| US7360252(B1) | 2008-04-01 | Torrubia-Saez et al. | Applicant |
| US7389273(B2) | 2008-06-01 | Irwin et al. | Applicant |
| US7395282(B1) | 2008-07-01 | Crescenti et al. | Applicant |
| US7401154(B2) | 2008-07-01 | Ignatius et al. | Applicant |
| US7506102(B2) | 2009-03-01 | Lev-Ran et al. | Applicant |
| US7519827(B2) | 2009-04-01 | Anderson et al. | Applicant |
| US7581077(B2) | 2009-08-01 | Ignatius et al. | Applicant |
| US7627569(B2) | 2009-12-01 | Gafter | Applicant |
| US7627776(B2) | 2009-12-01 | Petruzzo | Applicant |
| US7739381(B2) | 2010-06-01 | Ignatius et al. | Applicant |
| US7748027(B2) | 2010-06-01 | Patrick | Applicant |
| US7761713(B2) | 2010-07-01 | Baar | Applicant |
| US7805600(B2) | 2010-09-01 | Bucher et al. | Applicant |
| US7818262(B2) | 2010-10-01 | Kavuri et al. | Applicant |
| US7840537(B2) | 2010-11-01 | Gokhale et al. | Applicant |
| US7882315(B2) | 2011-02-01 | Tsai et al. | Applicant |
| US8108427(B2) | 2012-01-01 | Prahlad et al. | Applicant |
| US8131648(B2) | 2012-03-01 | Barton | Applicant |
| US2002/0007347(A1) | 2002-01-01 | Blumenthal et al. | Applicant |
| US2002/0007351(A1) | 2002-01-01 | Hillegass et al. | Applicant |
| US2002/0077988(A1) | 2002-06-01 | Sasaki et al. | Applicant |
| US2002/0120726(A1) | 2002-08-01 | Padole et al. | Applicant |
| US2002/0128976(A1) | 2002-09-01 | O'Connor et al. | Applicant |
| US2002/0147734(A1) | 2002-10-01 | Shoup et al. | Applicant |
| US2002/0174011(A1) | 2002-11-01 | Sanchez et al. | Applicant |
| US2003/0005428(A1) | 2003-01-01 | Roman | Applicant |
| US2003/0200104(A1) | 2003-10-01 | Heming et al. | Applicant |
| US2004/0093229(A1) | 2004-05-01 | Plain | Applicant |
| US2004/0210509(A1) | 2004-10-01 | Eder | Applicant |
| US2004/0249759(A1) | 2004-12-01 | Higashi et al. | Applicant |
| US2004/0255143(A1) | 2004-12-01 | Wemyss et al. | Applicant |
| US2005/0027657(A1) | 2005-02-01 | Leontiev et al. | Applicant |
| US2005/0091655(A1) | 2005-04-01 | Probert et al. | Applicant |
| US2005/0097440(A1) | 2005-05-01 | Lusk et al. | Applicant |
| US2005/0108526(A1) | 2005-05-01 | Robertson | Applicant |
| US2006/0224846(A1) | 2006-10-01 | Amarendran et al. | Applicant |
| US2006/0242296(A1) | 2006-10-01 | Woolard et al. | Applicant |
| US2007/0198421(A1) | 2007-08-01 | Muller et al. | Applicant |
| US2007/0198422(A1) | 2007-08-01 | Prahlad et al. | Applicant |
| US2008/0005380(A1) | 2008-01-01 | Kawasaki et al. | Applicant |
| US2008/0091747(A1) | 2008-04-01 | Prahlad et al. | Applicant |
| US2008/0229037(A1) | 2008-09-01 | Bunte et al. | Applicant |
| US2008/0243795(A1) | 2008-10-01 | Prahlad et al. | Applicant |
| US2008/0307020(A1) | 2008-12-01 | Ko et al. | Examiner |
| US2008/0320319(A1) | 2008-12-01 | Muller et al. | Applicant |
| US2009/0222907(A1) | 2009-09-01 | Guichard | Applicant |
| US2009/0319534(A1) | 2009-12-01 | Gokhale | Applicant |
| US2009/0319585(A1) | 2009-12-01 | Gokhale | Applicant |
| US2010/0031017(A1) | 2010-02-01 | Gokhale et al. | Applicant |
| US2010/0242096(A1) | 2010-09-01 | Varadharajan et al. | Applicant |
| US2012/0023140(A1) | 2012-01-01 | Prahlad et al. | Applicant |
| EP259912(A1) | 1988-03-01 | Applicant | |
| EP405926(A2) | 1991-01-01 | Applicant | |
| EP467546(A2) | 1992-01-01 | Applicant | |
| EP774715(A1) | 1997-05-01 | Applicant | |
| EP809184(A1) | 1997-11-01 | Applicant | |
| EP862304(A2) | 1998-09-01 | Applicant | |
| EP899662(A1) | 1999-03-01 | Applicant | |
| EP981090(A1) | 2000-02-01 | Applicant | |
| WO-9513580(A1) | 1995-05-01 | Applicant | |
| WO-9839707(A1) | 1998-09-01 | Applicant | |
| WO-9912098(A1) | 1999-03-01 | Applicant |
Non-Patent Literature (22)
- Armstead et al., “Implementation of a Campus-wide Distributed Mass Storage Service: The Dream vs. Reality,” IEEE, 1995, pp. 190-199.Applicant
- Arneson, “Mass Storage Archiving in Network Environments,” Digest of Papers, Ninth IEEE Symposium on Mass Storage Systems, Oct. 31, 1988-Nov. 3, 1988, pp. 45-50, Monterey, CA.Applicant
- Cabrera et al., “ADSM: A Multi-Platform, Scalable, Backup and Archive Mass Storage System,” Digest of Papers, Compcon '95, Proceedings of the 40th IEEE Computer Society International Conference, Mar. 5, 1995-Mar. 9, 1995, pp. 420-427, San Francisco, CA.Applicant
- Eitel, “Backup and Storage Management in Distributed Heterogeneous Environments,” IEEE, 1994, pp. 124-126.Applicant
- Jander, M., “Launching Storage-Area Net,” Data Communications, US, McGraw Hill, NY, vol. 27, No. 4 (Mar. 21, 1998), pp. 64-72.Applicant
- Jason Gait, “The Optical File Cabinet: A Random-Access File System for Write-Once Optical Disks,” IEEE Computer, vol. 21, No. 6, pp. 11-22 (1988) (see in particular figure 5 in p. 15 and recitation in claim 5).Applicant
- PCT International Search Report for Application No. PCT/US01/02931, Mar. 6, 2002.Applicant
- Rosenblum et al., “The Design and Implementation of a Log-Structured File System,” Operating Systems Review SIGPOPS, vol. 25, No. 5, New York, US, pp. 1-15 (May 1991).Applicant
- “Associate”, Collins English Dictionary, London: Collins, 2000, Credo Reference online)[retrieved on Jul. 30, 2009], available at <http://wNw.credoreference.com/entry/hcengdicVassociate>, 1 page.Applicant
- “Right”, Chambers 21st Century Dictionary, London: Chambers Harrap, 2001, Credo Reference online}[retrieved on Jul. 30, 2009], available at <http://wNw.credoreference.comlentry/chambdict/right>, 1 page.Applicant
- CommVault Systems, Inc., “QiNetix Books Online Documentation,” submitted on CD-ROM, released Dec. 2005.Applicant
- CommVault, “Firewall Considerations—How to,” <http://documentation.commvault.com/commvault/release—8—0—0/books—online—1/english—us/features/firewall/firewall—how—to.htm>, internet accessed on Feb. 27, 2009, 11 pages.Applicant
- CommVault, “Firewall Considerations,” <http://documentation.commvault.com/commvault/release—8—0—0/books—online—1/english—us/features/firewall/firewall.htm>, internet accessed on Feb. 27, 2009, 8 pages.Applicant
- Kwok, S. H., Digital rights management for the online music business, SIGecom Exch. 3, 3 (Jun. 2002), available at <http://doi.acm.org/10.1145/844339.844347>, 8 pages.Applicant
- Microsoft SQL Server Documentation, “Adding a Member to a Predefined Role,” 1988-2000, accessed Apr. 18, 2008, 3 pages.Applicant
- Microsoft SQL Server Documentation, “Adding a Member to a SQL Server Database Role,” 1988-2000, accessed Apr. 18, 2008, 2 pages.Applicant
- Microsoft SQL Server Documentation, “Adding a Windows User or Group,” 1988-2000, accessed Apr. 18, 2008, 2 pages.Applicant
- Microsoft SQL Server Documentation, “Authentication Modes,” 1988-2000, accessed Apr. 18, 2008, 4 pages.Applicant
- Microsoft SQL Server Documentation, “Creating User-Defined SQL Server Database Roles,” 1988-2000, accessed Apr. 18, 2008, 2 pages.Applicant
- Microsoft SQL Server Documentation, “Granting a Windows User or Group Access to a Database,” 1988-2000, accessed Apr. 18, 2008, 2 pages.Applicant
- Microsoft SQL Server Documentation, “Security Architecture,” 1988-2000, accessed Apr. 18, 2008, 1 page.Applicant
- Ron White, “How Computers Work”, Sixth Edition, Que Corporation, Jun. 26, 2002, 7 pages.Applicant