Efficient Relative Time-Stamping Scheme Based on the Ternary Link(Information Security)(<Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
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 timestamping schemes is more efficient than the previous scheme
- 社団法人電子情報通信学会の論文
- 2003-10-01
著者
-
Igarashi Yuichi
The Graduate School Of Science And Technology Kobe University
-
KUWAKADO Hidenori
the Faculty of Engineering, Kobe University
-
TANAKA Hatsukazu
the Faculty of Engineering, Kobe University
-
Kuwakado Hidenori
The Faculty Of Engineering Kobe University
-
Tanaka Hatsukazu
The Faculty Of Engineering Kobe University
関連論文
- Efficient Relative Time-Stamping Scheme Based on the Ternary Link(Information Security)(Information Theory and Its Applications)
- Message Authentication for Stream(Special Section on Cryptography and Information Security)
- A New Digital Watermarking Scheme Applying Locally the Wavelet Transform
- A Code Construction for M-Choose-T Communication over the Multiple-Access Adder Channel
- Equivalent Keys in RC6-32/20/176(Special Section on Information Theory and Its Applications)
- Improvement on the Cheater Identifiable Threshold Scheme(Special Section on Fundamentals of Information and Communications)
- New Algorithm for Finding Preimages in a Reduced Version of the MD4 Compression Function(Special Section on Cryptography and Information Security)