Signal and Information Processing

Multi-flow Attack Resistance Based on Reordering of Watermark Bits

Expand
  • 1. College of Cyberspace Security, PLA Information Engineering University, Zhengzhou 450001, China
    2. Beijing 302 Hospital, Beijing 100039, China

Received date: 2011-11-20

  Revised date: 2012-03-06

  Online published: 2012-03-06

Abstract

Network flow watermarking is a technique for active tracing of network attacks. Multi-flow attack makes use of dependences among different watermarked network flows, and thus poses a great challenge to the applicability of flow watermarking. This paper proposes a multi-flow attack resistance method based on reordering of watermark bits that combats the multi-flow attack. The method randomizes the bit order of the watermark message across multiple flows based on different random seeds, therefore effectively removing cross-correlations among watermarked flows. Theoretical analysis and experimental evaluation show that the proposed method is robust against multi-flow attack. Compared with insertion position randomization, the method is more effective in resisting multi-flow attack. It neither increase false positive rate, nor requires high computation cost.

Cite this article

WANG Zhen-xing1, ZHANG Lian-cheng1, GUO Yi1, LI Shuo2 . Multi-flow Attack Resistance Based on Reordering of Watermark Bits[J]. Journal of Applied Sciences, 2013 , 31(3) : 278 -284 . DOI: 10.3969/j.issn.0255-8297.2013.03.010

References

[1] BAE K, ANDREWS J G, POWERS E J. Quantifying and interative clipping and filtering technique for reducing PAP in OFDM [J]. IEEE Transactions on Wireless Communications, 2010, 9(5): 1558-1563.

[2] HOU J, GE J, ZHAI D. Peak-to-average power ratio reduction of OFDM signals with nonlinear companding scheme [J]. IEEE Transactions Broadcasting, 2010, 56(2): 258-262.

[3] DAVIS J A, JEDWAB J. Peak-to-mean power control in OFDM golay complementary sequences and Reed-Muller codes [J]. IEEE Transactions on Information Theory, 1999, 45(7): 2397-2417.

[4] TELLAMBURA C. Use of m-sequence for OFDM peak-to-average power ratio reduction [J]. Electronics Letters, 1997, 33(15):15-16.

[5] LI C P, WANG S H, WANG C L. Novel low-complexity SLM schemes for PAPR reduction in OFDM Systems [J]. IEEE Transactions on Signal Processing, 2010, 58(5): 2916-2921.

[6] GU X, BAEK S, PARK S. PAPR reduction of OFDM signal using an efficient SLM technique [C]//International Conference on Advanced Communication Technology, 2010, 2: 324-328.

[7] WANG Lingyin, CAO Yenwen. Sub-optimum PTS for PAPR reduction of OFDM signals [J]. IEEE Electronics Letters, 2008, 44(15):921-922.

[8] ZHOU Yang, JIANG Tao. A novel multi-points square mapping combined with PTS to reduce PAPR of OFDM signals without side information [J]. IEEE Transactions on Broadcasting, 2009, 55(4): 831-835.

[9] HENRIK S, CHRISTIAN L. Theory and application of OFDM and CDMA [M]. New York, John Wiley & Sons, Ltd. 2005: 145-264.

[10] CHEN Jung-Chieh. Partial transmit sequences for peak-to- average power ratio reduction of OFDM signals with the cross-entropy method [J]. IEEE Signal Processing Letters, 2009, 16(6): 545-548.

[11] TASPINAR N, KARABOGA D, YILDIRIM M. PAPR reduction using artificial bee colony algorithm in OFDM systems [J]. Turk Journal of Electronic Engineering & Computer Science, 2011, 19(1): 47-58.

[12] WANG Y J, CHEN W, TELLAMBURA C. PAPR reduction method based on parametric minimum cross entropy for OFDM signals [J]. IEEE Communication letters, 2010, 14(6): 563-565.

[13] WONG S H, MADHUKUMAR A S, CHIN F. Peak-to- average power reduction using partial transmit sequences: a suboptimal approach based on dual layered phase sequencing [J]. IEEE Transactions on Broadcasting, 2003, 49(2): 225-231.
Outlines

/