-
1.发明申请公开(公告)号：US20120030468A1
公开(公告)日：2012-02-02
申请号：US13194702
申请日：2011-07-29
IPC分类号： H04L9/32
CPC分类号： H04L9/3073 , H04L9/3026 , H04L9/3236 , H04L2209/26 , H04L2209/38
摘要： A system and method for cryptographically checking the correctness of outsourced set operations performed by an untrusted server over a dynamic collection of sets that are owned (and updated) by a trusted source is disclosed. The system and method provides new authentication mechanisms that allow any entity to publicly verify a proof attesting the correctness of primitive set operations such as intersection, union, subset and set difference. Based on a novel extension of the security properties of bilinear-map accumulators as well as on a primitive called accumulation tree, the system and method achieves optimal verification and proof complexity, as well as optimal update complexity, while incurring no extra asymptotic space overhead. The method provides an efficient proof construction, adding a logarithmic overhead to the computation of the answer of a set-operation query. Applications of interest include efficient verification of keyword search and database queries.
摘要翻译： 公开了一种用于密码地检查由不受信任的服务器对由可信源所拥有（并更新）的集合的动态集合执行的外包集合操作的正确性的系统和方法。 系统和方法提供了新的认证机制，允许任何实体公开验证证明原始集合操作的正确性的证明，例如交集，联合，子集和设置差异。 基于双线性映射累加器的安全属性的新颖扩展以及原始称为累积树的原型，系统和方法实现了最优验证和验证复杂度，以及最优的更新复杂度，同时不产生额外的渐近空间开销。 该方法提供了一种有效的证明结构，为设置操作查询的答案的计算增加了对数开销。 感兴趣的应用程序包括关键字搜索和数据库查询的有效验证。
-
2.发明授权公开(公告)号：US08572385B2
公开(公告)日：2013-10-29
申请号：US13194702
申请日：2011-07-29
IPC分类号： H04L9/32
CPC分类号： H04L9/3073 , H04L9/3026 , H04L9/3236 , H04L2209/26 , H04L2209/38
摘要： A system and method for cryptographically checking the correctness of outsourced set operations performed by an untrusted server over a dynamic collection of sets that are owned (and updated) by a trusted source is disclosed. The system and method provides new authentication mechanisms that allow any entity to publicly verify a proof attesting the correctness of primitive set operations such as intersection, union, subset and set difference. Based on a novel extension of the security properties of bilinear-map accumulators as well as on a primitive called accumulation tree, the system and method achieves optimal verification and proof complexity, as well as optimal update complexity, while incurring no extra asymptotic space overhead. The method provides an efficient proof construction, adding a logarithmic overhead to the computation of the answer of a set-operation query. Applications of interest include efficient verification of keyword search and database queries.
摘要翻译： 公开了一种用于密码地检查由不受信任的服务器对由可信源所拥有（并更新）的集合的动态集合执行的外包集合操作的正确性的系统和方法。 系统和方法提供了新的认证机制，允许任何实体公开验证证明原始集合操作的正确性的证明，例如交集，联合，子集和设置差异。 基于双线性映射累加器的安全属性的新颖扩展以及原始称为累积树的原型，系统和方法实现了最优验证和验证复杂度，以及最优的更新复杂度，同时不产生额外的渐近空间开销。 该方法提供了一种有效的证明结构，为设置操作查询的答案的计算增加了对数开销。 感兴趣的应用程序包括关键字搜索和数据库查询的有效验证。
-
公开(公告)号：US08726034B2
公开(公告)日：2014-05-13
申请号：US12737887
申请日：2009-08-28
IPC分类号： G06F21/00
CPC分类号： G06F21/64 , G06F17/30327 , G06F21/00 , H04L12/28
摘要： In one exemplary embodiment, an apparatus includes a memory storing data and a processor performing operations. The apparatus generates or maintains an accumulation tree for the stored data—an ordered tree structure with a root node, leaf nodes and internal nodes. Each leaf node corresponds to a portion of the data. A depth of the tree remains constant. A bound on a degree of each internal node is a function of a number of leaf nodes of a subtree rooted at the internal node. Each node of the tree has an accumulation value. Accumulation values of the root and internal nodes are determined by hierarchically employing an accumulator over the accumulation values of the nodes lying one level below the node in question. The accumulation value of the root node is a digest for the tree.
摘要翻译： 在一个示例性实施例中，一种装置包括存储数据的存储器和执行操作的处理器。 该设备为存储的数据生成或维护累积树 - 具有根节点，叶节点和内部节点的有序树结构。 每个叶节点对应于数据的一部分。 树的深度保持不变。 每个内部节点的度数的限制是根据内部节点的子树的叶节点数量的函数。 树的每个节点都有累积值。 根和内部节点的累积值通过在位于所讨论的节点下方一级的节点的累积值上分级地采用累加器来确定。 根节点的累积值是树的摘要。
-
4.发明申请公开(公告)号：US20110225429A1
公开(公告)日：2011-09-15
申请号：US12737887
申请日：2009-08-28
IPC分类号： G06F21/00
CPC分类号： G06F21/64 , G06F17/30327 , G06F21/00 , H04L12/28
摘要： In one exemplary embodiment, an apparatus includes a memory storing data and a processor performing operations. The apparatus generates or maintains an accumulation tree for the stored data—an ordered tree structure with a root node, leaf nodes and internal nodes. Each leaf node corresponds to a portion of the data. A depth of the tree remains constant. A bound on a degree of each internal node is a function of a number of leaf nodes of a subtree rooted at the internal node. Each node of the tree has an accumulation value. Accumulation values of the root and internal nodes are determined by hierarchically employing an accumulator over the accumulation values of the nodes lying one level below the node in question. The accumulation value of the root node is a digest for the tree.
摘要翻译： 在一个示例性实施例中，一种装置包括存储数据的存储器和执行操作的处理器。 该设备为存储的数据生成或维护累积树 - 具有根节点，叶节点和内部节点的有序树结构。 每个叶节点对应于数据的一部分。 树的深度保持不变。 每个内部节点的度数的限制是根据内部节点的子树的叶节点数量的函数。 树的每个节点都有累积值。 根和内部节点的累积值通过在位于所讨论的节点下方一级的节点的累积值上分级地采用累加器来确定。 根节点的累积值是树的摘要。
-
5.发明申请APPARATUS, METHODS, AND COMPUTER PROGRAM PRODUCTS PROVIDING DYNAMIC PROVABLE DATA POSSESSION 有权提供动态可用数据位置的装置，方法和计算机程序产品公开(公告)号：US20130198854A1
公开(公告)日：2013-08-01
申请号：US12737583
申请日：2009-07-24
IPC分类号： G06F21/60
CPC分类号： G06F21/60 , H04L9/008 , H04L9/3218 , H04L9/3236 , H04L2209/30
摘要： In one exemplary embodiment, a method includes: storing data for a file, organized as blocks, each having a portion of the file; and maintaining a skip list for the data. The skip list is an ordered tree structure having a root node, internal nodes and leaf nodes. Each leaf node corresponds to a block. Each node has a rank value corresponding to size of a subtree rooted at the node. The skip list employs a hashing scheme. The hash value of the root node and internal nodes is computed from a level of the node, the rank value and an interval between the node and another linked node to the right of or below the node. The hash value of the leaf nodes is computed from a level of the node, the rank value and an interval associated with the node.
摘要翻译： 在一个示例性实施例中，一种方法包括：存储用于文件的数据，其被组织为块，每个具有文件的一部分; 并维护数据的跳过列表。 跳过列表是具有根节点，内部节点和叶节点的有序树结构。 每个叶节点对应一个块。 每个节点具有对应于根节点的子树的大小的等级值。 跳过列表使用散列方案。 根节点和内部节点的哈希值是从节点的级别，等级值以及节点与节点右侧或下方的另一个链接节点之间的间隔计算出来的。 从节点的级别，等级值和与节点相关联的间隔计算叶节点的哈希值。
-
6.发明授权Apparatus, methods, and computer program products providing dynamic provable data possession 有权提供动态可证明的数据拥有的装置，方法和计算机程序产品公开(公告)号：US08978155B2
公开(公告)日：2015-03-10
申请号：US12737583
申请日：2009-07-24
CPC分类号： G06F21/60 , H04L9/008 , H04L9/3218 , H04L9/3236 , H04L2209/30
摘要： In one exemplary embodiment, a method includes: storing data for a file, organized as blocks, each having a portion of the file; and maintaining a skip list for the data. The skip list is an ordered tree structure having a root node, internal nodes and leaf nodes. Each leaf node corresponds to a block. Each node has a rank value corresponding to size of a subtree rooted at the node. The skip list employs a hashing scheme. The hash value of the root node and internal nodes is computed from a level of the node, the rank value and an interval between the node and another linked node to the right of or below the node. The hash value of the leaf nodes is computed from a level of the node, the rank value and an interval associated with the node.
摘要翻译： 在一个示例性实施例中，一种方法包括：存储用于文件的数据，其被组织为块，每个具有文件的一部分; 并维护数据的跳过列表。 跳过列表是具有根节点，内部节点和叶节点的有序树结构。 每个叶节点对应一个块。 每个节点具有对应于根节点的子树的大小的等级值。 跳过列表使用散列方案。 根节点和内部节点的哈希值是从节点的级别，等级值以及节点与节点右侧或下方的另一个链接节点之间的间隔计算出来的。 从节点的级别，等级值和与节点相关联的间隔计算叶节点的哈希值。
-
公开(公告)号：US08930691B2
公开(公告)日：2015-01-06
申请号：US13210398
申请日：2011-08-16
CPC分类号： H04L9/00 , G06F21/6218
摘要： Described herein is an efficient, dynamic Symmetric Searchable Encryption (SSE) scheme. A client computing device includes a plurality of files and a dictionary of keywords. An index is generated that indicates, for each keyword and each file, whether a file includes a respective keyword. The index is encrypted and transmitted (with encryptions of the files) to a remote repository. The index is dynamically updateable at the remote repository, and can be utilized to search for files that include keywords in the dictionary without providing the remote repository with information that identifies content of the file or the keyword.
摘要翻译： 这里描述的是一种高效的动态对称可搜索加密（SSE）方案。 客户端计算装置包括多个文件和关键词词典。 生成一个索引，指示每个关键字和每个文件是否包含相应的关键字。 索引被加密并传输（加密文件）到远程存储库。 该索引可在远程存储库中动态更新，并且可用于搜索包含字典中的关键字的文件，而不向远程存储库提供标识文件或关键字内容的信息。
-
公开(公告)号：US20130046974A1
公开(公告)日：2013-02-21
申请号：US13210398
申请日：2011-08-16
IPC分类号： H04L9/00
CPC分类号： H04L9/00 , G06F21/6218
摘要： Described herein is an efficient, dynamic Symmetric Searchable Encryption (SSE) scheme. A client computing device includes a plurality of files and a dictionary of keywords. An index is generated that indicates, for each keyword and each file, whether a file includes a respective keyword. The index is encrypted and transmitted (with encryptions of the files) to a remote repository. The index is dynamically updateable at the remote repository, and can be utilized to search for files that include keywords in the dictionary without providing the remote repository with information that identifies content of the file or the keyword.
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.027 秒)
