Location of Repository

Indexing Information for Data Forensics

By Mikhail J. Atallah, Michael T. Goodrich and Roberto Tamassia


We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values specifically identified. We give forensic constructions for several fundamental data structures, including arrays, linked lists, binary search trees, skip lists, and hash tables. Some of our constructions are based on a new reduced-randomness construction for nonadaptive combinatorial group testing

Topics: data forensics, data integrity, data marking, combinatorial group testing
Year: 2005
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX

Suggested articles


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