发明名称 CRYPTOGRAPHIC ACCUMULATORS FOR AUTHENTICATED HASH TABLES
摘要 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.
申请公布号 US2014245006(A1) 申请公布日期 2014.08.28
申请号 US201414190642 申请日期 2014.02.26
申请人 Brown University 发明人 Papamanthou Charalampos;Tamassia Roberto;Triandopoulos Nikolaos
分类号 G06F21/64;G06F17/30 主分类号 G06F21/64
代理机构 代理人
主权项 1. An apparatus comprising: at least one memory configured to store data; and at least one processor configured to perform operations on the stored data, where the operations comprise at least one of generating and maintaining an accumulation tree corresponding to the stored data, where the accumulation tree comprises an ordered tree structure having a root node, at least one leaf node and at least one internal node disposed between the root node and the at least one leaf node, where each of the at least one leaf nodes corresponds to at least a portion of the stored data, where a depth of the accumulation tree remains constant, where a bound on a degree of each of the at least one internal nodes is a function of a number of leaf nodes of a subtree rooted at the internal node, where each node of the accumulation tree has a corresponding accumulation value, where the accumulation values of the root node and the at least one internal node are determined by hierarchically employing a bilinear-map accumulator over the accumulation values of the nodes lying one level below the node for which the accumulation value is determined, where the accumulation value of the root node comprises a digest for the accumulation tree.
地址 Providence RI US