Invisible Flow Watermarks for Channels with Dependent Substitution, Deletion, and Bursty Insertion Errors
Xun Gong, Mavis Rodrigues, Negar Kiyavash

TL;DR
This paper introduces an invisible flow watermarking scheme that is robust against packet insertions, deletions, and substitution errors by embedding watermarks in inter-packet delays and using error correction.
Contribution
It presents a novel watermarking method that maintains invisibility and robustness against complex network errors, including insertions and deletions, which previous schemes did not effectively handle.
Findings
Robust against packet losses and insertions
Maintains invisibility under network jitter
Effective error correction for desynchronization
Abstract
Flow watermarks efficiently link packet flows in a network in order to thwart various attacks such as stepping stones. We study the problem of designing good flow watermarks. Earlier flow watermarking schemes mostly considered substitution errors, neglecting the effects of packet insertions and deletions that commonly happen within a network. More recent schemes consider packet deletions but often at the expense of the watermark visibility. We present an invisible flow watermarking scheme capable of enduring a large number of packet losses and insertions. To maintain invisibility, our scheme uses quantization index modulation (QIM) to embed the watermark into inter-packet delays, as opposed to time intervals including many packets. As the watermark is injected within individual packets, packet losses and insertions may lead to watermark desynchronization and substitution errors. To…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Cellular Automata and Applications · Internet Traffic Analysis and Secure E-voting
