Optimally Tight Security Proofs for Hash-Then-Publish Time-Stamping


We study the security of hash-then-publish time-stamping schemes and concentrate on the tightness of security reductions from the collision-resistance of the underlying hash functions. While the previous security reductions create a quadratic loss in the security in terms of time-success ratio of the adversary being protected against, this paper achieves a… (More)
DOI: 10.1007/978-3-642-14081-5_20


4 Figures and Tables