The Design & Analysis of Time-Stamp Protocol with H-Binary Tree


The KIPS Transactions:PartC, Vol. 9, No. 6, pp. 817-822, Dec. 2002
10.3745/KIPSTC.2002.9.6.817,   PDF Download:

Abstract

We want to find a timestamping method which improves efficient performance and have high-level security to send secured messages in the digital signature and the law of e-commerces. Our paper shows a H-binary tree of time stamp to use a time stamp protocol with high security and performance in the packets of sending messages. We implement and analyze the protocols, show to compare with previous RSA methods. Our proposed protocol has O(log n) time complexity and high-performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. W. Jung, K. H. Do, M. S. Jun, "The Design & Analysis of Time-Stamp Protocol with H-Binary Tree," The KIPS Transactions:PartC, vol. 9, no. 6, pp. 817-822, 2002. DOI: 10.3745/KIPSTC.2002.9.6.817.

[ACM Style]
Kyung Won Jung, Kyoung Hwa Do, and Moon Seog Jun. 2002. The Design & Analysis of Time-Stamp Protocol with H-Binary Tree. The KIPS Transactions:PartC, 9, 6, (2002), 817-822. DOI: 10.3745/KIPSTC.2002.9.6.817.