DocumentCode :
3090811
Title :
A temporal order resolution algorithm in the multi-server time stamp service framework
Author :
Ting, Pei-Yih
Author_Institution :
Dept. of Comput. Sci., Nat. Taiwan Ocean Univ., Keelung, Taiwan
Volume :
2
fYear :
2005
fDate :
28-30 March 2005
Firstpage :
445
Abstract :
This paper describes solutions to resolve chronological orders of time stamps issued by multiple time stamp authorities (TSAs). The communication, computation, and storage overhead to provide such a service is considerably low. The correctness of the proposed algorithm is proved and the worst-case computation bound is also derived. The proposed resolution algorithm and the supporting "cross reference mark" server strategy can be applied in a multi-server timestamp service (TSS) framework with trusted or distrusted servers to obtain deterministic time stamp comparison results.
Keywords :
digital signatures; network servers; public key cryptography; ubiquitous computing; algorithm correctness proving; chronological order; communication overhead; computation overhead; cross reference mark server; deterministic time stamp; distrusted server; multiserver time stamp service; storage overhead; temporal order resolution algorithm; trusted server; Authentication; Clocks; Computer science; Digital signatures; Frequency estimation; Frequency synchronization; Network servers; Oceans; Public key; Secure storage;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Information Networking and Applications, 2005. AINA 2005. 19th International Conference on
ISSN :
1550-445X
Print_ISBN :
0-7695-2249-1
Type :
conf
DOI :
10.1109/AINA.2005.71
Filename :
1423730
Link To Document :
بازگشت