Method of providing a hash value for a piece of data, electronic device and computer program

A method of providing a hash value for a piece of data is disclosed, where the hash value provides for a time-stamp for the piece of data upon verification, for limiting a risk of collisions between hash values. The method comprises collecting one or more root time-stamps for a root of a hash tree s...

Full description

Saved in:
Bibliographic Details
Main Authors MAXIMOV ALEXANDER, SMEETS BERNARD, HELL MARTIN
Format Patent
LanguageChinese
English
Published 26.09.2017
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A method of providing a hash value for a piece of data is disclosed, where the hash value provides for a time-stamp for the piece of data upon verification, for limiting a risk of collisions between hash values. The method comprises collecting one or more root time-stamps for a root of a hash tree structure defining a hash function, wherein the root-time stamp is a root time-stamp from the past, determining whether a nonce may be received from a server, and upon failure to receive the nonce from the server, providing the hash value by a hash function of the root time-stamp and the piece of data, or upon success in receiving the nonce from the server, providing the hash value by the hash function of the root time-stamp, the piece of data and the nonce. An electronic device and a computer program are also disclosed. 公开了种为段数据提供散列值的方法,其中散列值在验证时为所述段数据规定时间戳,以用于限制散列值之间的冲突的风险。方法包括为定义散列函数的散列树结构的根收集个或多个根时间戳,其中根时间戳是来自过去的根时间戳,确定是否可以从服务器接收到现时值,并且当无法从服务器接收到现时值时,通过所述段数据和所述根时间戳的散列函数来提供散列值,或者当成功从服务器接收到现时值时,通过所述现时值、所述段数据和所述根时间
Bibliography:Application Number: CN201680011146