Indexing Information for Data Forensics

DOI10.1007/11496137_15zbMATH Open1126.68395OpenAlexW1515124366WikidataQ60962398 ScholiaQ60962398MaRDI QIDQ3593145FDOQ3593145

Authors: Roberto Tamassia, Michael T. Goodrich, Mikhail J. Atallah 

Publication date: 24 September 2007

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11496137_15

Recommendations

• Locating modifications in signed data for partial data integrity
• On indexing evidential data
• Making data structures persistent
• Improved Dynamic Text Indexing
• Lossless fault-tolerant data structures with additive overhead

zbMATH Keywords

data structuresinformation hidingcombinatorial group testingdata integritydata forensicstamper detectiondata marking

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (8)

• A tree-covering problem arising in integrity of tree-structured data
• Efficiently decodable error-correcting list disjunct matrices and applications (extended abstract)
• Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
• A survey of cover-free families: constructions, applications, and generalizations
• Data warehouse for event streams violating rules
• Locating modifications in signed data for partial data integrity
• Non-adaptive Group-Testing Aggregate MAC Scheme
• Modification tolerant signature schemes: location and correction

This page was built for publication: Indexing Information for Data Forensics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593145)