Data verification methods and systems using a hash tree, such as a time-centric merkle hash tree
US10303887B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 14, 2015 |
| Grant date | May 28, 2019 |
| Priority date | — |
| Expiry date | Apr 3, 2037 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L9/50
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.