Centrally rotating private/public encryption keys in a large scale system

Information

  • Patent Grant
  • 12003635
  • Patent Number
    12,003,635
  • Date Filed
    Thursday, December 2, 2021
    2 years ago
  • Date Issued
    Tuesday, June 4, 2024
    3 months ago
Abstract
A system and method for rotating private encryption keys for tenants of a database system has been developed. First, three separate public-private encryption keys are generated for a tenant of the database system. The three separate private encryption keys for the tenant are then stored in cloud-based storage. A defined cadence is created to rotate the private encryption keys for the tenant. The three separate private encryption keys for the tenant are defined as a a past private key, a present private key and a future private key. Next, the public encryption key is stored for the tenant in a global tenant directory. The present private key and the public encryption key are retrieved to encrypt and decrypt data from the tenant. The three separate private encryption keys are rotated at the defined cadence, where the past private key is discarded, the present private key becomes a new past private key, the future private key becomes a new present private key, and a new future private key is generated. The new past private key, the new present private key and the new future private key for the tenant are then stored in cloud-based storage.
Description
TECHNICAL FIELD

One or more implementations relate to the field of encryption; and more specifically, to a centrally rotating private/public encryption keys in a large scale system.


BACKGROUND

Public and private encryption “keys” are use to encrypt and decrypt data that is transferred between parties. However, the key pairs must be changed or rotated periodically in order to maintain proper security. With a large scale system with a large number of users, managing the rotation of key pairs can be challenging. Hence there is a need for a centrally rotating private/public encryption keys in a large scale system.





BRIEF DESCRIPTION OF THE DRAWINGS

The following figures use like reference numbers to refer to like elements. Although the following figures depict various example implementations, alternative implementations are within the spirit and scope of the appended claims. In the drawings:



FIG. 1 is a block diagram illustrating public/private encryption keys according to some example implementations.



FIG. 2 is a more detailed block diagram illustrating a system for centrally rotating a private/public encryption key according to some example implementations.



FIG. 3 is a diagram illustrating a method for centrally rotating a private/public encryption key according to some example implementations.



FIG. 4 is a flow chart illustrating a method for centrally rotating a private/public encryption key according to some example implementations.



FIG. 5A is a block diagram illustrating an electronic device according to some example implementations.



FIG. 5B is a block diagram of a deployment environment according to some example implementations.





DETAILED DESCRIPTION

The following description describes implementations for centrally rotating private/public encryption keys in a large scale system. A system and method for rotating private-public key pairs used for encryption by tenants of a database system has been developed. First, three separate public-private encryption key pairs are generated for a tenant of the database system. The three separate private encryption keys for the tenant are then stored in cloud-based storage while the three public keys are uploaded and stored in a global tenant directory. A defined cadence is created to rotate the private encryption keys for the tenant. The three separate private encryption keys for the tenant are defined as a past private key, a present private key and a future private key. The present private key and the public encryption key are retrieved to encrypt and decrypt data from the tenant. The three separate private encryption keys are rotated at the defined cadence, where the past private key is discarded, the present private key becomes a new past private key, the future private key becomes a new present private key, and a new future private key is generated. The new past private key, the new present private key and the new future private key for the tenant are then stored in cloud-based storage. Embodiments of the system have the features and advantages of: rotating millions of public/private key pair within a provided span of time; handling a problem of rotating all the millions of keys immediately; rotating the keys at regular cadence when existing keys have no clear timestamp component to track last rotation; and rotating at most once in a span of 24 hours.


The following terms as used herein are defined as follows.


Cloud to Cloud (C2C): a public/private key authentication process used to communicate with various team/sub groups within the system.


Cloud: the participating Rib-group/team.


Tenant: an individual entity within a cloud that participates in the C2C authentication process.


Global Directory of Tenant (GDOT): The infrastructure that powers C2C auth process. GDOT keeps track of all public keys that participate in the C2C authentication process. Each participating cloud uses GDOT as part of the authentication process.


Public/Private Keys Responsibilities: C2C follows public-private key encryption protocol. The public keys are stored in Global Directory of Tenants (COM) while the private keys are stored by the respective clouds. The cloud is responsible for uploading the public key to GDOT and holding on to the private key in a secure location.


Keys: An “elliptic curve” is used as a public/private key pair.


Triad: For a given tenant, three pair of keys are stored. This key triad has a past, a present and a future key. The present key is what is used, however the past and future key are also acceptable for the authentication process.


Timestamp: Each key has a timestamp suggesting when it should be live as part of the key attribute.


Turning now to FIG. 1, a block diagram 100 is shown illustrating public/private encryption keys according to some example implementations. The key triad is shown with a past key 102 (Key a), a present key 104 (Key b) and a future key 106 (Key c). Upon rotation, a new future key 108 (Key d) is created. The past key (Key a) is discarded, the present key (Key b) becomes the new past key, the future key (Key c) becomes the new present key and the newly created key (Key d) becomes the new future key. The rotated keys for the tenant are then stored in cloud-based storage.


