Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11496137_15 | ACNS |
Keywords | Field | DocType |
novel technique,data forensics,hash table,new reduced-randomness construction,nonadaptive combinatorial group testing,indexing structure,changed value,binary search tree,indexing information,original version,fundamental data structure,forensic construction,data structures,data integrity,group testing,indexation,information hiding,data structure,skip list | Data structure,Linked list,Computer security,Computer science,Skip list,Information hiding,Search engine indexing,Theoretical computer science,Data integrity,Binary search tree,Hash table | Conference |
Volume | ISSN | ISBN |
3531 | 0302-9743 | 3-540-26223-7 |
Citations | PageRank | References |
39 | 1.72 | 50 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael T. Goodrich | 1 | 4351 | 331.47 |
| Mikhail J. Atallah | 2 | 3828 | 340.54 |
| R Tamassia | 3 | 4686 | 550.39 |