Welcome to the resource topic for 2005/198
Title:
Universally Composable Time-Stamping Schemes with Audit
Authors: Ahto Buldas, Peeter Laud, Märt Saarepera, Jan Willemson
Abstract:We present a universally composable time-stamping scheme based on universal one-way hash functions.
The model we use contains an ideal auditing functionality
(implementable in the Common Reference String model),
the task of which is to check that the rounds’ digests are correctly computed.
Our scheme uses hash-trees and is just a slight modification of the known
schemes of Haber-Stornetta and Benaloh-de Mare, but both the modifications and the audit functionality
are crucial for provable security.
The scheme turns out to be nearly optimal –
we prove that in every universally composable auditable time-stamping scheme,
almost all time stamp requests must be communicated to the auditor.
ePrint: https://eprint.iacr.org/2005/198
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .