Proving properties of incremental merkle trees

Authors:
Mizuhito Ogawa;Eiichi Horita;Satoshi Ono
Affiliations:
Japan Advanced Institute of Science and Technology, Ishikawa, Japan;NTT Information Sharing Platform Laboratories, Tokyo, Japan;Kogakuin University, Tokyo, Japan
Venue:
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Year:
2005

Citing 6
Cited 0

Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Optimally Efficient Accountable Time-Stamping

PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Sequentiality, Second-order Monadic Logic and Tree Automata

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Secrecy, authentication, and public key systems.

Secrecy, authentication, and public key systems.
Fractal Merkle tree representation and traversal

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic

Quantified Score

Hi-index	0.00

Visualization

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.