Efficient Relative Time-Stamping Scheme Based on the Ternary Link

Yuichi IGARASHI; Hidenori KUWAKADO; Hatsukazu TANAKA

Efficient Relative Time-Stamping Scheme Based on the Ternary Link

Yuichi IGARASHI, Hidenori KUWAKADO, Hatsukazu TANAKA

Full Text Views

0

Cite this

Summary :

Relative time-stamping schemes prove the chronological sequence of digital documents and their integrity. Since the chronological sequence is verified by tracing the link between two timestamps, it is desirable that the length of the verification path is short. Buldas, Laud, Lipmaa, and Villemson have proposed the relative time-stamping scheme based on the binary link. In this paper, we extend the binary link to the ternary link, and apply it to the relative time-stamping scheme. We show that the maximum length of the verification path of the proposed scheme is shorter than that of the previous scheme. Moreover, we show that the average length of the proposed scheme is shorter than that of the previous scheme. Thus, the proposed time-stamping schemes is more efficient than the previous scheme.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2552-2559

Publication Date: 2003/10/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Information Security

Cite this

Copy

Yuichi IGARASHI, Hidenori KUWAKADO, Hatsukazu TANAKA, "Efficient Relative Time-Stamping Scheme Based on the Ternary Link" in IEICE TRANSACTIONS on Fundamentals, vol. E86-A, no. 10, pp. 2552-2559, October 2003, doi: .
Abstract: Relative time-stamping schemes prove the chronological sequence of digital documents and their integrity. Since the chronological sequence is verified by tracing the link between two timestamps, it is desirable that the length of the verification path is short. Buldas, Laud, Lipmaa, and Villemson have proposed the relative time-stamping scheme based on the binary link. In this paper, we extend the binary link to the ternary link, and apply it to the relative time-stamping scheme. We show that the maximum length of the verification path of the proposed scheme is shorter than that of the previous scheme. Moreover, we show that the average length of the proposed scheme is shorter than that of the previous scheme. Thus, the proposed time-stamping schemes is more efficient than the previous scheme.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2552/_p

Copy

@ARTICLE{e86-a_10_2552,
author={Yuichi IGARASHI, Hidenori KUWAKADO, Hatsukazu TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Relative Time-Stamping Scheme Based on the Ternary Link},
year={2003},
volume={E86-A},
number={10},
pages={2552-2559},
abstract={Relative time-stamping schemes prove the chronological sequence of digital documents and their integrity. Since the chronological sequence is verified by tracing the link between two timestamps, it is desirable that the length of the verification path is short. Buldas, Laud, Lipmaa, and Villemson have proposed the relative time-stamping scheme based on the binary link. In this paper, we extend the binary link to the ternary link, and apply it to the relative time-stamping scheme. We show that the maximum length of the verification path of the proposed scheme is shorter than that of the previous scheme. Moreover, we show that the average length of the proposed scheme is shorter than that of the previous scheme. Thus, the proposed time-stamping schemes is more efficient than the previous scheme.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - Efficient Relative Time-Stamping Scheme Based on the Ternary Link
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2552
EP - 2559
AU - Yuichi IGARASHI
AU - Hidenori KUWAKADO
AU - Hatsukazu TANAKA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2003
AB - Relative time-stamping schemes prove the chronological sequence of digital documents and their integrity. Since the chronological sequence is verified by tracing the link between two timestamps, it is desirable that the length of the verification path is short. Buldas, Laud, Lipmaa, and Villemson have proposed the relative time-stamping scheme based on the binary link. In this paper, we extend the binary link to the ternary link, and apply it to the relative time-stamping scheme. We show that the maximum length of the verification path of the proposed scheme is shorter than that of the previous scheme. Moreover, we show that the average length of the proposed scheme is shorter than that of the previous scheme. Thus, the proposed time-stamping schemes is more efficient than the previous scheme.
ER -