Hash-Tree Anti-Tampering Schemes

Moss, Ben and Ashman, Helen (2002) Hash-Tree Anti-Tampering Schemes. In: IEEE International Conference on Information Technology and Applications, November 2002, Bathurst, Australia.

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
33Kb

Abstract

Procedures that provide detection, location and correction of tampering in documents are known as anti-tampering schemes. In this paper we describe how to construct an anti-tampering scheme using a pre-computed tree of hashes. The main problems of constructing such a scheme are its computational feasibility and its candidate reduction process. We show how to solve both problems by the use of secondary hashing over a tree structure. Finally, we give brief comments on our ongoing work in this area.

Item Type:Conference or Workshop Item (Paper)
Schools/Departments:Faculty of Science > School of Computer Science and Information Technology
ID Code:296
Deposited By:Ashman, Helen
Deposited On:14 Nov 2005
Last Modified:09 Oct 2007 16:51

Repository Staff Only: item control page