知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

13 records (took 0.018 seconds)

    REDUNDANT KEY MANAGEMENT
    1.
    发明申请
    REDUNDANT KEY MANAGEMENT 有权
    冗余关键管理

    公开(公告)号：US20160154963A1

    公开(公告)日：2016-06-02

    申请号：US15004592

    申请日：2016-01-22

    Applicant: Amazon Technologies, Inc.

    Inventor： Sandeep Kumar ,  Gregory Branchek Roth ,  Gregory Alan Rubin ,  Mark Christopher Seigle ,  Kamran Tirdad

    IPC: G06F21/60 ,  H04L9/14

    CPC classification number: G06F21/602 ,  G06F11/1076 ,  G06F11/1464 ,  G06F11/1469 ,  G06F12/1408 ,  G06F21/6209 ,  H04L9/0822 ,  H04L9/0825 ,  H04L9/14 ,  H04L2209/24

    Abstract: A data storage service redundantly stores data and keys used to encrypt the data. Data objects are encrypted with first cryptographic keys. The first cryptographic keys are encrypted by second cryptographic keys. The first cryptographic keys and second cryptographic keys are redundantly stored in a data storage system to enable access of the data objects, such as to respond to requests to retrieve the data objects. The second cryptographic keys may be encrypted by third keys and redundantly stored in the event access to a second cryptographic key is lost.

    Abstract translation: 数据存储服务冗余地存储用于加密数据的数据和密钥。 数据对象使用第一加密密钥进行加密。 第一加密密钥由第二加密密钥加密。 第一加密密钥和第二加密密钥被冗余地存储在数据存储系统中，以使数据对象能够访问，例如响应检索数据对象的请求。 可以通过第三密钥来加密第二加密密钥，并且在丢失对第二加密密钥的访问的情况下被冗余地存储。

    Redundant key management
    2.
    发明授权
    Redundant key management 有权
    冗余密钥管理

    公开(公告)号：US09251097B1

    公开(公告)日：2016-02-02

    申请号：US13919701

    申请日：2013-06-17

    Applicant: Amazon Technologies, Inc.

    Inventor： Sandeep Kumar ,  Gregory Branchek Roth ,  Gregory Alan Rubin ,  Mark Christopher Seigle ,  Kamran Tirdad

    IPC: G06F21/00 ,  G06F12/14 ,  G06F11/14

    CPC classification number: G06F21/602 ,  G06F11/1076 ,  G06F11/1464 ,  G06F11/1469 ,  G06F12/1408 ,  G06F21/6209 ,  H04L9/0822 ,  H04L9/0825 ,  H04L9/14 ,  H04L2209/24

    Abstract: A data storage service redundantly stores data and keys used to encrypt the data. Data objects are encrypted with first cryptographic keys. The first cryptographic keys are encrypted by second cryptographic keys. The first cryptographic keys and second cryptographic keys are redundantly stored in a data storage system to enable access of the data objects, such as to respond to requests to retrieve the data objects. The second cryptographic keys may be encrypted by third keys and redundantly stored in the event access to a second cryptographic key is lost.

    Abstract translation: 数据存储服务冗余地存储用于加密数据的数据和密钥。 数据对象使用第一加密密钥进行加密。 第一加密密钥由第二加密密钥加密。 第一加密密钥和第二加密密钥被冗余地存储在数据存储系统中，以使数据对象能够访问，例如响应检索数据对象的请求。 可以通过第三密钥来加密第二加密密钥，并且在丢失对第二加密密钥的访问的情况下被冗余地存储。

    Range retrievals from archived data objects according to a predefined hash tree schema
    4.
    发明授权
    Range retrievals from archived data objects according to a predefined hash tree schema 有权
    根据预定义的散列树模式，从存档的数据对象进行范围检索

    公开(公告)号：US09223789B1

    公开(公告)日：2015-12-29

    申请号：US13827137

    申请日：2013-03-14

    Applicant: Amazon Technologies, Inc.

    Inventor： Mark Christopher Seigle ,  Kamran Tirdad ,  Colin Laird Lazier

    IPC: G06F17/30

    CPC classification number: G06F17/30073

    Abstract: Ranges of data stored within archived data may be retrieved according to a predefined hash tree schema. A retrieval request for a range of one or more data chunks of an archived data object stored in archival data store may be retrieved. In response, the requested range of the archived data object may be determined to be tree-hash aligned. In response to determining that the requested range is tree-hash aligned, a retrieval job may be initiated to obtain the range of one or more data chunks and to stage the one or more data chunks for download. A download request may for one or more of the obtained and staged data chunks, and if determined to be tree-hash aligned, a tree hash root node may be sent to the requesting client in addition to the requested data.

    Abstract translation: 可以根据预定义的散列树模式检索归档数据中存储的数据范围。 可以检索对归档数据存储中存储的归档数据对象的一个​​或多个数据块的范围的检索请求。 作为响应，归档数据对象的请求范围可以被确定为树 - 哈希对齐。 响应于确定所请求的范围是树 - 哈希对齐，可以启动检索作业以获得一个或多个数据块的范围，并且对一个或多个数据块进行分级以进行下载。 下载请求可以针对一个或多个所获得的和分阶段的数据块，并且如果确定为树 - 哈希对齐，则除了所请求的数据之外，还可以将树哈希根节点发送到请求客户端。

    Techniques for distributing verification checks incident to data deletion
    5.
    发明授权
    Techniques for distributing verification checks incident to data deletion 有权

    公开(公告)号：US11573925B2

    公开(公告)日：2023-02-07

    申请号：US16983849

    申请日：2020-08-03

    Applicant: Amazon Technologies, Inc.

    Inventor： Ryan Charles Schmitt ,  Claire Elizabeth Suver ,  Mark Christopher Seigle ,  Bryan James Donlan

    IPC: G06F16/16 ,  G06F11/10

    Abstract: Techniques described and suggested herein include distributed deletion request processing and verification. For example, incident to migration of original data from a first data store to a second data store, verifications and confirmations related to removing the original data from the first data store may be performed so as to ensure the integrity of the original data represented on the second data store prior to removing the actual original data on the first data store. In some embodiments, the verifications and confirmations performed in connection with a deletion request may be apportioned to multiple entities, each of which may not fully trust the others. As a result, in some embodiments, a given deletion request may only be fulfilled if all of the entities involved in the verification process individually provide authorization to execute the deletion request.

    VALIDITY MAP-BASED TRACKING OF USER DATA UPDATES
    7.
    发明申请
    VALIDITY MAP-BASED TRACKING OF USER DATA UPDATES 审中-公开

    公开(公告)号：US20180011894A1

    公开(公告)日：2018-01-11

    申请号：US15658283

    申请日：2017-07-24

    Applicant: Amazon Technologies, Inc.

    Inventor： Jeffrey Arthur Johnson ,  Mark Christopher Seigle

    IPC: G06F17/30

    CPC classification number: G06F16/2365

    Abstract: A method and apparatus is disclosed for utilizing a validity map to indicate whether an overwriting data portion of user data is received. In the method and apparatus, a plurality of data portions of user data are received, whereby each data portion of the plurality of data portion may overwrite another data portion. A validity map may be utilized to indicate whether a data portion is an overwriting data portion. The validity map may be utilized for retrieving the data portion instead of the data portion being replaced.

    Validity map-based tracking of user data updates
    8.
    发明授权
    Validity map-based tracking of user data updates 有权

    公开(公告)号：US10977238B2

    公开(公告)日：2021-04-13

    申请号：US15658283

    申请日：2017-07-24

    Applicant: Amazon Technologies, Inc.

    Inventor： Jeffrey Arthur Johnson ,  Mark Christopher Seigle

    IPC: G06F16/00 ,  G06F16/23

    Abstract: A method and apparatus is disclosed for utilizing a validity map to indicate whether an overwriting data portion of user data is received. In the method and apparatus, a plurality of data portions of user data are received, whereby each data portion of the plurality of data portion may overwrite another data portion. A validity map may be utilized to indicate whether a data portion is an overwriting data portion. The validity map may be utilized for retrieving the data portion instead of the data portion being replaced.

    Techniques for distributing verification checks incident to data deletion
    10.
    发明授权
    Techniques for distributing verification checks incident to data deletion 有权

    公开(公告)号：US10733145B1

    公开(公告)日：2020-08-04

    申请号：US14572603

    申请日：2014-12-16

    Applicant: Amazon Technologies, Inc.

    Inventor： Ryan Charles Schmitt ,  Claire Elizabeth Suver ,  Mark Christopher Seigle ,  Bryan James Donlan

    IPC: G06F16/16 ,  G06F11/10

    Abstract: Techniques described and suggested herein include distributed deletion request processing and verification. For example, incident to migration of original data from a first data store to a second data store, verifications and confirmations related to removing the original data from the first data store may be performed so as to ensure the integrity of the original data represented on the second data store prior to removing the actual original data on the first data store. In some embodiments, the verifications and confirmations performed in connection with a deletion request may be apportioned to multiple entities, each of which may not fully trust the others. As a result, in some embodiments, a given deletion request may only be fulfilled if all of the entities involved in the verification process individually provide authorization to execute the deletion request.

Patent Agency Ranking