The security of computing resources and associated data is of high importance in many contexts. As an example, organizations often utilize networks of computing devices to provide a robust set of services to their users. Networks often span multiple geographic boundaries and often connect with other networks. An organization, for example, may support its operations using both internal networks of computing resources and computing resources managed by others. Computers of the organization, for instance, may communicate with computers of other organizations to access and/or provide data while using services of another organization. In many instances, organizations configure and operate remote networks using hardware managed by other organizations, thereby reducing infrastructure costs and achieving other advantages. With such configurations of computing resources, ensuring that access to the resources and the data they hold is secure can be challenging, especially as the size and complexity of such configurations grow.
Various embodiments in accordance with the present disclosure will be described with reference to the drawings, in which:
In the following description, various embodiments will be described. For purposes of explanation, specific configurations and details are set forth in order to provide a thorough understanding of the embodiments. However, it will also be apparent to one skilled in the art that the embodiments may be practiced without the specific details. Furthermore, well-known features may be omitted or simplified in order not to obscure the embodiment being described.
Techniques described and suggested herein relate to the submission and processing of requests where the requests include cryptographic keys. The requests may be generated by and submitted from customers of a service provider, such as a computing resource service provider. Processing the requests may include use of the keys included in the requests to perform one or more cryptographic operations such as encryption, decryption and generation of electronic (digital) signatures on data. In some embodiments, the techniques described and suggested herein are used to enable server-side encryption (and/or related techniques such as decryption) where the key to be used for encryption/decryption is controlled by the client (i.e. device of the customer or operating on behalf of the customer).
In various embodiments, use of keys provided in requests is performed so that, except for a limited time during which the keys are used, the service provider lacks access to the key. For example, the service provider may operate a data storage service. A customer may transmit data to the service provider for storage by the data storage service. A request to the service provider may include a key to be used to encrypt the data. The service provider may obtain the key from the request and use the key to encrypt the data so that the encrypted data may be persistently stored using the data storage service. When the key is no longer needed (e.g., when encryption of the data has completed), the service provider may perform one or more operations to lose access to the key, such as by destroying or allowing to be destroyed any in-memory copies of the key. Any copies of the data in plaintext form may similarly be destroyed or allowed to be destroyed. Once the key and plaintext data has been destroyed, the customer can be assured that the provider is unable to decrypt the data. Thus, even if a security breach or other event at the provider causes access to the data not authorized by the customer, the breach by itself does not enable access to the data in plaintext form.
Keys may be provided in requests in various ways in accordance with different embodiments. For example, in some embodiments, the request includes the key in plaintext form. The plaintext key may be a symmetric key to be used in a symmetric key algorithm. The plaintext key may also be a public key of a public-private key pair for an asymmetric key algorithm, where the service provider lacks access to the private key of the key pair and the private key is accessible to an entity to be able to decrypt using the private key (e.g., the customer). In some embodiments, requests include keys in encrypted (wrapped) form. For example, the key may be encrypted so as to be decryptable by the service provider or another entity at the direction of the service provider. The key used to encrypt the key in the request may be a secret shared with an entity able to decrypt the key (e.g., service provider) or a public key of a public-private key pair where the private key is to be used by an entity to decrypt the encrypted key for processing the request.
Upon receipt of a request with a key, the service provider may access the key from the request, decrypting or causing to be decrypted, if applicable, and then process the request. Other operations may be performed, such as by verifying an electronic signature of the request or checking whether fulfillment of the request is in compliance with any applicable policy. Other details of operations that may be performed are discussed in more detail below.
As illustrated in
The encrypted data 112 may then be stored in a data storage system 114. The data storage system 114 while illustrated as separate from the service provider 106 may be a subsystem of the service provider 106. For example, the request 104 may be submitted to a web server of the service provider 106 where the web server is configured to allow access to the data storage system 114. Generally, the data storage system 114 may be operated as a service to customers such that customers can use resources of the service provider 106 for the purpose of storing data. Other embodiments also include those in which the data storage system 114 is separate from the service provider 106. The data storage system 114 may, for example, be operated by an entity that is a third party to the service provider 106 and the customer 102, or in some embodiments the data storage system 114 may be a subsystem of the customer 102; that is, a subsystem of a system of the customer 102. It should be noted that terms such as “customer” and “service” provider can have multiple meanings and such meanings are clear from context. For example, the term “customer” may refer to an entity (e.g., a legal entity such as an organization or individual) or a system (e.g., computing device or network of computing devices) that support operations of a customer entity. Similarly, the term “service provider” may refer to a legal entity or a system supporting operations of a service provider entity.
As illustrated in
Destruction of the cryptographic key 110 may be performed by allowing one or more memory locations that store the cryptographic key 110 to be overwritten with other data, such as data received as part of subsequent requests. Other operations may also be performed. For example, if the cryptographic key 110 is stored in volatile or nonvolatile memory, the cryptographic key 110 may be destroyed by overwriting (e.g., via one or more write operations intended to destroy the cryptographic key) one or more memory locations used to store the cryptographic key 110 with other data such as random data or nonrandom data such as a string of zeros. Generally, any operations that will cause the service provider 106 to lose access to the cryptographic key 110 may be used. In this manner, the customer 102 is able to submit requests to the service provider 106 with cryptographic keys that the customer 102 desires to be used to encrypt data 108. Further, because the service provider 106 is, in various embodiments, configured to lose access to the cryptographic key 110 after use of the cryptographic key 110, the customer 102 can be assured that the service provider, upon processing the request 104, is unable to access the data 108 by decrypting the decrypted data 112. In other words, the security of the data 112 is ultimately controlled by the customer 102 with the service provider 106 having access to the data for a limited time.
It should be noted that while various processes resulting in encrypted data (and corresponding decrypting data) are used throughout for the purpose of illustration, the various processes may vary in accordance with other embodiments. For example, example processes for encryption illustrated herein show encryption using a key supplied by a customer of a service provider and where encryption is performed such that after an amount of time the service provider loses access to the key that was used. However, more complex schemes may also be used where more than one key is used to control access to data. For example, referring to
In addition, while various embodiments described herein illustrate requests that have certain types of data, requests may include other types of data. For example, requests my include data for various parameters of the request which may be used by a service provider to determine if, and/or how to, fulfill a request. Generally, requests as discussed herein are simplified for the purpose of illustration. The requests may, for instance, include various contextual data such as an identity of a requestor, a network address from which the request originates, an identity of an entity that generated some or all of the request and/or other types of data.
Further, it should also be noted, that while
When a request is received through the customer interface 202, the request may be received with appropriate authenticating information. For example, as illustrated in
As illustrated in
While not illustrated in the figure, the authentication system 208 or another system operating within or on behalf of the service provider 200 may operate to perform other operations in connection with determining how to process requests. For example, the authentication system 208 or another system operating in cooperation therewith may be used to check one or more policies which may be determinative of whether the request can be fulfilled. Policy determinations may be made based at least in part on various factors such as an identity of the requestor that submitted the request, a time of day, a logical identifier for a location in which data is stored or is to be stored and other contextual information. Policy may be managed through the customer interface 202 or another interface through appropriately-configured application programming interface (API) calls.
Returning to the embodiment illustrated in
Similarly, if the request 204 is a request to retrieve data, a customer interface 202 may transmit a communication to the request processing infrastructure 212 that allows data from one or more of the data storage systems 214 to be provided to the customer interface 202. The customer interface 202 may then use a key provided in the request 204 to decrypt the encrypted data 210 and provide the decrypted data to the customer that submitted the request 204. It should be noted that the environment of the service provider 200 illustrated in
In addition, while
With the cryptographic key having been obtained 402, the process 400 may include generating 404 a request with the obtained cryptographic key; that is, generating a request that includes the obtained cryptographic key. The request may be generated by arranging data for the request in a manner suitable for transmission that is in a format processable by a system to which the request will be submitted. Once generated 404, the generated request may be submitted 406. Submission 406 of the generated request may be performed in any suitable manner such as by transmission to an Internet protocol (IP) address of a webserver configured to receive generated requests. Other operations may be performed, for example, in some embodiments the request is generated from a uniform resource locator (URL). Communication with the domain name service (DNS) may occur to obtain an IP address for the system to which the generated request is then submitted 406. Generally any way of submitting the request may be performed.
Upon submission, a request may be processed by a system to which the generated request was submitted 406. Accordingly, the process 400 may include receiving 408 a response to the request or the response may be an appropriately configured response in accordance with a protocol by which the request was submitted. It should be noted that not all embodiments require receipt of a response to the request. For example, some protocols may allow for the submission of requests without acknowledgement that the request has been received and/or fulfilled. As an illustrative example, the request may be to store data. In some embodiments, upon submission it may be assumed that the request has been processed or likely had been processed where acknowledgement of processing of the request may not be required.
Upon receipt of the request, the process 500 may include determining 504 whether to fulfill the request. The determination 504 whether to fulfill the request may be made in various ways in accordance with various embodiments. For example as noted above, in some instances the request may be received with an electronic signature of the request. Accordingly, a determination may be made by determining whether the signature is valid. Determination of whether the signature is valid may be performed in various ways. For example, the system performing the process 500 may verify the signature itself or may transmit the signature and request (or generally data signed to generate the signature) to another system operable to verify the electronic signature. Further as noted above, determining 504 whether to fulfill the request may include performing a determination whether one or more policies would preclude fulfillment of the request. Generally any way by which a determination of whether to fulfill the request may be performed.
In addition, while
If it is determined, however, to fulfill the request, the process 500 may include extracting 508 a cryptographic key from the request. The extracted cryptographic key may then be used 510 to perform one or more requested cryptographic operations; that is to perform one or more cryptographic operations involved in fulfillment of the request. The one or more cryptographic operations may vary in accordance with various embodiments and in accordance with the type of request that was received. In some embodiments for example, the one or more cryptographic operations include encryption of data included with the request and/or encryption of other data. As another example, the one or more cryptographic operations may include decryption of data referenced by and/or provided in the request. Generally any type of cryptographic operations such as key derivation and/or electronic signature generation and/or verification may be performed as part of the one or more cryptographic operations. Further, while various illustrative embodiments described herein show a single cryptographic operation such as encryption, multiple types of cryptographic operations may be performed while fulfilling a single request. As an example, one or more keys provided in a request may be used to encrypt data and generate an electronic signature of the data and/or encrypted data where the electronic signature can be used for later validation that the data has been changed. Other variations are also considered as being within the scope of the present disclosure.
Upon performance of the one or more cryptographic operations, the process 500 may include providing 512 a response to the request. The response may vary in accordance with the various embodiments and in accordance with the type of request that was made. For example, if the request was to retrieve data, the response may include data that was retrieved and decrypted. If the request was to store data, the response may be an acknowledgement that the data has been stored. A check sum or other validation information may be provided with the response. At some point subsequent to performance of the one or more cryptographic operations involved in fulfillment of the request, the process 500 may include losing 514 access to the extracted cryptographic key where access may be lost in various ways such as described above.
The process 700 may also include storing 716 the encrypted data. The encrypted data may be, for example, transmitted to a data storage system for persistent storage thereof. A response to the request may be provided 718 where the response may include the encrypted encryption key. A system performing the process 700 may lose 720 access to the encryption key such as described above. In this manner, once a system performing the process 700 loses 720 access to the encryption key, the system no longer has the ability to decrypt the encrypted data and generally use of a private key corresponding to the customer public key is necessary to legitimately (i.e., without guessing the key or otherwise obtaining access to the data in an unauthorized manner) decrypt the encrypted data by first decrypting the encryption key in order to decrypt the decrypted data.
It should be noted, as with all processes described herein, variations are considered as being within the scope of the present disclosure. As an example,
As another example of a variation considered as being within the scope of the present disclosure, the encrypted encryption key may be stored with the encrypted data and may or may not be transmitted in a response to the request. In such an embodiment to decrypt the data, the encryption key may be accessed from storage provided to an entity able to decrypt the encryption key (e.g., customer having a private key usable to decrypt the encryption key) which may then provide the decrypted encryption key back to enable decryption of the data. For example, a customer request to retrieve data may cause a provider to transmit an initial response with notification (including the encrypted encryption key) that the encryption key needs decrypting. The customer may decrypt the encryption key and provide the decrypted encryption key back to the provider to enable the provider to decrypt the encrypted data and provide the decrypted data to the customer. Other variations, including variations where ciphertext is provided to the customer from the provider along with an encrypted key usable to decrypt the ciphertext, are also considered as being within the scope of the present disclosure. For embodiments where, for example, server side encryption is used to PUT requests but client side encryption is used to obtain access to stored data, a provider may provide instructions for properly processing data (e.g., by properly canonicalizing data for decryption) or may provide executable instructions in the form of a client library to ensure that decryption is performed correctly (i.e., to ensure that decryption is performed in a manner that will succeed in decrypting the data).
A private key corresponding to a public key used to encrypt the encryption key may be used 804 to decrypt the encrypted encryption key. Once the decrypted encryption key has been obtained, the process 800 may include generating 806 a GET request with the decrypted encryption key and submitting (e.g., transmitting) 808 the generated GET request, such as described above. A system that receives the GET request may process the request by using the encryption key in the request to decrypt data that was encrypted by the encryption key. A response may then be received 810 where the response may include appropriate information such as data that has been decrypted using the decrypted encryption key that was provided in the GET request.
As with all processes described herein, variations of the process 800 are considered to be within the scope of the present disclosure. For example, the encrypted encryption key may be obtained by accessing the encrypted encryption key from remote storage when the encrypted encryption key is stored with the data that is encrypted under the encrypted encryption key. As another example, in some embodiments the process 800 may include submitting a GET request that is fulfilled by providing data encrypted under the encrypted encryption key. A system performing the process 800 may obtain the encrypted data and use the decrypted encryption key to decrypt the encrypted data. In other words, the process 800 may be modified so that data is decrypted client-side even if the data was encrypted server-side.
As noted above, numerous embodiments are considered as being within in the scope of the present disclosure. In some embodiments, a customer and service provider are able to interact to achieve data security without use of a third party system to unwrap a key needed for cryptographic operations.
A key usable to unwrap the cryptographic key may be obtained 1210. Obtaining the key usable to unwrap the cryptographic key may be performed in various ways in accordance with various embodiments. For example, the key usable to unwrap the wrapped cryptographic key may be stored by a system that performs the process 1200. An identifier of the key usable to unwrap the wrapped cryptographic key may be used to locate the key usable to unwrap the wrapped cryptographic key from other keys which may be stored by the system. The identifier may be provided in the request that was received 1202 or may be otherwise determined such as by an association with an entity that submitted the request. Once the key usable to unwrap the wrapped cryptographic key has been obtained 1210, the process 1200 may include using 1212 the obtained key to unwrap the wrapped cryptographic key. In this manner, an unwrapped cryptographic key is obtained. The unwrapped cryptographic key may be used 1214 to perform one or more cryptographic operations involved in fulfillment of the request that was received 1202. A response to the request may be provided 1216 such as described above and access to the unwrapped cryptographic key may be lost 1218.
In some embodiments, as noted, involvement of a third party is part of maintaining data security.
The key management system 1310 may be implemented in various ways in accordance with various embodiments. In some embodiments, the key management system is a subsystem of the service provider 1306 which may be implemented by, for instance, a hardware security module (HSM) hosted by the service provider 1306 or another type of security module that securely stores cryptographic keys. In some embodiments, the key management system 1310 is implemented as another service of the service provider 1306 which may be one of several services provided by the service provider 1306 and accessible to customer 1302 over a network such as described below. In some embodiments, the key management system is a system such as described above, however, implemented by a third party to the service provider 1306 and customer 1302. In such embodiments, neither the customer 1302 nor the service provider 1306 has access to the key usable to unwrap the encryption key 1308 unless the key 1312 usable to unwrap the encryption key is shared with one or more of the customer 1302 or service provider 1306. Other variations are also considered as being within the scope of the present disclosure. For example, the key management system 1310 may be implemented as part of the customer 1302 in some embodiments. Generally, the key management system 1310 is a system with which the service provider 1306 must communicate in order to unwrap or generally cause to have unwrapped the encryption key 1308 using the key 1312 usable to unwrap the encryption key. Communication between the service provider 1306 and the key management system 1310 may occur over one or more networks and in accordance with one or more appropriate network protocols. The network may be, for example, the Internet or any suitable network such as described below.
The wrapped cryptographic key may be transmitted in the form of a request to the unwrapping system which is appropriately configured for fulfillment by the unwrapping system. For example, the request may be formatted in accordance with a format acceptable to the unwrapping system and the request may include information usable by the unwrapping system to determine whether to fulfill the request. Such information may include, for example, authentication information used to authenticate the request to the unwrapping system and/or the request that was received 1402 with the wrapped cryptographic key. Other information which may be used, for example, to determine whether fulfillment of the request to the unwrapping system complies with one or more policies may also be provided or the information may be contextual information such as described above. Additional information may include an identifier of a key usable to unwrap the wrapped cryptographic key. Assuming that the unwrapping system fulfills the request that was transmitted 1410, the process 1400 may include receiving 1412 the unwrapped cryptographic key from the unwrapping system. The unwrapped cryptographic key may be used 1414 to perform one or more cryptographic operations involved in fulfillment of the request that was received 1402. As response to the request may be provided 1416 such as described above and access to the unwrapped cryptographic key may be lost 1418, such as described above.
As noted several times throughout the above disclosure, numerous variations are considered as being within the scope of the present disclosure. For example, as discussed, numerous variations utilize symmetric and/or asymmetric cryptographic primitives. Symmetric key algorithms may include various schemes for performing cryptographic operations on data including block ciphers, stream ciphers and digital signature schemes. Example symmetric key algorithms include, but are not limited to, the advanced encryption standard (AES), the data encryption standard (DES), triple DES (3DES), Serpent, Twofish, blowfish, CASTS, RC4 and the international data encryption algorithm (IDEA). Symmetric key algorithms may also include those used to generate output of one way functions and include, but are not limited to algorithms that utilize hash-based message authentication codes (HMACs), message authentication codes (MACs) in general, PBKDF2 and Bcrypt. Asymmetric key algorithms may also include various schemes for performing cryptographic operations on data. Example algorithms include, but are not limited to those that utilize the Diffie-Hellman key exchange protocol, the digital signature standard (DSS), the digital signature algorithm, the ElGamal algorithm, various elliptic curve algorithms, password-authenticated key agreement techniques, the pallier cryptosystem, the RSA encryption algorithm (PKCS #1), the Cramer-Shoup cryptosystem, the YAK authenticated key agreement protocol, the NTRUEncrypt cryptosystem, the McEliece cryptosystem, and others. Elliptic curve algorithms include the elliptic curve Diffie-Hellman (ECDH) key agreement scheme, the Elliptic Curve Integrated Encryption Scheme (ECIES), the Elliptic Curve Digital Signature Algorithm (ECDSA), the ECMQV key agreement scheme and the ECQV implicit certificate scheme. Other algorithms and combinations of algorithms are also considered as being within the scope of the present disclosure.
In addition, as noted, various embodiments of the present disclosure relate to the use of cryptographic keys included in requests to perform various cryptographic operations. While the keys are discussed as being used to perform the operations, it should be noted that various embodiments of the present disclosure include those where keys are transformed in some way before being used. As an example, in cases where a key in a request is a passcode, the passcode may be transformed (e.g., with a key derivation function) before being used to perform additional cryptographic operations. Further, while the above disclosure discusses specific types of keys (e.g., encryption keys) such keys may similarly be transformed before use. Other variations include those where multiple keys are provided in requests and request parameters and/or formatting of the request indicate how the multiple keys should be used.
Other variations considered as being within the scope of the present disclosure include embodiments that utilize pre-signed uniform resource locators (URLs). Referring to environments such as illustrated in
The illustrative environment includes at least one application server 1508 and a data store 1510. It should be understood that there can be several application servers, layers or other elements, processes or components, which may be chained or otherwise configured, which can interact to perform tasks such as obtaining data from an appropriate data store. Servers, as used herein, may be implemented in various ways, such as hardware devices or virtual computer systems. In some contexts, servers may refer to a programming module being executed on a computer system. As used herein the term “data store” refers to any device or combination of devices capable of storing, accessing and retrieving data, which may include any combination and number of data servers, databases, data storage devices and data storage media, in any standard, distributed or clustered environment. The application server can include any appropriate hardware and software for integrating with the data store as needed to execute aspects of one or more applications for the client device, handling some (even a majority) of the data access and business logic for an application. The application server may provide access control services in cooperation with the data store and is able to generate content such as text, graphics, audio and/or video to be transferred to the user, which may be served to the user by the web server in the form of HyperText Markup Language (“HTML”), Extensible Markup Language (“XML”) or another appropriate structured language in this example. The handling of all requests and responses, as well as the delivery of content between the client device 1502 and the application server 1508, can be handled by the web server. It should be understood that the web and application servers are not required and are merely example components, as structured code discussed herein can be executed on any appropriate device or host machine as discussed elsewhere herein. Further, operations described herein as being performed by a single device may, unless otherwise clear from context, be performed collectively by multiple devices, which may form a distributed system.
The data store 1510 can include several separate data tables, databases or other data storage mechanisms and media for storing data relating to a particular aspect of the present disclosure. For example, the data store illustrated may include mechanisms for storing production data 1512 and user information 1516, which can be used to serve content for the production side. The data store also is shown to include a mechanism for storing log data 1514, which can be used for reporting, analysis or other such purposes. It should be understood that there can be many other aspects that may need to be stored in the data store, such as page image information and access rights information, which can be stored in any of the above listed mechanisms as appropriate or in additional mechanisms in the data store 1510. The data store 1510 is operable, through logic associated therewith, to receive instructions from the application server 1508 and obtain, update or otherwise process data in response thereto. In one example, a user, through a device operated by the user, might submit a search request for a certain type of item. In this case, the data store might access the user information to verify the identity of the user and can access the catalog detail information to obtain information about items of that type. The information then can be returned to the user, such as in a results listing on a web page that the user is able to view via a browser on the user device 1502. Information for a particular item of interest can be viewed in a dedicated page or window of the browser. It should be noted, however, that embodiments of the present disclosure are not necessarily limited to the context of web pages, but may be more generally applicable to processing requests in general, where the requests are not necessarily requests for content.
Each server typically will include an operating system that provides executable program instructions for the general administration and operation of that server and typically will include a computer-readable storage medium (e.g., a hard disk, random access memory, read only memory, etc.) storing instructions that, when executed by a processor of the server, allow the server to perform its intended functions. Suitable implementations for the operating system and general functionality of the servers are known or commercially available and are readily implemented by persons having ordinary skill in the art, particularly in light of the disclosure herein.
The environment in one embodiment is a distributed computing environment utilizing several computer systems and components that are interconnected via communication links, using one or more computer networks or direct connections. However, it will be appreciated by those of ordinary skill in the art that such a system could operate equally well in a system having fewer or a greater number of components than are illustrated in
The various embodiments further can be implemented in a wide variety of operating environments, which in some cases can include one or more user computers, computing devices or processing devices which can be used to operate any of a number of applications. User or client devices can include any of a number of general purpose personal computers, such as desktop, laptop or tablet computers running a standard operating system, as well as cellular, wireless and handheld devices running mobile software and capable of supporting a number of networking and messaging protocols. Such a system also can include a number of workstations running any of a variety of commercially-available operating systems and other known applications for purposes such as development and database management. These devices also can include other electronic devices, such as dummy terminals, thin-clients, gaming systems and other devices capable of communicating via a network.
Various embodiments of the present disclosure utilize at least one network that would be familiar to those skilled in the art for supporting communications using any of a variety of commercially-available protocols, such as Transmission Control Protocol/Internet Protocol (“TCP/IP”), protocols operating in various layers of the Open System Interconnection (“OSI”) model, File Transfer Protocol (“FTP”), Universal Plug and Play (“UpnP”), Network File System (“NFS”), Common Internet File System (“CIFS”) and AppleTalk. The network can be, for example, a local area network, a wide-area network, a virtual private network, the Internet, an intranet, an extranet, a public switched telephone network, an infrared network, a wireless network and any combination thereof.
In embodiments utilizing a web server, the web server can run any of a variety of server or mid-tier applications, including Hypertext Transfer Protocol (“HTTP”) servers, FTP servers, Common Gateway Interface (“CGP”) servers, data servers, Java servers and business application servers. The server(s) also may be capable of executing programs or scripts in response to requests from user devices, such as by executing one or more web applications that may be implemented as one or more scripts or programs written in any programming language, such as Java®, C, C# or C++, or any scripting language, such as Perl, Python or TCL, as well as combinations thereof. The server(s) may also include database servers, including without limitation those commercially available from Oracle®, Microsoft®, Sybase® and IBM®.
The environment can include a variety of data stores and other memory and storage media as discussed above. These can reside in a variety of locations, such as on a storage medium local to (and/or resident in) one or more of the computers or remote from any or all of the computers across the network. In a particular set of embodiments, the information may reside in a storage-area network (“SAN”) familiar to those skilled in the art. Similarly, any necessary files for performing the functions attributed to the computers, servers or other network devices may be stored locally and/or remotely, as appropriate. Where a system includes computerized devices, each such device can include hardware elements that may be electrically coupled via a bus, the elements including, for example, at least one central processing unit (“CPU” or “processor”), at least one input device (e.g., a mouse, keyboard, controller, touch screen or keypad) and at least one output device (e.g., a display device, printer or speaker). Such a system may also include one or more storage devices, such as disk drives, optical storage devices and solid-state storage devices such as random access memory (“RAM”) or read-only memory (“ROM”), as well as removable media devices, memory cards, flash cards, etc.
Such devices also can include a computer-readable storage media reader, a communications device (e.g., a modem, a network card (wireless or wired), an infrared communication device, etc.) and working memory as described above. The computer-readable storage media reader can be connected with, or configured to receive, a computer-readable storage medium, representing remote, local, fixed and/or removable storage devices as well as storage media for temporarily and/or more permanently containing, storing, transmitting and retrieving computer-readable information. The system and various devices also typically will include a number of software applications, modules, services or other elements located within at least one working memory device, including an operating system and application programs, such as a client application or web browser. It should be appreciated that alternate embodiments may have numerous variations from that described above. For example, customized hardware might also be used and/or particular elements might be implemented in hardware, software (including portable software, such as applets) or both. Further, connection to other computing devices such as network input/output devices may be employed.
Storage media and computer readable media for containing code, or portions of code, can include any appropriate media known or used in the art, including storage media and communication media, such as, but not limited to, volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage and/or transmission of information such as computer readable instructions, data structures, program modules or other data, including RAM, ROM, Electrically Erasable Programmable Read-Only Memory (“EEPROM”), flash memory or other memory technology, Compact Disc Read-Only Memory (“CD-ROM”), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices or any other medium which can be used to store the desired information and which can be accessed by the system device. Based on the disclosure and teachings provided herein, a person of ordinary skill in the art will appreciate other ways and/or methods to implement the various embodiments.
The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that various modifications and changes may be made thereunto without departing from the broader spirit and scope of the invention as set forth in the claims.
Other variations are within the spirit of the present disclosure. Thus, while the disclosed techniques are susceptible to various modifications and alternative constructions, certain illustrated embodiments thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the invention to the specific form or forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions and equivalents falling within the spirit and scope of the invention, as defined in the appended claims.
The use of the terms “a” and “an” and “the” and similar referents in the context of describing the disclosed embodiments (especially in the context of the following claims) are to be construed to cover both the singular and the plural, unless otherwise indicated herein or clearly contradicted by context. The terms “comprising,” “having,” “including” and “containing” are to be construed as open-ended terms (i.e., meaning “including, but not limited to,”) unless otherwise noted. The term “connected,” when unmodified and referring to physical connections, is to be construed as partly or wholly contained within, attached to or joined together, even if there is something intervening. Recitation of ranges of values herein are merely intended to serve as a shorthand method of referring individually to each separate value falling within the range, unless otherwise indicated herein and each separate value is incorporated into the specification as if it were individually recited herein. The use of the term “set” (e.g., “a set of items”) or “subset” unless otherwise noted or contradicted by context, is to be construed as a nonempty collection comprising one or more members. Further, unless otherwise noted or contradicted by context, the term “subset” of a corresponding set does not necessarily denote a proper subset of the corresponding set, but the subset and the corresponding set may be equal.
Conjunctive language, such as phrases of the form “at least one of A, B, and C,” or “at least one of A, B and C,” unless specifically stated otherwise or otherwise clearly contradicted by context, is otherwise understood with the context as used in general to present that an item, term, etc., may be either A or B or C, or any nonempty subset of the set of A and B and C. For instance, in the illustrative example of a set having three members used in the above conjunctive phrase, “at least one of A, B, and C” and “at least one of A, B and C” refers to any of the following sets: {A}, {B}, {C}, {A, B}, {A, C}, {B, C}, {A, B, C}. Thus, such conjunctive language is not generally intended to imply that certain embodiments require at least one of A, at least one of B and at least one of C to each be present.
Operations of processes described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. Processes described herein (or variations and/or combinations thereof) may be performed under the control of one or more computer systems configured with executable instructions and may be implemented as code (e.g., executable instructions, one or more computer programs or one or more applications) executing collectively on one or more processors, by hardware or combinations thereof. The code may be stored on a computer-readable storage medium, for example, in the form of a computer program comprising a plurality of instructions executable by one or more processors. The computer-readable storage medium may be non-transitory.
The use of any and all examples, or exemplary language (e.g., “such as”) provided herein, is intended merely to better illuminate embodiments of the invention and does not pose a limitation on the scope of the invention unless otherwise claimed. No language in the specification should be construed as indicating any non-claimed element as essential to the practice of the invention.
Preferred embodiments of this disclosure are described herein, including the best mode known to the inventors for carrying out the invention. Variations of those preferred embodiments may become apparent to those of ordinary skill in the art upon reading the foregoing description. The inventors expect skilled artisans to employ such variations as appropriate and the inventors intend for embodiments of the present disclosure to be practiced otherwise than as specifically described herein. Accordingly, the scope of the present disclosure includes all modifications and equivalents of the subject matter recited in the claims appended hereto as permitted by applicable law. Moreover, any combination of the above-described elements in all possible variations thereof is encompassed by the scope of the present disclosure unless otherwise indicated herein or otherwise clearly contradicted by context.
All references, including publications, patent applications and patents, cited herein are hereby incorporated by reference to the same extent as if each reference were individually and specifically indicated to be incorporated by reference and were set forth in its entirety herein.
This application is a continuation of U.S. patent application Ser. No. 16/048,126, filed on Jul. 27, 2018, which is a continuation of U.S. patent application Ser. No. 15/090,315, filed on Apr. 4, 2016, issued as U.S. Pat. No. 10,037,428, entitled “DATA SECURITY USING REQUEST-SUPPLIED KEYS,” which is a continuation of U.S. patent application Ser. No. 14/037,292, filed on Sep. 25, 2013, issued as U.S. Pat. No. 9,311,500, entitled “DATA SECURITY USING REQUEST-SUPPLIED KEYS,” the content of which are incorporated by reference herein in their entirety. This application also incorporates by reference for all purposes the full disclosure of U.S. patent application Ser. No. 14/037,282, filed Sep. 25, 2013, issued as U.S. Pat. No. 9,237,019, entitled “RESOURCE LOCATORS WITH KEYS.”
Number | Name | Date | Kind |
---|---|---|---|
5179591 | Hardy et al. | Jan 1993 | A |
5200999 | Matyas et al. | Apr 1993 | A |
5497421 | Kaufman et al. | Mar 1996 | A |
6044155 | Thomlinson et al. | Mar 2000 | A |
6084969 | Wright et al. | Jul 2000 | A |
6097817 | Bilgic et al. | Aug 2000 | A |
6185316 | Buffam | Feb 2001 | B1 |
6453416 | Epstein | Sep 2002 | B1 |
6760711 | Gillett et al. | Jul 2004 | B1 |
6826686 | Peyravian et al. | Nov 2004 | B1 |
6851054 | Wheeler et al. | Feb 2005 | B2 |
6957393 | Fano et al. | Oct 2005 | B2 |
6959394 | Brickell et al. | Oct 2005 | B1 |
6985583 | Brainard et al. | Jan 2006 | B1 |
7010689 | Matyas et al. | Mar 2006 | B1 |
7073195 | Brickell et al. | Jul 2006 | B2 |
7139917 | Jablon | Nov 2006 | B2 |
7228417 | Roskind | Jun 2007 | B2 |
7320076 | Caronni | Jan 2008 | B2 |
7512965 | Amdur et al. | Mar 2009 | B1 |
7685430 | Masurkar | Mar 2010 | B1 |
7721322 | Sastry et al. | May 2010 | B2 |
7757271 | Amdur et al. | Jul 2010 | B2 |
7765584 | Roskind | Jul 2010 | B2 |
7836306 | Pyle et al. | Nov 2010 | B2 |
7890767 | Smith et al. | Feb 2011 | B2 |
7913084 | Medvinsky et al. | Mar 2011 | B2 |
7917764 | Futa | Mar 2011 | B2 |
8006289 | Hinton et al. | Aug 2011 | B2 |
8024562 | Gentry et al. | Sep 2011 | B2 |
8041954 | Plesman | Oct 2011 | B2 |
8059820 | Malaviarachchi et al. | Nov 2011 | B2 |
8151116 | Van der Horst et al. | Apr 2012 | B2 |
8275356 | Hickie | Sep 2012 | B2 |
8332922 | Dickinson et al. | Dec 2012 | B2 |
8370638 | Duane et al. | Feb 2013 | B2 |
8386800 | Kocher et al. | Feb 2013 | B2 |
8387117 | Eom et al. | Feb 2013 | B2 |
8418222 | Gbadegesin et al. | Apr 2013 | B2 |
8423759 | Moreau | Apr 2013 | B2 |
8453198 | Band et al. | May 2013 | B2 |
8464058 | Chen et al. | Jun 2013 | B1 |
8464354 | Teow et al. | Jun 2013 | B2 |
8533772 | Garg et al. | Sep 2013 | B2 |
8543916 | Anderson et al. | Sep 2013 | B2 |
8561152 | Novak et al. | Oct 2013 | B2 |
8601600 | Shankar | Dec 2013 | B1 |
8621561 | Cross et al. | Dec 2013 | B2 |
8688813 | Maes | Apr 2014 | B2 |
8695075 | Anderson et al. | Apr 2014 | B2 |
8739308 | Roth | May 2014 | B1 |
8745205 | Anderson et al. | Jun 2014 | B2 |
8769289 | Kronrod | Jul 2014 | B1 |
8776190 | Cavage et al. | Jul 2014 | B1 |
8776204 | Faynberg et al. | Jul 2014 | B2 |
8793774 | Kumar et al. | Jul 2014 | B1 |
8868923 | Hamlet et al. | Oct 2014 | B1 |
8892865 | Roth | Nov 2014 | B1 |
8977857 | Triscon | Mar 2015 | B1 |
8997198 | Kelley et al. | Mar 2015 | B1 |
9294479 | Koulomzin | Mar 2016 | B1 |
9369288 | Cureau et al. | Jun 2016 | B1 |
9819654 | Roth et al. | Nov 2017 | B2 |
20010008013 | Johnson et al. | Jul 2001 | A1 |
20010018739 | Anderson et al. | Aug 2001 | A1 |
20020016840 | Herzog et al. | Feb 2002 | A1 |
20020067832 | Jablon | Jun 2002 | A1 |
20020083178 | Brothers | Jun 2002 | A1 |
20020112181 | Smith | Aug 2002 | A1 |
20020161723 | Asokan et al. | Oct 2002 | A1 |
20020161998 | Cromer et al. | Oct 2002 | A1 |
20020162019 | Berry et al. | Oct 2002 | A1 |
20020194483 | Wenocur et al. | Dec 2002 | A1 |
20020198848 | Michener | Dec 2002 | A1 |
20030014503 | Legout et al. | Jan 2003 | A1 |
20030016826 | Asano et al. | Jan 2003 | A1 |
20030041110 | Wenocur et al. | Feb 2003 | A1 |
20030135740 | Talmor et al. | Jul 2003 | A1 |
20030145197 | Lee et al. | Jul 2003 | A1 |
20030149781 | Yared et al. | Aug 2003 | A1 |
20030188117 | Yoshino et al. | Oct 2003 | A1 |
20040088260 | Foster et al. | May 2004 | A1 |
20040103096 | Larsen | May 2004 | A1 |
20040128505 | Larsen | Jul 2004 | A1 |
20040128510 | Larsen | Jul 2004 | A1 |
20040131185 | Kakumer | Jul 2004 | A1 |
20040143733 | Ophir et al. | Jul 2004 | A1 |
20040158734 | Larsen | Aug 2004 | A1 |
20040172535 | Jakobsson et al. | Sep 2004 | A1 |
20050036611 | Seaton et al. | Feb 2005 | A1 |
20050043999 | Ji et al. | Feb 2005 | A1 |
20050060580 | Chebolu et al. | Mar 2005 | A1 |
20050080914 | Lerner et al. | Apr 2005 | A1 |
20050132192 | Jeffries et al. | Jun 2005 | A1 |
20050132215 | Wang et al. | Jun 2005 | A1 |
20050166263 | Nanopoulos et al. | Jul 2005 | A1 |
20050235148 | Scheidt et al. | Oct 2005 | A1 |
20050273862 | Benaloh et al. | Dec 2005 | A1 |
20050278547 | Hyndman et al. | Dec 2005 | A1 |
20060070116 | Park | Mar 2006 | A1 |
20060075462 | Golan et al. | Apr 2006 | A1 |
20060094406 | Cortegiano | May 2006 | A1 |
20060094410 | Cortegiano | May 2006 | A1 |
20060100928 | Waleczak, Jr. et al. | May 2006 | A1 |
20060130100 | Pentland | Jun 2006 | A1 |
20060149677 | Shahine et al. | Jul 2006 | A1 |
20060174125 | Brookner | Aug 2006 | A1 |
20060190331 | Tollinger et al. | Aug 2006 | A1 |
20060206440 | Anderson et al. | Sep 2006 | A1 |
20060206925 | Dillaway et al. | Sep 2006 | A1 |
20060218625 | Pearson et al. | Sep 2006 | A1 |
20060230284 | Fiske | Oct 2006 | A1 |
20060256961 | Brainard et al. | Nov 2006 | A1 |
20060271785 | Holtmanns et al. | Nov 2006 | A1 |
20060282878 | Stanley et al. | Dec 2006 | A1 |
20070005955 | Pyle et al. | Jan 2007 | A1 |
20070033396 | Zhang et al. | Feb 2007 | A1 |
20070037552 | Lee et al. | Feb 2007 | A1 |
20070061571 | Hammes et al. | Mar 2007 | A1 |
20070061885 | Hammes et al. | Mar 2007 | A1 |
20070136361 | Lee et al. | Jun 2007 | A1 |
20070157309 | Bin et al. | Jul 2007 | A1 |
20070174614 | Duane et al. | Jul 2007 | A1 |
20070186102 | Ng | Aug 2007 | A1 |
20070234410 | Geller | Oct 2007 | A1 |
20070250706 | Oba | Oct 2007 | A1 |
20070277231 | Medvinsky et al. | Nov 2007 | A1 |
20080010665 | Hinton et al. | Jan 2008 | A1 |
20080040773 | AlBadarin et al. | Feb 2008 | A1 |
20080066150 | Lim | Mar 2008 | A1 |
20080080718 | Meijer et al. | Apr 2008 | A1 |
20080083036 | Ozzie et al. | Apr 2008 | A1 |
20080109657 | Bajaj et al. | May 2008 | A1 |
20080163337 | Tulani et al. | Jul 2008 | A1 |
20080168530 | Kuehr-McLaren et al. | Jul 2008 | A1 |
20080182592 | Cha et al. | Jul 2008 | A1 |
20080222694 | Nakae | Sep 2008 | A1 |
20080244006 | Weisner et al. | Oct 2008 | A1 |
20080301444 | Kim et al. | Dec 2008 | A1 |
20080301630 | Arnold et al. | Dec 2008 | A1 |
20080313719 | Kaliski, Jr. et al. | Dec 2008 | A1 |
20090013402 | Plesman | Jan 2009 | A1 |
20090019134 | Bellifemine et al. | Jan 2009 | A1 |
20090049518 | Roman et al. | Feb 2009 | A1 |
20090172793 | Newstadt et al. | Jul 2009 | A1 |
20090204808 | Guo et al. | Aug 2009 | A1 |
20090210712 | Fort | Aug 2009 | A1 |
20090217385 | Teow et al. | Aug 2009 | A1 |
20090254572 | Redlich et al. | Oct 2009 | A1 |
20090320093 | Glazier et al. | Dec 2009 | A1 |
20100017603 | Jones | Jan 2010 | A1 |
20100037304 | Canning et al. | Feb 2010 | A1 |
20100058060 | Schneider | Mar 2010 | A1 |
20100058072 | Teow et al. | Mar 2010 | A1 |
20100071056 | Cheng | Mar 2010 | A1 |
20100083001 | Shah et al. | Apr 2010 | A1 |
20100111296 | Brown et al. | May 2010 | A1 |
20100125894 | Yasrebi et al. | May 2010 | A1 |
20100131756 | Schneider | May 2010 | A1 |
20100142704 | Camenisch et al. | Jun 2010 | A1 |
20100205649 | Becker et al. | Aug 2010 | A1 |
20100239095 | Carter et al. | Sep 2010 | A1 |
20100251347 | Roskind | Sep 2010 | A1 |
20100269156 | Hohlfeld et al. | Oct 2010 | A1 |
20100290476 | Brindle et al. | Nov 2010 | A1 |
20100332845 | Asaka | Dec 2010 | A1 |
20110004753 | Gomi et al. | Jan 2011 | A1 |
20110010538 | Falk et al. | Jan 2011 | A1 |
20110035593 | Pyle et al. | Feb 2011 | A1 |
20110055562 | Adeiman et al. | Mar 2011 | A1 |
20110055585 | Lee | Mar 2011 | A1 |
20110078107 | Almeida et al. | Mar 2011 | A1 |
20110083015 | Meier | Apr 2011 | A1 |
20110099362 | Haga et al. | Apr 2011 | A1 |
20110131415 | Schneider | Jun 2011 | A1 |
20110138192 | Kocher et al. | Jun 2011 | A1 |
20110167479 | Maes | Jul 2011 | A1 |
20110179469 | Blinn et al. | Jul 2011 | A1 |
20110231940 | Perumal et al. | Sep 2011 | A1 |
20110239283 | Chern | Sep 2011 | A1 |
20110252229 | Belenkiy et al. | Oct 2011 | A1 |
20110264907 | Betz et al. | Oct 2011 | A1 |
20110265172 | Sharma et al. | Oct 2011 | A1 |
20110296497 | Becker | Dec 2011 | A1 |
20110311055 | Parann-Nissany | Dec 2011 | A1 |
20110320606 | Madduri et al. | Dec 2011 | A1 |
20120017095 | Blenkhorn et al. | Jan 2012 | A1 |
20120020474 | Kudoh et al. | Jan 2012 | A1 |
20120023334 | Brickell et al. | Jan 2012 | A1 |
20120036551 | Le Saint et al. | Feb 2012 | A1 |
20120054625 | Pugh et al. | Mar 2012 | A1 |
20120060035 | Kalmady et al. | Mar 2012 | A1 |
20120079288 | Hars | Mar 2012 | A1 |
20120106735 | Fukuda | May 2012 | A1 |
20120110636 | Van Biljon et al. | May 2012 | A1 |
20120144034 | McCarty | Jun 2012 | A1 |
20120159577 | Belinkly et al. | Jun 2012 | A1 |
20120233216 | Lim | Sep 2012 | A1 |
20120243687 | Li et al. | Sep 2012 | A1 |
20120245978 | Jain et al. | Sep 2012 | A1 |
20120265690 | Bishop et al. | Oct 2012 | A1 |
20120317414 | Glover | Dec 2012 | A1 |
20120331284 | Kouladjie et al. | Dec 2012 | A1 |
20130031255 | Maloy et al. | Jan 2013 | A1 |
20130086662 | Roth | Apr 2013 | A1 |
20130086663 | Roth et al. | Apr 2013 | A1 |
20130111217 | Kopasz et al. | May 2013 | A1 |
20130132232 | Pestoni et al. | May 2013 | A1 |
20130145447 | Maron | Jun 2013 | A1 |
20130166906 | Swaminathan et al. | Jun 2013 | A1 |
20130166918 | Shahbazi et al. | Jun 2013 | A1 |
20130191884 | Leicher et al. | Jul 2013 | A1 |
20130198519 | Marien | Aug 2013 | A1 |
20130247218 | Jhingan et al. | Sep 2013 | A1 |
20130254536 | Glover | Sep 2013 | A1 |
20130282461 | Ovick et al. | Oct 2013 | A1 |
20130318630 | Lam | Nov 2013 | A1 |
20140013409 | Halageri | Jan 2014 | A1 |
20140082715 | Grajek et al. | Mar 2014 | A1 |
20140122866 | Haeger et al. | May 2014 | A1 |
20140181925 | Smith | Jun 2014 | A1 |
20140208408 | Bilgen et al. | Jul 2014 | A1 |
20140281477 | Nayshtut et al. | Sep 2014 | A1 |
20140281487 | Klausen et al. | Sep 2014 | A1 |
20150082039 | Stalzer et al. | Mar 2015 | A1 |
20150089233 | Roth et al. | Mar 2015 | A1 |
20150089614 | Mathew et al. | Mar 2015 | A1 |
Number | Date | Country |
---|---|---|
1470972 | Jan 2004 | CN |
101297300 | Oct 2008 | CN |
101448130 | Jun 2009 | CN |
101485137 | Jul 2009 | CN |
101938461 | Jan 2011 | CN |
101938461 | Jan 2011 | CN |
102624737 | Aug 2012 | CN |
102624737 | Aug 2012 | CN |
0940960 | Sep 1999 | EP |
0940960 | Sep 1999 | EP |
1357458 | Oct 2003 | EP |
1357458 | Oct 2003 | EP |
3050249 | Aug 2016 | EP |
3050257 | Jun 2019 | EP |
3611873 | Feb 2020 | EP |
2001356952 | Jan 2001 | JP |
2001202452 | Jul 2001 | JP |
2001202452 | Jul 2001 | JP |
2001356952 | Dec 2001 | JP |
2002190795 | Jul 2002 | JP |
2002190795 | Jul 2002 | JP |
2003242124 | Aug 2003 | JP |
2003242124 | Aug 2003 | JP |
2004193921 | Jul 2004 | JP |
2004193921 | Jul 2004 | JP |
2004242124 | Aug 2004 | JP |
2005197912 | Jul 2005 | JP |
2006128873 | May 2006 | JP |
2007053658 | Mar 2007 | JP |
2007214757 | Aug 2007 | JP |
2007214757 | Aug 2007 | JP |
2009534724 | Sep 2009 | JP |
2009534724 | Sep 2009 | JP |
2009534727 | Sep 2009 | JP |
2009534727 | Sep 2009 | JP |
2011008701 | Jan 2011 | JP |
2011054028 | Mar 2011 | JP |
2011211537 | Oct 2011 | JP |
2011211537 | Oct 2011 | JP |
20060091548 | Aug 2006 | KR |
WO2006077822 | Jul 2006 | WO |
WO2008024705 | Feb 2008 | WO |
WO2008089276 | Jul 2008 | WO |
2010040010 | Apr 2010 | WO |
WO2010040010 | Apr 2010 | WO |
WO2014063361 | May 2014 | WO |
2015048039 | Apr 2015 | WO |
Entry |
---|
China National Intellectual Property Administration 3rd Office Action in Application No. 201910495865.2 issued Sep. 1, 2022; 10 pages. |
Japanese Patent Office 2nd Office Action in Application No. 2020-181042; Nov. 8, 2022; 8 pages. |
Japanese Patent Office Decision to Grant Application No. 2020-126140 Oct. 3, 2022; 3 pages. |
Canada Office Action for Patent Application No. 2923438 dated Mar. 30, 2022, 8 pages. |
Chinese First Office Action for Patent Application No. 202010034368.5 dated Dec. 3, 2021, 14 pages. |
Chinese Second Office Action for Patent Application No. 201910495865.2 dated Mar. 2, 2022, 14 pages. |
European Communication Article 94(3) for Patent Application No. 19197540.8 dated Nov. 3, 2021, 7 pages. |
European Search Report for Patent Application No. 22155709.3 dated Apr. 26, 2022, 8 pages. |
Hwang et al., “A Business Model for Cloud Computing Based on a Separate Encryption and Decryption Service,” IEEE Information Science and Applications, Apr. 26, 2011, 7 pages. |
Japanese Decision to Grant for Patent Application No. 2018-078782 dated Dec. 13, 2021, 3 pages. |
Japanese Office Action for Patent Application No. 2020-181042 dated Dec. 22, 2021, 12 pages. |
Amazon, “Amazon Prime Video—security considerations,” Amazon.com General Help Forum, http://www.amazon.com/gp/help/customer/forums?ie=UTF8&cdForum=Fx2NFGOONPZEXIP&cdPage=1&cdSort=newest&cdThread=Tx18VZVGGU0Y32, latest reply Jun. 17, 2013, 3 pages. |
Berners-Lee et al., ““Uniform Resource Identifier (URI): Generic Syntax,”” Network Working Group Request for Comments: 3986, The Internet Society 2005. |
Canadian Office Action dated Oct. 30, 2018, for Patent Application No. 2,923,438, 6 pages. |
Canadian Office Action for Patent Application No. 2,923,437 dated Dec. 8, 2020, 4 pages. |
Canadian Office Action for Patent Application No. 2,923,437 dated Mar. 13, 2019, 3 pages. |
Canadian Office Action for Patent Application No. 2,923,437 dated Mar. 27, 2018, 4 pages. |
Canadian Office Action for Patent Application No. 2,923,438 dated Jun. 4, 2021, 9 pages. |
Canadian Office Action for Patent Application No. 2,923,438 dated Sep. 30, 2019, 3 pages. |
Canadian Office Action for Patent Application No. 2,923,438, dated Nov. 22, 2017, 4 pages. |
Canadian Office Action for Patent Application No. 2923437 dated Feb. 19, 2020, 4 pages. |
Canadian Office Action for Patent Application No. 2923437 dated Oct. 7, 2021, 3 pages. |
Canadian Office Action for Patent Application No. 2923438 dated Aug. 20, 2020, 4 pages. |
Chinese Decision to Grant for Patent Application No. 201480052715.X dated Oct. 30, 2019, 4 pages. |
Chinese First Office Action for Patent Application No. 201480052715.X, dated May 3, 2018, 19 pages. |
Chinese First Office Action for Patent Application No. 201480052720.0, dated May 2, 2018, 18 pages. |
Chinese First Office Action for Patent Application No. 201910495865.2 dated Apr. 26, 2021, 9 pages. |
Chinese Notice of Grant for Patent Application No. 201480052720.0 dated Mar. 26, 2019, 4 pages. |
Chinese Second Office Action for Patent Application No. 201480052715.X dated Dec. 4, 2018, 12 pages. |
Chinese Second Office Action for Patent Application No. 201480052720.0 dated Nov. 27, 2018, 6 pages. |
Chinese Third Office Action dated May 7, 2019 for Patent Application No. 201480052715.X, 34 pages. |
European 71(3) Communication for Patent Application No. 14849276.2 dated Dec. 5, 2018, 53 pages. |
European Communication 71(3) for Patent Application No. 19167409.2 dated Aug. 18, 2021, 49 pages. |
European Communication 94(3) for Patent Application No. 19167409.2 dated Oct. 8, 2020, 4 pages. |
European Communication pursuant to Article 94(3) EPC for Application No. 14849276.2 dated Apr. 3, 2018, 5 pages. |
European Communication under Rule 71(3) EPC for Application No. 14846931.5, Intention to Grant, dated Apr. 15, 2019, 56 pages. |
European ESSR for Patent Application No. 19167409.2 dated Jul. 17, 2019, 2 pages. |
European Rule 69 Communication for Patent Application 19197540.8 dated Feb. 24, 2020, 2 pages. |
European Rule 69 Communication for Patent Application No. 19167409.2 dated Jun. 12, 2019, 1 page. |
European Search Report for Patent Application No. 19197540.8 dated Jan. 17, 2020, 6 pages. |
Ghorbei-Talbi et al., “Managing Delegation in Access Control Models,” International Conference on Advanced Computing and Communications, pp. 744-751, Dec. 18-21, 2007. |
International Search Report and Written Opinion mailed Dec. 30, 2014, in International Patent Application No. PCT/US2014/057043, filed Sep. 23, 2014. |
International Search Report and Written Opinion mailed Dec. 30, 2014, in International Patent Application No. PCT/US2014/057051, filed Sep. 23, 2014. |
International Search Report and Written Opinion mailed Oct. 22, 2014, International Patent Application No. PCT/US2014/042569, filed Jun. 16, 2014. |
Japanese Appeal Decision on Final Rejection, dated May 8, 2019, for Patent Application No. 2016-542890, 41 pages. |
Japanese Decision to Grant a Patent dated Jul. 18, 2018, for Patent Application No. 2016-542891, 6 pages. |
Japanese Decision to Grant for Patent Application No. 2018-111507 dated Oct. 6, 2020, 6 pages. |
Japanese Final Rejection for Patent Application No. 2016-542890 dated Dec. 17, 2017, 4 pages. |
Japanese Final Rejection for Patent Application No. 2018-078782 dated Mar. 23, 2020, 6 pages. |
Japanese Final Rejection, dated Feb. 13, 2018, for Patent Application No. 2016-542891, 12 pages. |
Japanese First Office Action, dated May 20, 2019, for Patent Application No. 2018-111507, 10 pages. |
Japanese First Office Action, dated May 31, 2019, for Patent Application No. 2018-078782, 8 pages. |
Japanese Office Action for Patent Application No. 2018-078782 dated Mar. 3, 2021, 20 pages. |
Japanese Office Action for Patent Application No. 2020-126140 dated Oct. 27, 2021, 4 pages. |
Japanese Second Office Action for Patent Application No. 2018-111507 dated Jan. 27, 2020, 10 pages. |
Krawczyk et al., “HMAC: Keyed-Hashing for Message Authentication,” Internet Engineering Task Force (IETF) Request for Comments: 2104, Feb. 1997, retrieved Jan. 22, 2015, from https://tols.ietf.org/html/rfc2104, pp. 1-11. |
Liscano et al., “A Context-based Delegation Access Control Model for Pervasive Computing,” 21st International Conference on Advanced Information Networking and Applications Workshops 2:44-51, May 21-23, 2007. |
Massachusetts Institute of Technology, “Kerberos V5 Installation Guide [online],” May 2012, retrieved on Jun. 27, 2012, from http:/web.mit.edu/kerberos/krb5-1.10/krb5-1.10.2/doc/krb5-install.him, 65 pages. |
Massachusetts Institute of Technology, “Kerberos V5 System Administrator's Guide [online],” May 2012, retrieved on Jun. 27, 2012, from http://web.mit.edu/kerberos/krb5-1.10/krb5-1.10.2/doc/krb5-admin.html, 57 pages. |
Massachusetts Institute of Technology, ““Kerberos V5 Unix User's Guide,”” May 2012, retrieved on Jun. 28, 2012, from http://web.mit.edu/kerberos/krb5-1.10/krb5-1.10.2/doc/krb5-user.html, 38 pages. |
Patent Cooperation Treaty, “Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration,” issued to International Application No. PCT/US2012/058083 on Dec. 27, 2012. |
Roth et al., “Hierarchical Data Access Techniques,” U.S. Appl. No. 13/431,882, filed Mar. 27, 2012. |
Schneier, “Applied Cryptography,” John Wiley & Sons, Second Edition, 1996, pp. 34-41. |
Simpson, “PPP Challenge Handshake Authentication Protocol (CHAP),” Network Working Group, Aug. 1996, retrieved from internet Jun. 27, 2012, http://etherpad.tools.ietf.org/html/rfc1994, 13 pages. |
TCG Published, “TPM Main Part 1 Design Principles,” Specification Version 1.2, Revision 116, Mar. 1, 2011, 184 pages. |
TCG Published, “TPM Main Part 2 TPM Structures,” Specification Version 1.2, Level 2 Revision 116, Mar. 1, 2011, 202 pages. |
TCG Published, “TPM Main Part 3 Commands,” Specification Version 1.2, Level 2 Revision 116, Mar. 1, 2011, 339 pages. |
U.S. Appl. No. 13/431,760, filed Mar. 27, 2012. |
U.S. Appl. No. 13/431,898, filed Mar. 27, 2012. |
Wang et al., “Extending the Security Assertion Markup Language to Support Delegation for Web Services and Grid Services,” IEEE International Conference on Web Services 1:67-74, Jul. 11-15, 2005. |
Wikipedia, “Physical unclonable function,” retrieved Aug. 22, 2013, from http://en.wikipedia.org/wiki/Physical_unclonable_function, 8 pages. |
European Communication under Rule 71(3) EPC for Patent Application No. 22155709.3 dated Mar. 30, 2023, 49 pages. |
European Notice of Allowance of Patent Application No. 19197540.8 dated Mar. 23, 2023, 57 pages. |
Canadian Intellectual Property Office Notice of Allowance of Application No. 2,923,437 mailed Oct. 14, 2022, 1 page. |
Canadian Intellectual Property Office Notice of Office Action in Application No. 2,923,437 mailed Feb. 20, 2023, 3 pages. |
Canadian Intellectual Property Office Pre-Final Office Action, Application No. 2,923,438 dated Feb. 2, 2023, 9 pages. |
China National Intellectual Property Administration Rejection Decision in Application No. 201910495865.2 issued Feb. 15, 2023; 13 pages. |
Hwang et al. “A business model for cloud computing based on a separate encryption and decryption service,” 2011 International Conference on Information Science and Applications, IEEE, 2011. |
Japanese Patent Office Final Office Action in Application No. 2020-181042; Jul. 7, 2023; 7 pages. |
Canadian Intellectual Property Office Notice of Allowance of Application No. 2,923,437 mailed Nov. 2, 2023, 1 page. |
European Patent Office extended Search Report dated Oct. 6, 2023, Application No. 23176840.9, 7 pages. |
Canada Intellectual Property Office Notice of Allowance of Patent Application l\lo., 2923438 dated Nov. 23, 2023, page. |
Number | Date | Country | |
---|---|---|---|
20210173948 A1 | Jun 2021 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16048126 | Jul 2018 | US |
Child | 17177496 | US | |
Parent | 15090315 | Apr 2016 | US |
Child | 16048126 | US | |
Parent | 14037292 | Sep 2013 | US |
Child | 15090315 | US |