Advertisement

Annales Des Télécommunications

, Volume 61, Issue 5–6, pp 662–681 | Cite as

Secure time-stamping schemes: a distributed point of view

  • Alexis Bonnecaze
  • Pierre Liardet
  • Alban Gabillon
  • Kaouther Blibech
Article

Abstract

Time-stamping is a technique used to prove the existence of a digital document prior to a specific point in time. Today, implemented schemes rely on a centralized server model that has to be trusted. We point out the drawbacks of these schemes, showing that the unique serveur represent a weak point for the system. We propose an alternative scheme which is based on a network of servers managed by administratively independent entities. This scheme appears to be a trusted and reliable distributed time-stamping scheme.

Key words

Internet security Distributed system Time stamping Digital document Hashing 

Procédés Sûrs D’horodatage : Un Point de Vue Réparti

Résumé

L’horodatage électronique est une technique qui permet de prouver l’existence d’un document avant un instant précis. Actuellement, les schémas implantés adoptent une architecture centralisée basée sur un serveur jouant le rôle de tiers de confiance. Dans de tels schémas, le serveur d’horodatage représente une faiblesse pour le système. Nous proposons un système basé sur un réseau de serveurs gérés par des entités administrativement indépendantes. Nous montrons que ce schéma distribué est robuste et sûr.

Mots clés

Sécurité Internet Système réparti Horodatage Document numérique Hachage 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [A182]
    Aldous (D.), Random walks on finite groups and rapidly mixing Markov chains, Séminaire de Probabilités XVII (1981/82), 243–297. Lecture Notes in Math. 1059, Springer, Berlin, pp. 245–255, 1983.Google Scholar
  2. [AlDi86]
    Aldous (D.), Diaconis (P.),Shuffling cards and stopping times, Am. Math. Monthly93, pp. 333–348, 1986.MathSciNetzbMATHCrossRefGoogle Scholar
  3. [BenMar91]
    Benaloh (J.),De Mare (M.),Efficient Broadcast time-stamping Technical Report 1, Clarkson University Department of Mathematics and Computer Science, August 1991.Google Scholar
  4. [BendeMar93]
    Benaloh (J.),De Mare (M.),One-Way Accumulators: A Decentralized Alternative to Digital Signatures Advances in Cryptology-Eurocrypt’93.Lncs, vol. 765, pp. 274–285, Springer-Verlag, 1994.Google Scholar
  5. [BliGab05]
    Blibech (K.),Gabillon (A.),chronos: An Authenticated Dictionary Based on Skip Lists forTimestamping Systems, 2005Acm Workshop on Secure Web Services (Sws) November 11, 2005 Fairfax, VA, USA.Google Scholar
  6. [BliGab06]
    Blibech (K.),Gabillon (A.), A NewTimestamping Scheme Based on Skip Lists. To be presented at the next Applied Cryptography and Information Security conference (Acis). Glasgow, May 2006.Google Scholar
  7. [BulLauLipVill98]
    Buldas (A.),Laud (P.),Lipmaa (H.),Villemson (J.)Time-stamping with Binary Linking Schemes, Advances on Cryptology —Crypto′98, Lecture Notes in Computer Science, Springer-Verlag, pp. 486–501, 1998.Google Scholar
  8. [BulLip]
    Buldas (A.),Lipmaa (H.),Digital Signatures, Timestamping and the Corresponding Infrastructure Küberneetika AS, Technical Report, 21 Jan. 98.Google Scholar
  9. [BulLipSch2000]
    Buldas (A.),Lipmaa (H.),Schoenmakers (B.),Optimally Efficient Accountable Time-Stamping, in Yuliang Zheng and Hideki 1mai, editors, Public Key Cryptography′2000, volume 1751 of Lecture Notes in Computer Science, pp. 293–305, Melbourne, Australia, Springer-Verlag, January 18–20, 2000.Google Scholar
  10. [FelMic88]
    Feldman (P.),Micali (S.)Optimal algorithms for Byzantine agreement, Proceedings of the twentieth annualAcm symposium on Theory of computing table of contents Chicago, Illinois, United States pp. 148–161, 1988.Google Scholar
  11. [GabByu01]
    Gabillon (A.),Byun (J-S.), “A Two-Level Time-stamping System”,Ifip/sec′01, Paris, France, 11–13 June 2001.Google Scholar
  12. [HabSto91]
    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), pp. 99–112, 1991.Google Scholar
  13. [Jus98]
    Just (M.),Some Timestamping Protocol Failures, Internet Society Symposium on Network and Distributed System Security, San Diego, CA, Mar 11–13, 1998.Google Scholar
  14. [Knu81]
    Knuth (D.E.),The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, reading Mass., second edition (1981).Google Scholar
  15. [Knuth81]
    Knuth (D.E.),The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, reading Mass., second edition, 1981.Google Scholar
  16. [ManGiuBak0l]
    Maniatis (P.),Giuli (T.J.),Baker (M.),Enabling the Long-Term Archival of Signed Documents through time-stamping, CoRR. cs.DC/0 106058: (2001).Google Scholar
  17. [MasSerQui99]
    Massias (H.),Serret (X.),Quisquater (J.),Timestamps: Main issues on their use and implementation In Proceedings ofIeee 8th International Workshops on enabling Technologies: Infrastructure for Collaborative Enterprises — Fourth International Workshop on Enterprise Security, pp. 178–183, June 1999. ISBN 0-7695-0365-9.Google Scholar
  18. [MasQui97]
    Massias (H.),Quisquater (J.),Timestamps: Main issues on their use and implementation, In Proceedings ofIeee 8th International Workshops on enabling Technologies: Infrastructure for Collaborative Enterprises — Fourth International Workshop on Enterprise Security, pp. 178–183, June 1999.Isbn 0-7695-0365-9.Google Scholar
  19. [Mer79]
    Merkle (P.),Secrecy, authentication, and public key systems, Ph.D. dissertation, Dept. of Electrical Engineering, Stanford Univ., 1979.Google Scholar
  20. [NiWi78]
    Nijenhuis (A.),Wilf (H.S.),Combinatorial Algorithms for Computers and Calculators, Acad. Press, Inc., second ed. 1978.Google Scholar
  21. [Pug90]
    Pugh (W.),Skip Lists:Skip lists: Aprobabilistic alternative to balanced trees, Communications of theAcm, 33(6) pp. 668–676, June 1990.MathSciNetCrossRefGoogle Scholar
  22. [Sl 83]
    Sloane (N.J.A.), Encrypting byRandom Rotations, Cryptography Proceedings of the Workshop on Cryptography, Burg Feuerstein, Germany, Edited by Thomas Beth,Lncs 149 (1983), pp. 71–128.Google Scholar
  23. [Tak99]
    Takura (A.),Ono (S.),Naito (S.)A Secure and trusted Time Satmping Authority, Proceedings ofIws 99, 1999, pp. 12372–128.Google Scholar

Copyright information

© Springer-Verlag France 2006

Authors and Affiliations

  • Alexis Bonnecaze
    • 1
  • Pierre Liardet
    • 2
  • Alban Gabillon
    • 3
  • Kaouther Blibech
    • 3
  1. 1.département Réseaux et MultimédiaLIF; ESIMarseille cedex 09France
  2. 2.LATP; UMR CNRS 6632Université de ProvenceMarseille cedex 13France
  3. 3.CSySEC/LIUPPAUniversité de Pau, IUT de Mont de MarsanMont de Marsan CedexFrance

Personalised recommendations