专利名称：METHOD AND SYSTEM FOR VERIFYING INFORMATION OF A DATA ITEM IN A
PLURALITY OF DIFFERENT DATA ITEMS 发明人：BOHLI, Jens-Matthias,KARAME,
Ghassan,ARMKNECHT, Frederik
申请号：EP2015/053242
申请日：20150216
公开号：WO2016/131473A1
公开日：
20160825
专利内容由知识产权出版社提供
专利附图：
摘要：The present invention relates to a method for verifying information of a data
item (DI) in a plurality of different data items (DI), preferably stored on a server (SP) like a cloud or the like, wherein: a) a hash tree is generated from the plurality of data items (DI), such that the data items (DI) forming the leaves (LO) of the hash tree (HT) and such that the non-leaf nodes (L1, L2, L3,...) are computed by hashing the data items (DI) of their respective child nodes (L0, L1, L2,...) and when computing the root-hash (R) at least the distance between the root node (R) and the leaf-nodes (L0) is included into the hashing;
b) an authentication path for said data item (DI) is computed based on a recomputation of the hash tree (HT), wherein an authentication path comprises all siblings of tree nodes from the data item (DI) to the root (R) of the hash tree (HT); c) the root-hash (R) is recomputed based on said data item (DI) and the computed authentication path of said data item (DI) and the recomputed root-hash (R) is compared with the root-hash (R) of the hash-tree (HT) of step a); d) the side element (RME) in the leaves (L0) or a tree level (L1) above of the hash tree (HT) and its authentication path is determined; e) the authentication path of said side element (RME) is verified, wherein based on the result of step e) the nserver 2016
umber of data items (DI) of said plurality is determined and wherein a membership of said data item (DI) to the plurality of data items is determined based on the result of step c).
申请人：NEC EUROPE LTD.,UNIVERSITÄT MANNHEIM
地址：DE,DE
国籍：DE,DE
代理人：ULLRICH & NAUMANN
更多信息请下载全文后查看

版权声明：本站内容均来自互联网，仅供演示用，请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系QQ:729038198，我们将在24小时内删除。