The key triad generated for rotation is spaced 30 days apart. This is done by ensuring the key identification attribute for each key is expressly spaced by 30 days at the point of tenant key creation. The ‘key identification’ is now a unique identifier but also a timestamp for indicating when the key becomes active for use. However, existing keys don't have a clear definition of time. New keys added to the triad would have an accurate key identification value which will be +30 days. The fact that a new/future key added to the triad has an accurate timestamp is used to prevent multiple rotations of keys. For example, the future key identification is checked before rotating to determine if it is not in the range (i.e., now+1 day, now+30 days). This will always hold true for newly rotated keys and the noise of existing/old keys may be ignored. This helps us ensure that no keys are rotated more than once.


In some embodiments, a table is created to track the last rotation of a tenant key triad. This will help keep track of the last key rotation. The table will also act as our audit of all tenant keys. A record is kept in the table of all the tenants and their keys which need to rotate. This table is initially populated when the tenant and its key triad is generated. This record is also deleted when the tenant is deleted. The table will also keep track of when the keys were last rotated.


Turning now to FIG. 2, a block diagram 200 is shown illustrating a system for centrally rotating a private/public encryption key according to some example implementations of table structure. The organizations/tenants 204 in the table are logically bucketed by hashing the organization ID with a coordinator 202. For this example, 1024 logical buckets 204 are chosen. The table 206 is partitioned by these logical buckets to optimize reads from the table 206. The 1024 buckets 204 are divided into 32 partitions which helps reduce the load on the database and helps parallelize the rotation process.


Turning now to FIG. 3, a diagram 300 illustrating a method for centrally rotating a private/public encryption key according to some example implementations. The actual rotation is performed as a batch job 302 that periodically acts on the table 206. The job 302 wakes up and parallelizes the 1024 logical buckets to ‘N’ bucket ranges. “N” is configurable and controls the parallelism. Each bucket ID in the bucket range is iterated and queried for tenants whose last rotated date is now (−30) days. This gives a base line for all tenants in a given logical bucket that are eligible for key rotation. For each tenant queried, we perform the rotation is performed by updating GDOT 306 and S3304. Upon a successful rotation, the rotation status is updated as success in the table and update the “last rotated date” to the present day. This prevents it from being picked up again. If at any point a rotation operation fails, the table is updated and the operation proceeds to the next tenant. At every failure, consecutive failures are tracked and bad tenants filtered out that fail repeatedly. Control levers are used to control how far back tenants are queried for rotation (default is 30 days).


Turning now to FIG. 4, a flow chart 400 is shown illustrating a method for centrally rotating a private/public encryption key according to some example implementations. First, three separate public-private encryption key pairs are generated 402 for each tenant of the database system. The three separate private encryption keys for each tenant then stored in cloud-based storage. A defined cadence is created to rotate the private encryption keys for each tenant 404. The three separate private encryption keys for each tenant are defined as a past private key, a present private key and a future private key 406. Next, the public encryption key for each tenant of the database system and stored for each tenant in a global tenant directory 408. The present private key and the public encryption key are retrieved 410 to encrypt and decrypt data from the tenant 412. The three separate private encryption keys are rotated at the defined cadence, where the past private key is discarded 414, the present private key becomes a new past private key 416, the future private key becomes a new present private key 418, and a new future private key is generated 420. The new past private key, the new present private key and the new future private key for each tenant are then stored in cloud-based storage 422.


One or more parts of the above implementations may include software. Software is a general term whose meaning can range from part of the code and/or metadata of a single computer program to the entirety of multiple programs. A computer program (also referred to as a program) comprises code and optionally data. Code (sometimes referred to as computer program code or program code) comprises software instructions (also referred to as instructions). Instructions may be executed by hardware to perform operations. Executing software includes executing code, which includes executing instructions. The execution of a program to perform a task involves executing some or all of the instructions in that program.


An electronic device (also referred to as a device, computing device, computer, etc.) includes hardware and software. For example, an electronic device may include a set of one or more processors coupled to one or more machine-readable storage media (e.g., non-volatile memory such as magnetic disks, optical disks, read only memory (ROM), Flash memory, phase change memory, solid state drives (SSDs)) to store code and optionally data. For instance, an electronic device may include non-volatile memory (with slower read/write times) and volatile memory (e.g., dynamic random-access memory (DRAM), static random-access memory (SRAM)). Non-volatile memory persists code/data even when the electronic device is turned off or when power is otherwise removed, and the electronic device copies that part of the code that is to be executed by the set of processors of that electronic device from the non-volatile memory into the volatile memory of that electronic device during operation because volatile memory typically has faster read/write times. As another example, an electronic device may include a non-volatile memory (e.g., phase change memory) that persists code/data when the electronic device has power removed, and that has sufficiently fast read/write times such that, rather than copying the part of the code to be executed into volatile memory, the code/data may be provided directly to the set of processors (e.g., loaded into a cache of the set of processors). In other words, this non-volatile memory operates as both long term storage and main memory, and thus the electronic device may have no or only a small amount of volatile memory for main memory.


