UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

On Optimal Hash Tree Traversal for Interval Time-Stamping

Lipmaa, H; (2002) On Optimal Hash Tree Traversal for Interval Time-Stamping. In: Chan, A and Gligor, V, (eds.) Lecture Notes in Computer Science. (pp. 357 - 371). Springer-Verlag

Full text not available from this repository.


Type:Proceedings paper
Title:On Optimal Hash Tree Traversal for Interval Time-Stamping
Event:Information Security Conference 2002
Keywords:Analysis of algorithms, implementation complexity, interval time-stamping, Laplace's method for integrals, tree traversal
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Adastral Park

Archive Staff Only: edit this record