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. (IACR ePrint Archive 2002/124 ). IACR

Full text not available from this repository.
Type: Report
Title: On Optimal Hash Tree Traversal for Interval Time-Stamping
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
URI: http://discovery.ucl.ac.uk/id/eprint/173563
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item