On Optimal Hash Tree Traversal for Interval Time-Stamping-Reference-Cited by-同舟云学术

On Optimal Hash Tree Traversal for Interval Time-Stamping

Published:2002 Issue: Volume: Page:357-371
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Lipmaa Helger

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45811-5_28

Reference15 articles.

1. Josh Benaloh and Michael de Mare. Efficient Broadcast Time-stamping. Technical Report 1, Clarkson University Department of Mathematics and Computer Science, August 1991.

2. Dave Bayer, Stuart A. Haber, and Wakefield Scott Stornetta. Improving the Efficiency And Reliability of Digital Time-stamping. In Sequences’91: Methods in Communication, Security, and Computer Science, pages 329–334. Springer-Verlag, 1992.

3. Ahto Buldas and Peeter Laud. New Linking Schemes for Digital Time-stamping. In The 1st International Conference on Information Security and Cryptology, pages 3–14, Seoul, Korea, 18–19 December 1998. Korea Institute of Information Security and Cryptology.

4. Lect Notes Comput Sci;A. Buldas,1998

5. Lect Notes Comput Sci;A. Buldas,2000

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Post Quantum Cryptography Algorithms: A Review and Applications;Proceedings of 7th ASRES International Conference on Intelligent Technologies;2023

2. Token Model and Interpretation Function for Blockchain-Based FinTech Applications;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-01-01

3. An Efficient Device Authentication Protocol Without Certification Authority for Internet of Things;Wireless Personal Communications;2016-05-11

4. Stamp and Extend – Instant But Undeniable Timestamping Based on Lazy Trees;Trusted Systems;2012

5. Optimal Trade-Off for Merkle Tree Traversal;Communications in Computer and Information Science;2007