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.

Attached files:


Patents:
WO 2,010,024,931

Inventor(s): PAPAMANTHOU CHARALAMPOS [US]; TAMASSIA ROBERTO [US]; TRIANDOPOULOS NIKOLAOS [US]

Type of Offer: Licensing



« More Data Processing Patents

---