Hash-Tree Anti-Tampering Schemes
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 fea...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2002
|
| Online Access: | https://eprints.nottingham.ac.uk/296/ |
| _version_ | 1848790388873101312 |
|---|---|
| author | Moss, Ben Ashman, Helen |
| author_facet | Moss, Ben Ashman, Helen |
| author_sort | Moss, Ben |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T18:11:50Z |
| format | Conference or Workshop Item |
| id | nottingham-296 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T18:11:50Z |
| publishDate | 2002 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-2962020-05-04T20:32:25Z https://eprints.nottingham.ac.uk/296/ Hash-Tree Anti-Tampering Schemes Moss, Ben Ashman, Helen 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. 2002 Conference or Workshop Item PeerReviewed Moss, Ben and Ashman, Helen (2002) Hash-Tree Anti-Tampering Schemes. In: IEEE International Conference on Information Technology and Applications, November 2002, Bathurst, Australia. |
| spellingShingle | Moss, Ben Ashman, Helen Hash-Tree Anti-Tampering Schemes |
| title | Hash-Tree Anti-Tampering Schemes |
| title_full | Hash-Tree Anti-Tampering Schemes |
| title_fullStr | Hash-Tree Anti-Tampering Schemes |
| title_full_unstemmed | Hash-Tree Anti-Tampering Schemes |
| title_short | Hash-Tree Anti-Tampering Schemes |
| title_sort | hash-tree anti-tampering schemes |
| url | https://eprints.nottingham.ac.uk/296/ |