A new timestamping schema in the Bounded Storage Model

Abstract

Timestamping [1] is a cryptographic technique for adding a reliable date to a document in order to prove its existence at a given time. Several solutions of timestamping exist. They are all based on cryptographic techniques as digital signatures and hash functions. However, with the increase of computing power and the evolution of cryptanalysis methods, cryptography becomes more and more the target of criticism. That's why we need new directions and orientations for timestamping techniques. One of these directions was introduced in [2] and dealt with non interactive timestamping solutions in the Bounded Storage Model. In the Bounded Storage Model, we make the hypothesis that user's storage capacity is bounded but user's computing power is unlimited. In this paper, we first present the existing timestamping systems. Then we introduce the Bounded Storage Model. Finally, we present a new timestamping schema that we have conceived in the bounded storage model.