Indextree: An efficient tamper-evidence logging

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Data integrity is critical for many applications. With huge amount of data shared with the cloud computing platform, i.e. Amazon S3, GFS, Apache Hadoop etc, the risk of damage is increasing at the same time. Equivocation is a powerful tool that malicious nodes can use to poison the states of honest nodes and escape punishment. Accountability which makes the system actions verifiable has become the first-class citizen in distributed system design. Tamper-evidence logging is a useful utility to construct accountable system, and is used in different self-certify systems. In this paper, we present IndexTree which is a utility for tamper-evidence logging construction. IndexTree supports efficient proof generation and verification and its proof size is much smaller which is convenient to exchange among distributed nodes. Experiments show IndexTree has advantages in proof size, proof generation and verification compared with AASL.

Original languageEnglish
Title of host publicationProceedings - 2010 12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010
Pages701-706
Number of pages6
DOIs
StatePublished - 2010
Event2010 12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010 - Melbourne, VIC, Australia
Duration: 1 Sep 20103 Sep 2010

Publication series

NameProceedings - 2010 12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010

Conference

Conference2010 12th IEEE International Conference on High Performance Computing and Communications, HPCC 2010
Country/TerritoryAustralia
CityMelbourne, VIC
Period1/09/103/09/10

Keywords

  • Accountability
  • Data integrity
  • Equivocation
  • Merkle tree
  • Tamper-evidence

Fingerprint

Dive into the research topics of 'Indextree: An efficient tamper-evidence logging'. Together they form a unique fingerprint.

Cite this