Skip to main content
SpringerLink
Log in

A New Timestamping Scheme Based on Skip Lists

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Included in the following conference series:

Abstract

Time stamping is a cryptographic technique providing us with a proof-of-existence of a message/document at a given time. Several times-tamping schemes have already been proposed [1-10]. In this paper, we first define a new timestamping scheme which is based on skip lists [11]. Then, we show that our scheme offers nice properties and optimal performances.

This work was supported by the Conseil Général des Landes and the French ministry for research under ACI Sécurité Informatique 2003-2006, Projet CHRONOS.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bayer, D., Haber, S., Stornetta, W.: Improving the efficiency and reliability of digital time-stamping. In: Sequences 1991: Methods in Communication, Security and Computer Science, pp. 329–334 (1992)

    Google Scholar 

  2. Benaloh, J., De Mare, M.: Efficient Broadcast time-stamping. Technical report 1, Clarkson University Department of Mathematics and Computer Science (1991)

    Google Scholar 

  3. Benaloh, J., De Mare, M.: One-way accumulators: A decentralized alternative to digital signatures. Advances in Cryptology (1993)

    Google Scholar 

  4. Buldas, A., Laud, P.: New Linking Schemes for Digital Time-Stamping. In: First International Conference on Information Security and Cryptology (1998)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Buldas, A., Lipmaa, H., Schoenmakers, B.: Optimally efficient accountable time-stamping. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol. 1751, pp. 293–305. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Haber, S., Stornetta, W.S.: How to Time-stamp a Digital Document. Journal of Cryptology: the Journal of the International Association for Cryptologic Research 3(2) (1991)

    Google Scholar 

  8. Massias, H., Quisquater, J.J., Serret, X.: Timestamps: Main issues on their use and implementation. In: Proc. of IEEE 8th International workshop on enabling technologies: Infrastucture for collaborative enterprises (1999)

    Google Scholar 

  9. Massias, H., Quisquater, J.J., Serret, X.: Proc. of the 20th symposium on Information Theory in the Benelux (1999)

    Google Scholar 

  10. Maniatis, P., Giuli, T.J., Baker, M.: Enabling the long-term archival of signed documents through Time Stamping. Technical Report, Computer Science Department, Stanford University, California, USA (2001)

    Google Scholar 

  11. Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Communications of the ACM, 668–676 (1990)

    Google Scholar 

  12. Ansper, A., Buldas, A., Willemson, J.: General linking schemes for digital time-stamping. Technical Report (1999)

    Google Scholar 

  13. Blibech, K., Gabillon, A.: Authenticated dictionary based on skip lists for timestamping systems. In: Proc. of the 12th ACM Conference on Computer Security, Secure Web Services Workshop (2005)

    Google Scholar 

  14. Maniatis, P., Baker, M.: Secure history preservation through timeline entanglement. Technical Report arXiv:cs.DC/0202005, Computer Science department, Stanford University, Stanford, CA, USA (2002)

    Google Scholar 

  15. Maniatis, P.: Historic Integrity in Distributed Systems. PhD thesis, Computer Science Department, Stanford University, Stanford, CA, USA (2003)

    Google Scholar 

  16. Goodrich, M., Tamassia, R.: Efficient authenticated dictionaries with skip lists and commutative hashing. Technical report, Johns Hopkins Information Security Institute (2000)

    Google Scholar 

  17. Goodrich, M., Tamassia, R., Schwerin, A.: Implementation of an authenticated dictionary with skip lists and commutative hashing (2001)

    Google Scholar 

  18. Bonnecaze, A., Liardet, P., Gabillon, A., Blibech, K.: A Distributed time stamping scheme. In: Proc. of the IEEE conference on Signal Image Technology and Internet based Systems (SITIS 2005), Cameroon (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIUPPA/CSySEC, Université de Pau – IUT de Mont de Marsan, France

    Kaouthar Blibech & Alban Gabillon

Authors
  1. Kaouthar Blibech
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alban Gabillon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blibech, K., Gabillon, A. (2006). A New Timestamping Scheme Based on Skip Lists. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_43

Download citation

  • DOI: https://doi.org/10.1007/11751595_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation