A Secure Round-Based Timestamping Scheme with Absolute Timestamps (Short Paper)

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5352)


The aim of timestamping systems is to provide a proof-of-existence of a digital document at a given time. Such systems are important to ensure integrity and non-repudiation of digital data over time. Most of the existing timestamping schemes use the notions of round (a period of time) and round token (a single value aggregating the timestamping requests received during one round). Such schemes have the following drawbacks: (i) Clients who have submitted a timestamping request must wait for the end of the round before receiving their timestamping certificate (ii) TimeStamping Authorities (TSA) based on such schemes are discrete-time systems and provide relative temporal authentication only, i.e. all the documents submitted during the same round are timestamped with the same date and time. (iii) the TSA can tamper timestamps before the round token is published in a widely distributed media. In this paper, we define a new timestamping scheme which overcomes these drawbacks.


Timestamping scheme Merkle tree Chameleon hash function Absolute timestamp 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adams, C., Cain, P., Pinkas, D., Zuccherato, R.: Internet X.509 Public Key Infrastructure Time-Stamp Protocol, TSP (2001)Google Scholar
  2. 2.
    Bayer, D., Haber, S., Stornetta, W.S.: Improving the efficiency and reliability of digital time-stamping. In: Sequences II: Methods in Communication, Security, and Computer Science, London, UK, pp. 329–334. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  3. 3.
    Benaloh, J., de Mare, M.: Efficient broadcast time-stamping. Technical Report 1 TR-MCS-91-1, Clarkson University Department of Mathematics and Computer Science (August 1991)Google Scholar
  4. 4.
    Blibech, K., Gabillon, A.: A new timestamping scheme based on skip lists. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3982, pp. 395–405. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Bonnecaze, A.: A multi-signature for time stamping scheme. In: SAR/SSI 2006: The 1st Conference On Security in Network Architectures and Information Systems, Seignosse, France (June 2006)Google Scholar
  6. 6.
    Bonnecaze, A., Liardet, P., Gabillon, A., Blibech, K.: Secure time-stamping schemes: A distributed point of view. Annals of Telecommunications 61(5-6), 662–681 (2006)CrossRefGoogle Scholar
  7. 7.
    Bonnecaze, A., Trebuchet, P.: Threshold signature for distributed time stamping scheme. Annals of telecommunications 62(11-12), 1353–1363 (2007)Google Scholar
  8. 8.
    Buldas, A., Laud, P., Lipmaa, H., Villemson, J.: Time-stamping with binary linking schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 486–501. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  9. 9.
    Buldas, A., Laur, S.: Do broken hash functions affect the security of time-stamping schemes? In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol. 3989, pp. 50–65. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Buldas, A., Lipmaa, H.: Digital signatures, timestamping and the corresponding infrastructure. Technical report, Küberneetika AS (2000)Google Scholar
  11. 11.
    Chaum, D., Pedersen, T.P.: Wallet Databases with Observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89–105. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  12. 12.
    Crutchfield, C., Molnar, D., Turner, D., Wagner, D.: Generic on-line/off-line threshold signatures. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 58–74. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  13. 13.
    Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51–83 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Haber, S., Stornetta, W.S.: How to Time-Stamp a Digital Document. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 437–455. Springer, Heidelberg (1991)Google Scholar
  15. 15.
    Haber, S., Stornetta, W.S.: Secure names for bit-strings. In: ACM Conference on Computer and Communications Security, pp. 28–35 (1997)Google Scholar
  16. 16.
    Just, M.: Some timestamping protocol failures. In: NDSS 1998: Proceedings of the Symposium on Network and Distributed Security, San Diego, CA, USA, pp. 89–96 (March 1998)Google Scholar
  17. 17.
    Krawczyk, H., Rabin, T.: Chameleon signatures. In: NDSS (2000)Google Scholar
  18. 18.
    Matsuo, S., Oguro, H.: User-side forward-dating attack on timestamping protocol. In: Proc. of the 3rd International Workshop for Applied Public Key Infrastructure (IWAP 2004), pp. 72–83 (2004)Google Scholar
  19. 19.
    Merkle, R.C.: Secrecy, authentication, and public key systems. PhD thesis (1979)Google Scholar
  20. 20.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Shamir, A., Tauman, Y.: Improved online/offline signature schemes. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 355–367. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  22. 22.
    Takura, A., Ono, S., Naito, S.: A secure and trusted time stamping authority. In: IWS 1999: Internet Workshop, Osaka, Japan, pp. 88–93. IEEE Computer Society, Los Alamitos (1999)CrossRefGoogle Scholar
  23. 23.
    Tulone, D.: A secure and scalable digital time-stamping service (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  1. 1.Laboratoire LIUPPA, IUT de Mont de Marsan, 40004 Mont de MarsanFrance
  2. 2.Laboratoire IML, Université de la Méditerranée, 13288 Marseille cedex 09France
  3. 3.Laboratoire GePaSud, Université de la Polynésie Française, 98702 FAA’A - Tahiti - Polynésie françaiseFrance

Personalised recommendations