基于平滑分组的分组间隔时间流水印方法

doi:10.11959/j.issn.1000-436x.2017196

Abstract

Abstract:

To improve the self-correction ability and resist the entropy-based detection,a flow watermarking approach based on the inter-packets delays with smooth crossed grouping was proposed.Such an approach extended the watermarking methods using both the convolutional code and the smooth group methods to embed the watermarks into packet flows.By adjusting the inter-packets delays of the crossed packets,the transmission time distribution of the watermarked packets can indefinitely approach to that of any normal packets transmission times.Furthermore,the approach can mitigate the negative consequences introduced by packets transmission jitters,packets losses,packets aggregations and packets divisions for the watermarks detection.Both theoretical analysis and experimental results show that the proposed approach overweight the known watermarking methods from the aspects of identification accuracy,robustness and hiddenness.

Key words: packets flow watermarking, smooth crossed grouping, inter-packet delay, convolutional code

CLC Number:

TP393.08

Hua JIN,Hui ZHU,Chang-da WANG. Packets flow watermarking method based on the inter-packet delay with smooth crossed grouping[J]. Journal on Communications, 2017, 38(10): 36-46.

Figures/Tables 16

References 16

[12]	LUO X , ZHANG J , PERDISCI R ,et al. On the secrecy of spread-spectrum flow watermarks[C]// European Symposium on Research in Computer Security. 2010: 232-248.
[13]	DENGLE S , LOMTE S . Active watermarking approach in detecting encrypted traffic attack by making correlation scheme robust[J]. International Journal of Science and Research, 2014,8(3): 691-695.
[14]	QURESHI A , MEGíAS D , RIFà-POUS H . Framework for preserving security and privacy in peer-to-peer content distribution systems[J]. Expert Systems with Applications, 2015,42(3): 1391-1408.
[15]	GIANVECCHIO S , WANG H . DSSS-based flow marking technique for invisible traceback channels:an entropy-based approach[C]// ACM Conference on Computer and Communications Security. 2007: 307-316.
[1]	何高峰, 杨明, 罗军舟 ,等. 洋葱路由追踪技术中时间特征的建模与分析[J]. 计算机学报, 2014,2(37): 357-371.
	HE G F , YANG M , LUO J Z ,et al. Modeling and analysis of time characteristics used in onion routing traceback techniques[J]. Chinese Journal of Computers, 2014,2(37): 357-371.
[2]	郭晓军, 程光, 朱琛刚 ,等. 主动网络流水印技术研究进展[J]. 通信学报, 2014,35(7): 178-192.
	GUO X J , CHENG G , ZHU C G ,et al. Progress in research on active network flow watermark[J]. Journal on Communications, 2014,35(7): 178-192.
[3]	WANG X , REEVES D S . Robust correlation of encrypted attack traffic through stepping stones by manipulation of interpacket delays[C]// ACM Conference on Computer and Communications Security. 2003: 20-29.
[4]	PAN Z , PENG H , LONG X ,et al. A watermarking-based host correlation detection scheme[C]// International Conference on Management of e-Commerce and e-Government. 2009: 493-497.
[5]	PYUN Y J , PARK Y H , WANG X ,et al. Tracing traffic through intermediate hosts that repacketize flows[C]// IEEE International Conference on Computer Communications. 2007: 634-642.
[6]	WANG X , CHEN S , JAJODIA S . Network flow watermarking attack on low-latency anonymous communication systems[C]// IEEE Symposium on Security and Privacy. 2007: 116-130.
[7]	KIYAVASH N , HOUMANSADR A , BORISOV N . Multi-flow attacks against network flow watermarking schemes[C]// USENIX Security Symposium. 2008: 307-320.
[8]	张连成, 王振兴, 孙建平 . 基于时间间隔的扩频流水印技术[J]. 计算机应用研究, 2011,28(8): 3049-3053.
	ZHANG L C , WANG Z X , SUN J P . Interval-based spectrum watermarking scheme for tracing network flows[J]. Application Research of Computers, 2011,28(8): 3049-3053.
[9]	张璐, 罗军舟, 杨明 ,等. 基于时隙质心流水印的匿名通信追踪技术[J]. 软件学报, 2011,22(10): 2358-2371.
	ZHANG L , LUO J Z , YANG M ,et al. Interval centroid based flow watermarking technique for anonymous communication traceback[J]. Journal of Software, 2011,22(10): 2358-2371.
