Skip to main content
Article thumbnail
Location of Repository

Hash-Tree Anti-Tampering Schemes

By Ben Moss and Helen Ashman

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

Year: 2002
OAI identifier: oai:eprints.nottingham.ac.uk:296
Provided by: Nottingham ePrints

Suggested articles

Citations

  1. (1993). A New Signature Scheme Based on the DSA Giving Message Recovery,”
  2. (2001). And now for something completely different: looking ahead to new encryption and secrecy protocols,”
  3. (2000). Hashes DO Grow on Trees - Document Integrity at Every Level,”
  4. (1995). Institute of Standards and Technology, doi
  5. (1980). Protocols for Public Key Cryptosystems,”
  6. (1984). The Quadtree and Related Hierarchical doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.