Conference ProceedingsOPEN ACCESS

Time-stamping with binary linking schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1462 486-501
DOI: 10.1007/BFb0055749
74Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We state the basic requirements for time-stamping systems applicable as the necessary support to the legal use of electronic documents. We analyze the main drawbacks of the time-stamping systems proposed to date and present a new system that meets all the stated requirements. We prove that these requirements cannot be significantly tightened.

Cite

CITATION STYLE

APA

Buldas, A., Laud, P., Lipmaa, H., & Villemson, J. (1998). Time-stamping with binary linking schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1462, pp. 486–501). Springer Verlag. https://doi.org/10.1007/BFb0055749

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free