# US 2018/0026791 A1 · Method and system for verifying information of a data item in a plurality of different data items

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2018/0026791 A1
- Document ID: US20180026791A1
- Status: Published application
- Kind: A1
- Application number: 15/550,795
- Filed: 2015-02-16
- Published: 2018-01-25
- Earliest claimed: 2015-02-16
- Assignees: NEC Corporation
- Applicants: NEC Europe Ltd.; Universitaet Mannheim
- Inventors: Jens-Matthias Bohli; Ghassan Karame; Frederik Armknecht
- Web page: https://patentgrep.com/patent/US20180026791A1

## CPC

- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G06F 16/137: {Hash-based (content-based indexing of textual data G06F16/31)}
- G06F 16/1748: {De-duplication implemented within the file system, e.g. based on file segments (de-duplication techniques in storage systems for the management of data blocks G06F3/0641)}
- G06F 16/182: Distributed file systems
- G06F 21/30: Authentication, i.e. establishing the identity or authorisation of security principals
- G06F 21/602: {Providing cryptographic facilities or services}
- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures
- H04L 63/0281: {Proxies}
- H04L 63/0457: {wherein the sending and receiving network entities apply dynamic encryption, e.g. stream encryption (cryptographic mechanisms or cryptographic arrangements for stream encryption H04L9/065)}
- H04L 63/061: {for key exchange, e.g. in peer-to-peer networks (cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838)}
- H04L 63/08: {for authentication of entities (cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32)}
- H04L 63/12: {Applying verification of the received information (cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32)}
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for verifying information of a first data item in a plurality of different data items stored on a server includes a) generating a hash tree, b) computing an authentication path for the first data item based on a recomputation of the hash tree, wherein an authentication path comprises all siblings of tree nodes from the first data item to a root of the hash tree, e) recomputing the root-latish based on the first data item and a computed authentication path of the first data item and comparing the recomputed root-hash with the root-hash of the hash-tree of step a), d) determining a side element in leaves or a tree level above of the hash tree and its authentication path, and e) verifying the authentication path of the side dement.

## Claims

### Claim at position 1

1: A method for verifying information of a first data item in a plurality of different data items stored on a server, the method comprising:
a) generating a hash tree from the plurality of different data items, such that the plurality of different data items form leaves of the hash tree and such that non-leaf nodes are computed by hashing the data items of their respective child nodes, wherein when computing a root-hash at least a distance between a root node and leaf-nodes is included into a hashing,
b) computing an authentication path for the first data item based on a recomputation of the hash tree, wherein the authentication path comprises all siblings of tree nodes from the first data item to the a root of the hash tree,
c) recomputing the root-hash based on the first data item and the computed authentication path of the first data item and comparing the recomputed root-hash with the root-hash of the hash-tree of step a),
d) determining a side element in leaves or a tree level above of the hash tree and its authentication path, and
e) verifying the authentication path of the side element,
wherein, based on the result of step c) a number of data items of the plurality of different data items is determined and wherein a membership of the first data item to the plurality of different data items is determined based on the result of step c).

### Claim 2 (depends on 1)

The method according to claim 1, wherein when a number of leaves of the hash tree formed by the plurality of different data items is less than a required number to form a full hash tree, further data items are used as leaves for compensation and are filed with a distinct data item.

### Claim 3 (depends on 1)

The method according to claim 1, wherein data items forming leaves of the hash tree are hash values of plaintext information.

### Claim 4 (depends on 1)

The method according to claim 1, wherein the hash-tree is a binary tree.

### Claim 5 (depends on 1)

The method according to claim 1, wherein the hash-tree is a Tiger hash-tree with the hashing based on tiger hash function.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the plurality of different data items is associated to a file with a file identification, wherein said the file identification is announced together with the root of the hash tree.

### Claim 7 (depends on 6)

The method according to claim 6, wherein in case of different files each having a different file identification and associated to different pluralities of data items one or more of-the-files are randomly selected and steps a)-e) are performed for each data item in the corresponding plurality.

### Claim 8

A system connectable to a storage entity and one or more clients configured to verify information of a first data item in a plurality of different data items, the system comprising:
a hashing entity adapted to generate a hash tree from the plurality of different data items, such that, the plurality of different data items form leaves of the hash tree and such that non-leaf nodes are computed by hashing data items of their respective child nodes, wherein when computing a root-hash at least a distance between a root node and leaf-nodes is included into hashing.
an authentication entity adapted to compute an authentication path for the first data item based on a recomputation of the hash tree, wherein the authentication path comprises all siblings of tree nodes from the first data item to the root of the hash tree,
a recomputation entity adapted to recompute the root-hash based on the first data item and the computed authentication path of the first data item and to compare the recomputed root-hash with the root-hash of the hash-tree provided by the hashing entity,
a determining entity adapted to determine a side element in leaves or a tree level above of the hash tree and its authentication path,
a verification entity adapted to verify the authentication path of the side element, and
a result providing entity adapted to determine, based on a provided result of the verification entity, a number of data items of the plurality of different data items and a membership of the first data item to the plurality of data items based on a provided result of the recomputation entity.