In addition to storing code and/or data on machine-readable storage media, typical electronic devices can transmit and/or receive code and/or data over one or more machine-readable transmission media (also called a carrier) (e.g., electrical, optical, radio, acoustical or other forms of propagated signals—such as carrier waves, and/or infrared signals). For instance, typical electronic devices also include a set of one or more physical network interface(s) to establish network connections (to transmit and/or receive code and/or data using propagated signals) with other electronic devices. Thus, an electronic device may store and transmit (internally and/or with other electronic devices over a network) code and/or data with one or more machine-readable media (also referred to as computer-readable media).


Software instructions (also referred to as instructions) are capable of causing (also referred to as operable to cause and configurable to cause) a set of processors to perform operations when the instructions are executed by the set of processors. The phrase “capable of causing” (and synonyms mentioned above) includes various scenarios (or combinations thereof), such as instructions that are always executed versus instructions that may be executed. For example, instructions may be executed: 1) only in certain situations when the larger program is executed (e.g., a condition is fulfilled in the larger program; an event occurs such as a software or hardware interrupt, user input (e.g., a keystroke, a mouse-click, a voice command); a message is published, etc.); or 2) when the instructions are called by another program or part thereof (whether or not executed in the same or a different process, thread, lightweight thread, etc.). These scenarios may or may not require that a larger program, of which the instructions are a part, be currently configured to use those instructions (e.g., may or may not require that a user enables a feature, the feature or instructions be unlocked or enabled, the larger program is configured using data and the program's inherent functionality, etc.). As shown by these exemplary scenarios, “capable of causing” (and synonyms mentioned above) does not require “causing” but the mere capability to cause. While the term “instructions” may be used to refer to the instructions that when executed cause the performance of the operations described herein, the term may or may not also refer to other instructions that a program may include. Thus, instructions, code, program, and software are capable of causing operations when executed, whether the operations are always performed or sometimes performed (e.g., in the scenarios described previously). The phrase “the instructions when executed” refers to at least the instructions that when executed cause the performance of the operations described herein but may or may not refer to the execution of the other instructions.


Electronic devices are designed for and/or used for a variety of purposes, and different terms may reflect those purposes (e.g., user devices, network devices). Some user devices are designed to mainly be operated as servers (sometimes referred to as server devices), while others are designed to mainly be operated as clients (sometimes referred to as client devices, client computing devices, client computers, or end user devices; examples of which include desktops, workstations, laptops, personal digital assistants, smartphones, wearables, augmented reality (AR) devices, virtual reality (VR) devices, mixed reality (MR) devices, etc.). The software executed to operate a user device (typically a server device) as a server may be referred to as server software or server code), while the software executed to operate a user device (typically a client device) as a client may be referred to as client software or client code. A server provides one or more services (also referred to as serves) to one or more clients.


The term “user” refers to an entity (e.g., an individual person) that uses an electronic device. Software and/or services may use credentials to distinguish different accounts associated with the same and/or different users. Users can have one or more roles, such as administrator, programmer/developer, and end user roles. As an administrator, a user typically uses electronic devices to administer them for other users, and thus an administrator often works directly and/or indirectly with server devices and client devices.



FIG. 5A is a block diagram illustrating an electronic device 500 according to some example implementations. FIG. 5A includes hardware 520 comprising a set of one or more processor(s) 522, a set of one or more network interfaces 524 (wireless and/or wired), and machine-readable media 526 having stored therein software 528 (which includes instructions executable by the set of one or more processor(s) 522). The machine-readable media 526 may include non-transitory and/or transitory machine-readable media. Each of the previously described clients and the rotation of private encryption key service may be implemented in one or more electronic devices 500. In one implementation: 1) each of the clients is implemented in a separate one of the electronic devices 500 (e.g., in end user devices where the software 528 represents the software to implement clients to interface directly and/or indirectly with the rotation of private encryption key service (e.g., software 528 represents a web browser, a native client, a portal, a command-line interface, and/or an application programming interface (API) based upon protocols such as Simple Object Access Protocol (SOAP), Representational State Transfer (REST), etc.)); 2) the rotation of private encryption key service is implemented in a separate set of one or more of the electronic devices 500 (e.g., a set of one or more server devices where the software 528 represents the software to implement the rotation of private encryption key service); and 3) in operation, the electronic devices implementing the clients and the rotation of private encryption key service would be communicatively coupled (e.g., by a network) and would establish between them (or through one or more other layers and/or or other services) connections for submitting the rotation of private encryption key service and returning keys to the clients. Other configurations of electronic devices may be used in other implementations (e.g., an implementation in which the client and the rotation of private encryption key service are implemented on a single one of electronic device 500).


