Data Verification Methods And Systems Using A Hash Tree, Such As A Time-centric Merkle Hash Tree

  • Published: Mar 16, 2017
  • Earliest Priority: Sep 14 2015
  • Family: 7
  • Cited Works: 0
  • Cited by: 5
  • Cites: 12
  • Additional Info: Full text
Abstract

Systems and methods described herein generally relate to storing and verifying data. In some embodiments, reference levels are generated according to time intervals, where the first reference level comprises a predetermined number of the time intervals, and where each of the time intervals of the remaining reference levels is comprised of a predetermined number of the time intervals of a previous reference level. Hashes of data can be created at the first reference level by performing a hashing function on the data in a time-sequenced manner. First reference level time interval hashes may be generated by performing the hashing function on the hashes of the data at each of the time intervals of the first reference level. Hashes for remaining reference level time intervals can be generated by performing the hashing function on the hashes of each of the time intervals of the previous reference level.


Claims
Owners (US)
Download PDF
Document Preview
Document History
  • Publication: Mar 16, 2017
  • Application: Sep 14, 2015
    US US 201514852955 A
  • Priority: Sep 14, 2015
    US US 201514852955 A

Sign in to the Lens

Feedback