|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/5035
|
| Title: | Proving Properties of Incremental Merkle Trees |
| Authors: | Ogawa, Mizuhito
Horita, Eiichi
Ono, Satoshi |
| Keywords: | Merkle tree
theorem prover
temporal authentication |
| Issue Date: | 2005 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 3632/2005 |
| Start page: | 424 |
| End page: | 440 |
| DOI: | 10.1007/11532231_31 |
| Abstract: | This paper proves two basic properties of the model of a single attack point-free event ordering system, developed by NTT. This model is based on an incremental construction of Merkle trees, and we show the correctness of (1) completion and (2) an incremental sanity check. These are mainly proved using the theorem prover MONA; especially, this paper gives the first proof of the correctness of the incremental sanity check. |
| Rights: | This is the author-created version of Springer, Mizuhito Ogawa, Eiichi Horita, Satoshi Ono, Lecture Notes in Computer Science, 3632/2005, 2005, 424-440. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/11532231_31 |
| URI: | http://hdl.handle.net/10119/5035 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| C9488.pdf | | 183Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