During operation, an instance of the software 528 (illustrated as instance 506 and referred to as a software instance; and in the more specific case of an application, as an application instance) is executed. In electronic devices that use compute virtualization, the set of one or more processor(s) 522 typically execute software to instantiate a virtualization layer 508 and one or more software container(s) 504A-504R (e.g., with operating system-level virtualization, the virtualization layer 508 may represent a container engine (such as Docker Engine by Docker, Inc. or rkt in Container Linux by Red Hat, Inc.) running on top of (or integrated into) an operating system, and it allows for the creation of multiple software containers 504A-504R (representing separate user space instances and also called virtualization engines, virtual private servers, or jails) that may each be used to execute a set of one or more applications; with full virtualization, the virtualization layer 508 represents a hypervisor (sometimes referred to as a virtual machine monitor (VMM)) or a hypervisor executing on top of a host operating system, and the software containers 504A-504R each represent a tightly isolated form of a software container called a virtual machine that is run by the hypervisor and may include a guest operating system; with para-virtualization, an operating system and/or application running with a virtual machine may be aware of the presence of virtualization for optimization purposes). Again, in electronic devices where compute virtualization is used, during operation, an instance of the software 528 is executed within the software container 504A on the virtualization layer 508. In electronic devices where compute virtualization is not used, the instance 506 on top of a host operating system is executed on the “bare metal” electronic device 500. The instantiation of the instance 506, as well as the virtualization layer 508 and software containers 504A-504R if implemented, are collectively referred to as software instance(s) 502. Alternative implementations of an electronic device may have numerous variations from that described above. For example, customized hardware and/or accelerators might also be used in an electronic device.



FIG. 5B is a block diagram of a deployment environment according to some example implementations. A system 540 includes hardware (e.g., a set of one or more server devices) and software to provide service(s) 542, including the rotation of private encryption key service. In some implementations the system 540 is in one or more datacenter(s). These datacenter(s) may be: 1) first party datacenter(s), which are datacenter(s) owned and/or operated by the same entity that provides and/or operates some or all of the software that provides the service(s) 542; and/or 2) third-party datacenter(s), which are datacenter(s) owned and/or operated by one or more different entities than the entity that provides the service(s) 542 (e.g., the different entities may host some or all of the software provided and/or operated by the entity that provides the service(s) 542). For example, third-party datacenters may be owned and/or operated by entities providing public cloud services (e.g., Amazon.com, Inc. (Amazon Web Services), Google LLC (Google Cloud Platform), Microsoft Corporation (Azure)).


The system 540 is coupled to user devices 580A-580S over a network 582. The service(s) 542 may be on-demand services that are made available to one or more of the users 584A-584S working for one or more entities other than the entity which owns and/or operates the on-demand services (those users sometimes referred to as outside users) so that those entities need not be concerned with building and/or maintaining a system, but instead may make use of the service(s) 542 when needed (e.g., when needed by the users 584A-584S). The service(s) 542 may communicate with each other and/or with one or more of the user devices 580A-580S via one or more APIs (e.g., a REST API). In some implementations, the user devices 580A-580S are operated by users 584A-584S, and each may be operated as a client device and/or a server device. In some implementations, one or more of the user devices 580A-580S are separate ones of the electronic device 500 or include one or more features of the electronic device 500.


In some implementations, the system 540 is a multi-tenant system (also known as a multi-tenant architecture). The term multi-tenant system refers to a system in which various elements of hardware and/or software of the system may be shared by one or more tenants. A multi-tenant system may be operated by a first entity (sometimes referred to a multi-tenant system provider, operator, or vendor; or simply a provider, operator, or vendor) that provides one or more services to the tenants (in which case the tenants are customers of the operator and sometimes referred to as operator customers). A tenant includes a group of users who share a common access with specific privileges. The tenants may be different entities (e.g., different companies, different departments/divisions of a company, and/or other types of entities), and some or all of these entities may be vendors that sell or otherwise provide products and/or services to their customers (sometimes referred to as tenant customers). A multi-tenant system may allow each tenant to input tenant specific data for user management, tenant-specific functionality, configuration, customizations, non-functional properties, associated applications, etc. A tenant may have one or more roles relative to a system and/or service. For example, in the context of a customer relationship management (CRM) system or service, a tenant may be a vendor using the CRM system or service to manage information the tenant has regarding one or more customers of the vendor. As another example, in the context of Data as a Service (DAAS), one set of tenants may be vendors providing data and another set of tenants may be customers of different ones or all of the vendors' data. As another example, in the context of Platform as a Service (PAAS), one set of tenants may be third-party application developers providing applications/services and another set of tenants may be customers of different ones or all of the third-party application developers.


