Indexing Information for Data Forensics

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.

• Type: Conference
• Year: 2005
• Where: ACNS
• Authors: Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia
• Keywords: ACNS 2005, Binary Search Trees, Cryptography, Fundamental Data Structures, Nonadaptive Combinatorial Group