CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Digital Image Processing (3rd Edition)
Digital Image Processing (3rd Edition)
Cryptographic hashing for virus localization
Proceedings of the 4th ACM workshop on Recurring malcode
Explicit Non-adaptive Combinatorial Group Testing Schemes
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Digital Watermarking and Steganography
Digital Watermarking and Steganography
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Combinatorial group testing for corruption localizing hashing
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Indexing information for data forensics
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Nonrandom binary superimposed codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Data forensics needs techniques that gather digital evidence of data corruption. While techniques like error correcting codes, disjunct matrices and cryptographic hashing are frequently studied and used in practical applications, very few research efforts have been done to rigorously evaluate and combine benefits of these techniques for data forensics purposes. In this paper we formulate unifying algorithm, data and security models that allow to evaluate and prove the security guarantees provided by direct forensic encoding constructions from these techniques and suitable combinations of them.We rigorously clarify the different security guarantees provided by using these techniques (alone or in some standard or novel combinations) for both data at rest and data in transit. Our most novel construction provides a forensic encoding scheme that allows to detect if any errors were introduced by corrupted data senders, does not allow data intruders to detect whether the data was encoded or not, and requires no data expansion in a large-min-entropy data model, as typical in multimedia data.