Multi-tenancy can be implemented in different ways. In some implementations, a multi-tenant architecture may include a single software instance (e.g., a single database instance) which is shared by multiple tenants; other implementations may include a single software instance (e.g., database instance) per tenant; yet other implementations may include a mixed model; e.g., a single software instance (e.g., an application instance) per tenant and another software instance (e.g., database instance) shared by multiple tenants.


In one implementation, the system 540 is a multi-tenant cloud computing architecture supporting multiple services, such as one or more of the following types of services: Customer relationship management (CRM); Configure, price, quote (CPQ); Business process modeling (BPM); Customer support; Marketing; External data connectivity; Productivity; Database-as-a-Service; Data-as-a-Service (DAAS or DaaS); Platform-as-a-service (PAAS or PaaS); Infrastructure-as-a-Service (IAAS or IaaS) (e.g., virtual machines, servers, and/or storage); Analytics; Community; Internet-of-Things (IoT); Industry-specific; Artificial intelligence (AI); Application marketplace (“app store”); Data modeling; Security; and Identity and access management (IAM). For example, system 540 may include an application platform 544 that enables PAAS for creating, managing, and executing one or more applications developed by the provider of the application platform 544, users accessing the system 540 via one or more of user devices 580A-580S, or third-party application developers accessing the system 540 via one or more of user devices 580A-580S.


In some implementations, one or more of the service(s) 542 may use one or more multi-tenant databases 546, as well as system data storage 550 for system data 552 accessible to system 540. In certain implementations, the system 540 includes a set of one or more servers that are running on server electronic devices and that are configured to handle requests for any authorized user associated with any tenant (there is no server affinity for a user and/or tenant to a specific server). The user devices 580A-580S communicate with the server(s) of system 540 to request and update tenant-level data and system-level data hosted by system 540, and in response the system 540 (e.g., one or more servers in system 540) automatically may generate one or more Structured Query Language (SQL) statements (e.g., one or more SQL queries) that are designed to access the desired information from the multi-tenant database(s) 546 and/or system data storage 550.


In some implementations, the service(s) 542 are implemented using virtual applications dynamically created at run time responsive to queries from the user devices 580A-580S and in accordance with metadata, including: 1) metadata that describes constructs (e.g., forms, reports, workflows, user access privileges, business logic) that are common to multiple tenants; and/or 2) metadata that is tenant specific and describes tenant specific constructs (e.g., tables, reports, dashboards, interfaces, etc.) and is stored in a multi-tenant database. To that end, the program code 560 may be a runtime engine that materializes application data from the metadata; that is, there is a clear separation of the compiled runtime engine (also known as the system kernel), tenant data, and the metadata, which makes it possible to independently update the system kernel and tenant-specific applications and schemas, with virtually no risk of one affecting the others. Further, in one implementation, the application platform 544 includes an application setup mechanism that supports application developers' creation and management of applications, which may be saved as metadata by save routines. Invocations to such applications, including the rotation of private encryption key service, may be coded using Procedural Language/Structured Object Query Language (PL/SOQL) that provides a programming language style interface. Invocations to applications may be detected by one or more system processes, which manages retrieving application metadata for the tenant making the invocation and executing the metadata as an application in a software container (e.g., a virtual machine).


Network 582 may be any one or any combination of a LAN (local area network), WAN (wide area network), telephone network, wireless network, point-to-point network, star network, token ring network, hub network, or other appropriate configuration. The network may comply with one or more network protocols, including an Institute of Electrical and Electronics Engineers (IEEE) protocol, a 3rd Generation Partnership Project (3GPP) protocol, a 4th generation wireless protocol (4G) (e.g., the Long Term Evolution (LTE) standard, LTE Advanced, LTE Advanced Pro), a fifth generation wireless protocol (5G), and/or similar wired and/or wireless protocols, and may include one or more intermediary devices for routing data between the system 540 and the user devices 580A-580S.


Each user device 580A-580S (such as a desktop personal computer, workstation, laptop, Personal Digital Assistant (PDA), smartphone, smartwatch, wearable device, augmented reality (AR) device, virtual reality (VR) device, etc.) typically includes one or more user interface devices, such as a keyboard, a mouse, a trackball, a touch pad, a touch screen, a pen or the like, video or touch free user interfaces, for interacting with a graphical user interface (GUI) provided on a display (e.g., a monitor screen, a liquid crystal display (LCD), a head-up display, a head-mounted display, etc.) in conjunction with pages, forms, applications and other information provided by system 540. For example, the user interface device can be used to access data and applications hosted by system 540, and to perform searches on stored data, and otherwise allow one or more of users 584A-584S to interact with various GUI pages that may be presented to the one or more of users 584A-584S. User devices 580A-580S might communicate with system 540 using TCP/IP (Transfer Control Protocol and Internet Protocol) and, at a higher network level, use other networking protocols to communicate, such as Hypertext Transfer Protocol (HTTP), File Transfer Protocol (FTP), Andrew File System (AFS), Wireless Application Protocol (WAP), Network File System (NFS), an application program interface (API) based upon protocols such as Simple Object Access Protocol (SOAP), Representational State Transfer (REST), etc. In an example where HTTP is used, one or more user devices 580A-580S might include an HTTP client, commonly referred to as a “browser,” for sending and receiving HTTP messages to and from server(s) of system 540, thus allowing users 584A-584S of the user devices 580A-580S to access, process and view information, pages and applications available to it from system 540 over network 582.


