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.

Full text not available from this repository.

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)
RIS ID: https://nottingham-repository.worktribe.com/output/1022908
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Ashman, Helen
Date Deposited: 14 Nov 2005
Last Modified: 04 May 2020 20:32
URI: http://eprints.nottingham.ac.uk/id/eprint/296

Actions (Archive Staff Only)

Edit View Edit View