[10]	LUO J , WANG X , YANG M . An interval centroid based spread spectrum watermarking scheme for multi-flow traceback[J]. Journal of Network and Computer Applications, 2012,35(1): 60-71.
[11]	RAMYA K P , REVATHI M K . Protecting streaming data using provenance spread spectrum watermarking[J]. Research in Computer and Communication Engineering, 2014,3(2): 2109-2114.
[16]	HOUMANSADR A , KIYAVASH N , BORISOV N . Rainbow:a robust and invisible non-blind watermark for network flows[C]// 16th Annual Network＆ Distributed System Security Symposium(NDSS'09). 2009: 224-236.

Metrics

Recommended 0

No Suggested Reading articles found!

抖动均值μ/ms	相似率
抖动均值μ/ms	[15,25]ms	[15,30]ms	[15,35]ms	[15,40]ms
2	0.937	0.937 5	0.937 5	0.940
4	0.906	0.912 8	0.937 5	0.940
8	0.812	0.875 0	0.937 5	1.000
16	0.750	0.777 7	0.818 0	0.833

抖动均值μ/ms	相似率
抖动均值μ/ms	[15,25]ms	[15,30]ms	[15,35]ms	[15,40]ms
2	0.812	0.906	0.937	0.937
4	0.750	0.840	0.850	0.875
8	0.730	0.812	0.833	0.854
16	0.700	0.812	0.820	0.836

抖动均值μ/ms	相似率
抖动均值μ/ms	[15,25]ms	[15,30]ms	[15,35]ms	15,40]ms
2	0.880 0	0.953 0	0.966	1.000
4	0.920 0	0.933 0	0.946	1.000
8	0.912 9	0.925 8	0.933	0.945
16	0.894 4	0.912 9	0.925	0.966

序列类型	相似率
序列类型	8位	16位	24位	32位
Y	0.593 7	0.500	0.479 0	0.437 5
W	0.547 7	0.559	0.527 0	0.500 0

序列类型	相似率
序列类型	8位	16位	24位	32位
Y	0.625 0	0.531	0.479	0.422
W	0.507 1	0.500	0.472	0.470

Packets flow watermarking method based on the inter-packet delay with smooth crossed grouping

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 16

References 16

Related Articles 4

Metrics

Recommended 0

方法名称	误判率
方法名称	μ=2 ms	μ=4 ms	μ=6 ms	μ=8 ms	μ=10 ms
平滑分组技术	0.47	0.45	0.45	0.43	0.42
原始分组技术	0.54	0.55	0.49	0.49	0.48

阈值范围	有水印嵌入序列的检测准确率		无水印嵌入序列的检测准确率
阈值范围	平滑分组技术	原始分组技术	平滑分组技术	原始分组技术
0.6～1.0	1.0	1.0	0.9	0.8
0.7～1.0	1.0	0.9	1.0	0.9
0.8～1.0	1.0	0.84	1.0	1.0
0.9～1.0	0.9	0.8	1.0	1.0

时间序列名称		平滑分组技术		原始分组技术
时间序列名称		μ	σ²	μ	σ²
嵌入水印时间分布	嵌入方a	26.70	47.66	27.79	26.1
嵌入水印时间分布	检测方b	28.18	47.03	28.72	40.2
未嵌入水印时间分布	嵌入方c	26.93	43.75	27.41	41.50
未嵌入水印时间分布	检测方d	28.13	43.50	28.82	64.79

检测方法	CCE值
正常数据分组流	1.95
水印数据分组流	1.89

[1]	Cheng-chang ZHENG,Wan-quan PENG,Bo WEI. Construction of a new class of (2k, k, 1) convolutional codes [J]. Journal on Communications, 2014, 35(6): 200-206.
[2]	. Construction of a new class of (2k, k, 1) convolutional codes [J]. Journal on Communications, 2014, 35(6): 26-206.
[3]	Xiao-ling HUANG,Hua-long YANG. Research of fast decoding for longer constraint length convolutional codes [J]. Journal on Communications, 2010, 31(3): 57-64.
[4]	Hai-xian ZHOU,Guo-liang XU,Wei YAO. Novel decoding of convolutional codes for OCDMA system [J]. Journal on Communications, 2009, 30(3): 89-92.