New linking schemes for digital time-stamping 1
Download:
by Ahto Buldas, Peeter Laud
http://www.cyber.ee/research/publications/oplink.pdf
Add To MetaCart
Abstract:
Abstract. Binary Linking Schemes (BLS) for digital time-stamping [3] provide (1) relative temporal authentication to be performed in logarithmic time, and (2) time-certi cates of reasonable size, which together with the data published in a widely available medium enable the veri er to establish their relative temporal positions, even if the database held by the Time-Stamping Service (TSS) ceases to exist. We showthat the size of a time-certi cate (X) of a document X in the scheme presented in [3] is bounded by 4 log N where k is the output size of the hash 2 function and N is the number of time-stamps issued. We then present
Citations
| 171 | Protocols for Public Key Cryptosystems – Merkle - 1980 |
| 153 | Stornella, “How to time-stamp a digital document – Haber, Scott - 1991 |
| 60 | Timestamping with Binary Linking Schemes – Buldas, Laud, et al. - 1998 |
| 20 | Secure names for bit-strings – Haber, Stornetta - 1991 |
| 18 | Some Timestamping Protocol Failures – Just - 1998 |
| 17 | Ecient Broadcast Time-Stamping – Benaloh, Mare - 1991 |
| 6 | A Certi ed Digital Signature – Merkle - 1990 |
| 4 | Improving the E ciency and Reliability of Digital Time-Stamping – Bayer, Haber, et al. - 1992 |
| 4 | Digital time-stamping to support non repudiation in electronic communications – Pinto - 1996 |