In the above description, numerous specific details such as resource partitioning/sharing/duplication implementations, types and interrelationships of system components, and logic partitioning/integration choices are set forth in order to provide a more thorough understanding. The invention may be practiced without such specific details, however. In other instances, control structures, logic implementations, opcodes, means to specify operands, and full software instruction sequences have not been shown in detail since those of ordinary skill in the art, with the included descriptions, will be able to implement what is described without undue experimentation.


References in the specification to “one implementation,” “an implementation,” “an example implementation,” etc., indicate that the implementation described may include a particular feature, structure, or characteristic, but every implementation may not necessarily include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same implementation. Further, when a particular feature, structure, and/or characteristic is described in connection with an implementation, one skilled in the art would know to affect such feature, structure, and/or characteristic in connection with other implementations whether or not explicitly described.


For example, the figure(s) illustrating flow diagrams sometimes refer to the figure(s) illustrating block diagrams, and vice versa. Whether or not explicitly described, the alternative implementations discussed with reference to the figure(s) illustrating block diagrams also apply to the implementations discussed with reference to the figure(s) illustrating flow diagrams, and vice versa. At the same time, the scope of this description includes implementations, other than those discussed with reference to the block diagrams, for performing the flow diagrams, and vice versa.


Bracketed text and blocks with dashed borders (e.g., large dashes, small dashes, dot-dash, and dots) may be used herein to illustrate optional operations and/or structures that add additional features to some implementations. However, such notation should not be taken to mean that these are the only options or optional operations, and/or that blocks with solid borders are not optional in certain implementations.


The detailed description and claims may use the term “coupled,” along with its derivatives. “Coupled” is used to indicate that two or more elements, which may or may not be in direct physical or electrical contact with each other, co-operate or interact with each other.


While the flow diagrams in the figures show a particular order of operations performed by certain implementations, such order is exemplary and not limiting (e.g., alternative implementations may perform the operations in a different order, combine certain operations, perform certain operations in parallel, overlap performance of certain operations such that they are partially in parallel, etc.).


While the above description includes several example implementations, the invention is not limited to the implementations described and can be practiced with modification and alteration within the spirit and scope of the appended claims. The description is thus illustrative instead of limiting.

Claims
  • 1. A method for rotating private encryption keys for tenants of a database system, comprising: generating three separate public-private encryption key pairs for a tenant of the database system, where each of the three separate private encryption keys has a timestamp for indicating when each private encryption key is active;storing the three separate private encryption keys for the tenant in cloud-based storage;creating a defined cadence to rotate the private encryption keys for the tenant, where the defined cadence is a specified time span that is determined from the timestamp of the private encryption key;defining the three separate private encryption keys for the tenant as a past private key, a present private key and a future private key;storing the public encryption key for the tenant in a global tenant directory;retrieving the present private key and the public encryption key to encrypt and decrypt data from the tenant;rotating the three separate private encryption keys if the future private key timestamp is within the specified time span of the defined cadence to rotate the private encryption keys, where the past private key is discarded,the present private key becomes a new past private key,the future private key becomes a new present private key, anda new future private key is generated; andstoring the new past private key, the new present private key and the new future private key for the tenant in cloud-based storage.
  • 2. The method of claim 1, where the specified time span is 30 days.
  • 3. The method of claim 1, where the private encryption keys are rotated only once during a 30 day specified time span.
  • 4. The method of claim 1, where each private encryption key is rotated at a predetermined defined cadence when a timestamp for the private encryption key is not present.
  • 5. The method of claim 1, where a table is created that stores the times of the rotation of the private encryption keys.
  • 6. The method of claim 5, where the rotation of the private encryption keys is performed as a batch job.
  • 7. The method of claim 6, where the table is updated with data about the rotation of the private encryption keys after the completion of every batch job.
  • 8. An apparatus comprising: a processor;a non-transitory machine-readable storage medium that provides instructions that, if executed by the processor, are configurable to cause the apparatus to perform operations comprising, generating three separate public-private encryption key pairs for a tenant of the database system, where each of the three separate private encryption keys has a timestamp for indicating when each private encryption key is active;storing the three separate private encryption keys for the tenant in cloud-based storage;creating a defined cadence to rotate the private encryption keys for the tenant, where the defined cadence is a specified time span that is determined from the timestamp of the private encryption key;defining the three separate private encryption keys for the tenant as a past private key, a present private key and a future private key;storing the public encryption key for the tenant in a global tenant directory;retrieving the present private key and the public encryption key to encrypt and decrypt data from the tenant;rotating the three separate private encryption keys if the future private key timestamp is within the specified time span of the defined cadence to rotate the private encryption keys, where the past private key is discarded,the present private key becomes a new past private key,the future private key becomes a new present private key, anda new future private key is generated; andstoring the new past private key, the new present private key and the new future private key for the tenant in cloud-based storage.
  • 9. The apparatus of claim 8, where the specified time span is 30 days.
  • 10. The apparatus of claim 8, where the private encryption keys are rotated only once during a 30 day specified time span.
  • 11. The apparatus of claim 8, where each private encryption key is rotated at a predetermined defined cadence when a timestamp for the private encryption key is not present.
  • 12. The apparatus of claim 8, where a table is created that stores the times of the rotation of the private encryption keys.
  • 13. The apparatus of claim 12, where the rotation of the private encryption keys is performed as a batch job.
  • 14. The apparatus of claim 13, where the table is updated with data about the rotation of the private encryption keys after the completion of every batch job.
