A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Text compression
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
IBM Systems Journal
Linear Algorithm for Data Compression via String Matching
Journal of the ACM (JACM)
Information Hiding Techniques for Steganography and Digital Watermarking
Information Hiding Techniques for Steganography and Digital Watermarking
Natural Language Watermarking: Design, Analysis, and a Proof-of-Concept Implementation
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Document marking and identification using both line and word shifting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Electronic marking and identification techniques to discourage document copying
IEEE Journal on Selected Areas in Communications
Lossy dictionary-based image compression method
Image and Vision Computing
Watermarking Relational Databases Using Optimization-Based Techniques
IEEE Transactions on Knowledge and Data Engineering
Watermarking for Authentication of LZ-77 Compressed Documents
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
MP4Stego: steganography in MPEG-4 videos
International Journal of Advanced Media and Communication
MP4Stego: esteganografia em vídeos MPEG-4
Proceedings of the 14th Brazilian Symposium on Multimedia and the Web
A bandwidth efficiency of lempel-ziv scheme for data authentication
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
| Hi-index | 0.00 |
The formidable dissemination capability allowed by the current network technology makes it increasingly important to devise new methods to ensure authenticity. Nowadays it is common practice to distribute documents in compressed form. In this paper, we propose a simple variation on the classic LZ-77 algorithm that allows one to hide, within the compressed document, enough information to warrant its authenticity. The design is based on the unpredictability of a certain class of pseudo-random generators, in such a way that the hidden data cannot be retrieved in a reasonable amount of time by an attacker (unless the secret bit-string key is known). Since it can still be decompressed by the original LZ-77 algorithm, the embedding is completely "transparent". Preliminary experiments show also the degradation in compression due to the embedding is almost negligible.