View source for Hash calendar

A '''hash calendar''' is a data structure that is used to measure the passage of time by adding hash values to an append-only database with one hash value per elapsed second. It can be thought of special kind of [[Merkle tree|Merkle or hash tree]], with the property that at any given moment, the tree contains a leaf node for each second since 1970‑01‑01 00:00:00 UTC.
[[File:A hash tree with 8 leaf nodes and a hash calendar after 7 seconds.jpg|thumb|center|525px|A hash tree with 8 leaf nodes and a hash calendar after 7 seconds]]

[[File:Hash calendar after 31 seconds.jpg|thumb|center|530px|Hash calendar after 31 seconds]]

The leaves are numbered left to right starting from zero and new leaves are always added to the right. By periodically publishing the root of the hash-tree is it possible to use a hash calendar as the basis of a hash-linking based digital timestamping scheme.

== History ==

The hash calendar construct was invented by Estonian cryptographers Ahto Buldas and Mart Saarepera based on their research on the security properties of [[Cryptographic hash function|cryptographic hash function]]s and hash-linking based digital timestamping.<ref>[http://www.google.com/patents/US8312528 System and method for generating a digital certificate patent 8,312,528]</ref> Their design goal was to remove the need for a trusted third party i.e. that the time of the timestamp should be verifiable independently from the issuer of the timestamp.<ref>{{Cite web |url=http://www.guardtime.com/resources/video-library/educational-series-on-hash-functions |title=Educational Series on Hash Functions &#124; Guardtime |access-date=2013-01-07 |archive-url=https://archive.today/20130216051915/http://www.guardtime.com/resources/video-library/educational-series-on-hash-functions |archive-date=2013-02-16 |url-status=dead }}</ref>

== Construction of a hash calendar ==

There are different algorithms that can be used to build a hash calendar and extract a relevant [[Hash chain#Binary hash chains|hash chain]] per second. The easiest is to imagine the calendar being built in two phases. In the first phase, the leaves are collected into complete binary trees, starting from left, and making each tree as large as possible.

[[File:Sparse hash calendar with 11 10 = 1011 2 leaves.jpg|thumb|323px|center|
Sparse hash calendar with 11<sub>10</sub> = 1011<sub>2</sub> leaves]]

In the second phase, the multiple unconnected trees are turned into a single tree by merging the roots of the initial trees, but this time starting from the right and adding new parent nodes as needed (red nodes).

[[File:Compact hash calendar with 11 10 = 1011 2 leaves.jpg|thumb|324px|center|
Compact hash calendar with 11<sub>10</sub> = 1011<sub>2</sub> leaves.]]

The hash chains can then be extracted as from any hash tree. Since the hash calendar is built in a deterministic manner, the shape of the tree for any moment can be reconstructed knowing just the number of leaf nodes in the tree at that moment, which is one more than the number of seconds from 1970‑01‑01 00:00:00 UTC to that moment. Therefore, given the time when the calendar tree was created and a hash chain extracted from it, the time value corresponding to each leaf node can be computed.

== Distributed hash calendar  ==

The Distributed hash calendar is  a distributed network of hash calendar nodes. In order to ensure a high availability service it is possible to have multiple calendars in different physical locations all of which communicate with each other to ensure that each calendar contains identical hash values. Ensuring that the calendars remain in agreement is a form of Byzantine fault tolerance

To the right  a 5 node calendar cluster is shown where each node communicates with every other node in the cluster and there is no single point of failure. Although each node has a clock the clock is not used for setting the time directly but as a metronome to ensure that the nodes “beat” at the same time.

== Applications ==
A five node hash calendar cluster is a component of Keyless Signature Infrastructure (KSI), each leaf in the hash calendar being the aggregate hash value of a globally distributed hash tree.

== See also ==
* Cryptographic hash functions 
* Linked Timestamping
* [[Hash list]]
* [[Hash table]]
* [[Merkle tree]] 
* Provably secure cryptographic hash function

== References ==

<references />

== External links ==
* {{US patent|4309569|Merkle tree patent 4,309,569}} – Explains both the hash tree structure and the use of it to handle many one-time signatures.
* [https://web.archive.org/web/20061206235144/http://www.rsasecurity.com/rsalabs/node.asp?id=2003 Efficient Use of Merkle Trees] – [[Company:RSA Security|RSA labs]] explanation of the original purpose of Merkle trees: To handle many Lamport one-time signatures.
* https://web.archive.org/web/20110625054822/http://csrc.nist.gov/groups/ST/toolkit/secure_hashing.html

{{Cryptography navbox}}
{{CS-Trees}}

[[Category:Error detection and correction]]
[[Category:Cryptographic hash functions]]
[[Category:Hashing]]
[[Category:Trees (data structures)]]

{{Sourceattribution|Hash calendar}}