Presentation 2004-11-09
Implentation Mechanisms of Scalable Event-Ordering System without Single Point of Attack
Eiichi Horita, Satoshi Ono, Hidetaka Ishimoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose event-ordering system that receives digital data items derived from events made by clcints of the system, and links the data items by means of a collision-resistant one-way hash function and tree structures, thereby making it possible to prove the tcrmporal ordering of the events. The system achieves scalability and there is no single point of attack in it.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) timestamping / hash function / Mcrklc tree
Paper # ISEC2004-85,OIS2004-52
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/11/2(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Implentation Mechanisms of Scalable Event-Ordering System without Single Point of Attack
Sub Title (in English)
Keyword(1) timestamping
Keyword(2) hash function
Keyword(3) Mcrklc tree
1st Author's Name Eiichi Horita
1st Author's Affiliation NTT Information Sharing Platform Laboratories()
2nd Author's Name Satoshi Ono
2nd Author's Affiliation NTT Information Sharing Platform Laboratories
3rd Author's Name Hidetaka Ishimoto
3rd Author's Affiliation NTT Information Sharing Platform Laboratories
Date 2004-11-09
Paper # ISEC2004-85,OIS2004-52
Volume (vol) vol.104
Number (no) 422
Page pp.pp.-
#Pages 8
Date of Issue