US Referenced Citations (158)
Number Name Date Kind
5577188 Zhu Nov 1996 A
5608872 Schwartz et al. Mar 1997 A
5649104 Carleton et al. Jul 1997 A
5715450 Ambrose et al. Feb 1998 A
5761419 Schwartz et al. Jun 1998 A
5819038 Carleton et al. Oct 1998 A
5821937 Tonelli et al. Oct 1998 A
5831610 Tonelli et al. Nov 1998 A
5873096 Lim et al. Feb 1999 A
5918159 Fomukong et al. Jun 1999 A
5963953 Cram et al. Oct 1999 A
6092083 Brodersen et al. Jul 2000 A
6161149 Achacoso et al. Dec 2000 A
6169534 Raffel et al. Jan 2001 B1
6178425 Brodersen et al. Jan 2001 B1
6189011 Lim et al. Feb 2001 B1
6216135 Brodersen et al. Apr 2001 B1
6233617 Rothwein et al. May 2001 B1
6266669 Brodersen et al. Jul 2001 B1
6295530 Ritchie et al. Sep 2001 B1
6324568 Diec et al. Nov 2001 B1
6324693 Brodersen et al. Nov 2001 B1
6336137 Lee et al. Jan 2002 B1
D454139 Feldcamp et al. Mar 2002 S
6367077 Brodersen et al. Apr 2002 B1
6393605 Loomans May 2002 B1
6405220 Brodersen et al. Jun 2002 B1
6434550 Warner et al. Aug 2002 B1
6446089 Brodersen et al. Sep 2002 B1
6535909 Rust Mar 2003 B1
6549908 Loomans Apr 2003 B1
6553563 Ambrose et al. Apr 2003 B2
6560461 Fomukong et al. May 2003 B1
6574635 Stauber et al. Jun 2003 B2
6577726 Huang et al. Jun 2003 B1
6601087 Zhu et al. Jul 2003 B1
6604117 Lim et al. Aug 2003 B2
6604128 Diec Aug 2003 B2
6609150 Lee et al. Aug 2003 B2
6621834 Scherpbier et al. Sep 2003 B1
6654032 Zhu et al. Nov 2003 B1
6665648 Brodersen et al. Dec 2003 B2
6665655 Warner et al. Dec 2003 B1
6684438 Brodersen et al. Feb 2004 B2
6711565 Subramaniam et al. Mar 2004 B1
6724399 Katchour et al. Apr 2004 B1
6728702 Subramaniam et al. Apr 2004 B1
6728960 Loomans et al. Apr 2004 B1
6732095 Warshavsky et al. May 2004 B1
6732100 Brodersen et al. May 2004 B1
6732111 Brodersen et al. May 2004 B2
6754681 Brodersen et al. Jun 2004 B2
6763351 Subramaniam et al. Jul 2004 B1
6763501 Zhu et al. Jul 2004 B1
6768904 Kim Jul 2004 B2
6772229 Achacoso et al. Aug 2004 B1
6782383 Subramaniam et al. Aug 2004 B2
6804330 Jones et al. Oct 2004 B1
6826565 Ritchie et al. Nov 2004 B2
6826582 Chatterjee et al. Nov 2004 B1
6826745 Coker Nov 2004 B2
6829655 Huang et al. Dec 2004 B1
6842748 Warner et al. Jan 2005 B1
6850895 Brodersen et al. Feb 2005 B2
6850949 Warner et al. Feb 2005 B2
7062502 Kesler Jun 2006 B1
7069231 Cinarkaya et al. Jun 2006 B1
7181758 Chan Feb 2007 B1
7289976 Kihneman et al. Oct 2007 B2
7340411 Cook Mar 2008 B2
7356482 Frankland et al. Apr 2008 B2
7401094 Kesler Jul 2008 B1
7412455 Dillon Aug 2008 B2
7508789 Chan Mar 2009 B2
7620655 Larsson et al. Nov 2009 B2
7698160 Beaven et al. Apr 2010 B2
7730478 Weissman Jun 2010 B2
7779475 Jakobson et al. Aug 2010 B2
8014943 Jakobson Sep 2011 B2
8015495 Achacoso et al. Sep 2011 B2
8032297 Jakobson Oct 2011 B2
8082301 Ahlgren et al. Dec 2011 B2
8095413 Beaven Jan 2012 B1
8095594 Beaven et al. Jan 2012 B2
8209308 Rueben et al. Jun 2012 B2
8275836 Beaven et al. Sep 2012 B2
8457545 Chan Jun 2013 B2
8484111 Frankland et al. Jul 2013 B2
8490025 Jakobson et al. Jul 2013 B2
8504945 Jakobson et al. Aug 2013 B2
8510045 Rueben et al. Aug 2013 B2
8510664 Rueben et al. Aug 2013 B2
8566301 Rueben et al. Oct 2013 B2
8646103 Jakobson et al. Feb 2014 B2
10862873 Carru Dec 2020 B1
20010044791 Richter et al. Nov 2001 A1
20020072951 Lee et al. Jun 2002 A1
20020082892 Raffel Jun 2002 A1
20020129352 Brodersen et al. Sep 2002 A1
20020140731 Subramanian et al. Oct 2002 A1
20020143997 Huang et al. Oct 2002 A1
20020162090 Parnell et al. Oct 2002 A1
20020165742 Robbins Nov 2002 A1
20030004971 Gong Jan 2003 A1
20030018705 Chen et al. Jan 2003 A1
20030018830 Chen et al. Jan 2003 A1
20030041110 Wenocur Feb 2003 A1
20030066031 Laane et al. Apr 2003 A1
20030066032 Ramachandran et al. Apr 2003 A1
20030069936 Warner et al. Apr 2003 A1
20030070000 Coker et al. Apr 2003 A1
20030070004 Mukundan et al. Apr 2003 A1
20030070005 Mukundan et al. Apr 2003 A1
20030074418 Coker et al. Apr 2003 A1
20030120675 Stauber et al. Jun 2003 A1
20030151633 George et al. Aug 2003 A1
20030159136 Huang et al. Aug 2003 A1
20030187921 Diec et al. Oct 2003 A1
20030189600 Gune et al. Oct 2003 A1
20030204427 Gune et al. Oct 2003 A1
20030206192 Chen et al. Nov 2003 A1
20030225730 Warner et al. Dec 2003 A1
20040001092 Rothwein et al. Jan 2004 A1
20040010489 Rio et al. Jan 2004 A1
20040015981 Coker et al. Jan 2004 A1
20040027388 Berg et al. Feb 2004 A1
20040128001 Levin et al. Jul 2004 A1
20040186860 Lee et al. Sep 2004 A1
20040193510 Catahan et al. Sep 2004 A1
20040199489 Barnes-Leon et al. Oct 2004 A1
20040199536 Barnes-Leon et al. Oct 2004 A1
20040199543 Braud et al. Oct 2004 A1
20040249854 Barnes-Leon et al. Dec 2004 A1
20040260534 Pak et al. Dec 2004 A1
20040260659 Chan et al. Dec 2004 A1
20040268299 Lei et al. Dec 2004 A1
20050050555 Exley et al. Mar 2005 A1
20050091098 Brodersen et al. Apr 2005 A1
20060021019 Hinton et al. Jan 2006 A1
20080249972 Dillon Oct 2008 A1
20090063414 White et al. Mar 2009 A1
20090100342 Jakobson Apr 2009 A1
20090177744 Marlow et al. Jul 2009 A1
20110247051 Bulumulla et al. Oct 2011 A1
20120042218 Cinarkaya et al. Feb 2012 A1
20120218958 Rangaiah Aug 2012 A1
20120233137 Jakobson et al. Sep 2012 A1
20130212497 Zelenko et al. Aug 2013 A1
20130218948 Jakobson Aug 2013 A1
20130218949 Jakobson Aug 2013 A1
20130218966 Jakobson Aug 2013 A1
20130247216 Cinarkaya et al. Sep 2013 A1
20150086018 Harjula Mar 2015 A1
20170331802 Keshava Nov 2017 A1
20190068366 Guajardo Merchan Feb 2019 A1
20190378153 Eich Dec 2019 A1
20220200789 Lalande Jun 2022 A1
20230102404 Hunter Mar 2023 A1
Related Publications (1)
Number Date Country
20230179413 A1 Jun 2023 US