Stamp & Extend – Instant but Undeniable Timestamping based on Lazy Trees ∗ †

@inproceedings{Krzywiecki2013StampE,
  title={Stamp & Extend – Instant but Undeniable Timestamping based on Lazy Trees ∗ †},
  author={Łukasz Krzywiecki and Przemysław Kubiak and Mirosław Kutyłowski},
  year={2013}
}
We present a Stamp&Extend time-stamping scheme based on linking via modified creation of Schnorr signatures. The scheme is based on lazy construction of a tree of signatures. Stamp&Extend returns a timestamp immediately after the request, unlike the schemes based on the concept of timestamping rounds. Despite the fact that all timestamps are linearly linked… CONTINUE READING