On Optimal Hash Tree Traversal for Interval Time-Stamping
- 5 September 2002
- book chapter
- Published by Springer Nature
- p. 357-371
- https://doi.org/10.1007/3-540-45811-5_28
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Efficient Algorithms for Computing Differential Properties of AdditionPublished by Springer Nature ,2002
- Optimally Efficient Accountable Time-StampingPublished by Springer Nature ,2000
- Time-stamping with binary linking schemesPublished by Springer Nature ,1998
- Improving the Efficiency and Reliability of Digital Time-StampingPublished by Springer Nature ,1993
- How to time-stamp a digital documentJournal of Cryptology, 1991
- Protocols for Public Key CryptosystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980