Non-Blind Watermarking of Network Flows

  title={Non-Blind Watermarking of Network Flows},
  author={Amir Houmansadr and N. Kiyavash and N. Borisov},
  journal={IEEE/ACM Transactions on Networking},
  • Amir Houmansadr, N. Kiyavash, N. Borisov
  • Published 2014
  • Computer Science
  • IEEE/ACM Transactions on Networking
  • Linking network flows is an important problem in intrusion detection as well as anonymity. Passive traffic analysis can link flows, but requires long periods of observation to reduce errors. Active traffic analysis, also known as flow watermarking, allows for better precision and is more scalable. Previous flow watermarks introduce significant delays to the traffic flow as a side effect of using a blind detection scheme; this enables attacks that detect and remove the watermark, while at the… CONTINUE READING
    31 Citations
    Network Flow Watermarking: A Survey
    • 21
    The Need for Flow Fingerprints to Link Correlated Network Flows
    • 33
    • PDF
    Using Insider Swapping of Time Intervals to Perform Highly Invisible Network Flow Watermarking
    Network flow watermarking method based on centroid matching of interval group
    • M. Lin, G. Liu, W. Liu, Y. Dai
    • Mathematics
    • 2015 IEEE International Conference on Progress in Informatics and Computing (PIC)
    • 2015
    • 2
    Delay Normalization Interference Resistance Packet Order Based Flow Watermarking Technology
    PN Code Diversification Based Spread Spectrum Flow Watermarking Technology
    A Comprehensive Analysis of Interval Based Network Flow Watermarking


    Secure spread spectrum watermarking for multimedia
    • 5,726
    • Highly Influential
    • PDF
    RAINBOW: A navadopanj Robust And Invisible Non-Blind Watermark for Network Flows
    • NDSS. The Internet Society, 2009.
    • 2009