{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T05:59:15Z","timestamp":1763704755763,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,12,5]],"date-time":"2011-12-05T00:00:00Z","timestamp":1323043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["831300"],"award-info":[{"award-number":["831300"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000140710907N000140911042"],"award-info":[{"award-number":["N000140710907N000140911042"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","award":["G-U386"],"award-info":[{"award-number":["G-U386"]}],"id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","award":["FA8750-08-2-0141"],"award-info":[{"award-number":["FA8750-08-2-0141"]}],"id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,12,5]]},"DOI":"10.1145\/2076732.2076760","type":"proceedings-article","created":{"date-parts":[[2011,12,13]],"date-time":"2011-12-13T15:46:00Z","timestamp":1323791160000},"page":"197-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Exposing invisible timing-based traffic watermarks with BACKLIT"],"prefix":"10.1145","author":[{"given":"Xiapu","family":"Luo","sequence":"first","affiliation":[{"name":"The Hong Kong Polytechnic University"}]},{"given":"Peng","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University"}]},{"given":"Junjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]},{"given":"Roberto","family":"Perdisci","sequence":"additional","affiliation":[{"name":"University of Georgia"}]},{"given":"Wenke","family":"Lee","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology"}]},{"given":"Rocky K. C.","family":"Chang","sequence":"additional","affiliation":[{"name":"The Hong Kong Polytechnic University"}]}],"member":"320","published-online":{"date-parts":[[2011,12,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948115"},{"key":"e_1_3_2_1_2_1","volume-title":"IEEE INFOCOM","author":"Pyun Y.","year":"2007","unstructured":"Y. Pyun , Y. Park , X. Wang , D. Reeves , and P. Ning , \" Tracing traffic through intermediate hosts that repacketize flows,\" in Proc . IEEE INFOCOM , 2007 . Y. Pyun, Y. Park, X. Wang, D. Reeves, and P. Ning, \"Tracing traffic through intermediate hosts that repacketize flows,\" in Proc. IEEE INFOCOM, 2007."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.30"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87403-4_4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102120.1102133"},{"key":"e_1_3_2_1_6_1","volume-title":"NDSS","author":"Houmansadr A.","year":"2009","unstructured":"A. Houmansadr , N. Kiyavash , and N. Borisov , \" RAINBOW: A robust and invisible non-blind watermark for network flows,\" in Proc . NDSS , 2009 . A. Houmansadr, N. Kiyavash, and N. Borisov, \"RAINBOW: A robust and invisible non-blind watermark for network flows,\" in Proc. NDSS, 2009."},{"key":"e_1_3_2_1_7_1","volume-title":"NDSS","author":"Houmansadr A.","year":"2011","unstructured":"A. Houmansadr and N. Borisov , \" SWIRL: A scalable watermark to detect correlated network flows,\" in Proc . NDSS , 2011 . A. Houmansadr and N. Borisov, \"SWIRL: A scalable watermark to detect correlated network flows,\" in Proc. NDSS, 2011."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11863908_2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70630-4_9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455812"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.28"},{"key":"e_1_3_2_1_12_1","volume-title":"USENIX Security","author":"Kiyavash N.","year":"2008","unstructured":"N. Kiyavash , A. Houmansadr , and N. Borisov , \" Multi-flow attacks against network flow watermarking schemes,\" in Proc . USENIX Security , 2008 . N. Kiyavash, A. Houmansadr, and N. Borisov, \"Multi-flow attacks against network flow watermarking schemes,\" in Proc. USENIX Security, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNS.2007.87"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020843525812"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4959879"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298321"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_18_1","volume-title":"USENIX Security","author":"Zhang Y.","year":"2000","unstructured":"Y. Zhang and V. Paxson , \" Detecting stepping stones,\" in Proc . USENIX Security , 2000 . Y. Zhang and V. Paxson, \"Detecting stepping stones,\" in Proc. USENIX Security, 2000."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31966-5_2"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/571697.571725"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.838606"},{"key":"e_1_3_2_1_22_1","volume-title":"CRC","author":"Therrien C.","year":"2004","unstructured":"C. Therrien and M. Tummala , Probability for Electrical and Computer Engineers . CRC , 2004 . C. Therrien and M. Tummala, Probability for Electrical and Computer Engineers. CRC, 2004."},{"key":"e_1_3_2_1_23_1","volume-title":"dissertation","author":"Tax D.","year":"2001","unstructured":"D. Tax , \"One-class classification; concept-learning in the absence of counter-examples,\" Ph. D. dissertation , Delft University of Technology , 2001 . D. Tax, \"One-class classification; concept-learning in the absence of counter-examples,\" Ph.D. dissertation, Delft University of Technology, 2001."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.165"},{"key":"e_1_3_2_1_25_1","volume-title":"IEEE ICCCN","author":"Gharai L.","year":"2004","unstructured":"L. Gharai , C. Perkins , and T. Lehman , \" Packet reordering, high speed networks and transport protocol performance,\" in Proc . IEEE ICCCN , 2004 . L. Gharai, C. Perkins, and T. Lehman, \"Packet reordering, high speed networks and transport protocol performance,\" in Proc. IEEE ICCCN, 2004."},{"key":"e_1_3_2_1_26_1","volume-title":"TCP congestion control,\" RFC","author":"Allman M.","year":"1999","unstructured":"M. Allman , V. Paxson , and W. Stevens , \" TCP congestion control,\" RFC 2581, April 1999 . M. Allman, V. Paxson, and W. Stevens, \"TCP congestion control,\" RFC 2581, April 1999."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.890117"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064413.1064418"},{"key":"e_1_3_2_1_29_1","volume-title":"the data description toolbox for Matlab (version 1.5.3)","author":"Tax D.","year":"2009","unstructured":"D. Tax , \"DDtools , the data description toolbox for Matlab (version 1.5.3) ,\" June 2009 . D. Tax, \"DDtools, the data description toolbox for Matlab (version 1.5.3),\" June 2009."},{"volume-title":"The Matlab toolbox for pattern recognition,\" http:\/\/www.prtools.org\/","year":"2008","key":"e_1_3_2_1_30_1","unstructured":"\"PRTools : The Matlab toolbox for pattern recognition,\" http:\/\/www.prtools.org\/ , 2008 . \"PRTools: The Matlab toolbox for pattern recognition,\" http:\/\/www.prtools.org\/, 2008."},{"key":"e_1_3_2_1_31_1","unstructured":"\"libssh2 \" http:\/\/www.libssh2.org\/ 2011.  \"libssh2 \" http:\/\/www.libssh2.org\/ 2011."},{"key":"e_1_3_2_1_32_1","volume-title":"IEEE Symp. Security and Privacy","author":"Heberlein L.","year":"1995","unstructured":"L. Heberlein and S. Staniford-Chen , \" Holding intruders accountable on the Internet,\" in Proc . IEEE Symp. Security and Privacy , 1995 . L. Heberlein and S. Staniford-Chen, \"Holding intruders accountable on the Internet,\" in Proc. IEEE Symp. Security and Privacy, 1995."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30143-1_14"},{"key":"e_1_3_2_1_34_1","volume-title":"ACSAC","author":"Coskun B.","year":"2007","unstructured":"B. Coskun and N. Memon , \" Efficient detection of delay-constrained relay nodes,\" in Proc . ACSAC , 2007 . B. Coskun and N. Memon, \"Efficient detection of delay-constrained relay nodes,\" in Proc. ACSAC, 2007."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.14"},{"key":"e_1_3_2_1_36_1","volume-title":"ESORICS","author":"Luo X.","year":"2010","unstructured":"X. Luo , J. Zhang , R. Perdisci , and W. Lee , \" On the secrecy of spread-spectrum flow watermarks,\" in Proc . ESORICS , 2010 . X. Luo, J. Zhang, R. Perdisci, and W. Lee, \"On the secrecy of spread-spectrum flow watermarks,\" in Proc. ESORICS, 2010."}],"event":{"name":"ACSAC '11: Annual Computer Security Applications Conference","sponsor":["ACSA Applied Computing Security Assoc"],"location":"Orlando Florida USA","acronym":"ACSAC '11"},"container-title":["Proceedings of the 27th Annual Computer Security Applications Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2076732.2076760","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2076732.2076760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:46Z","timestamp":1750240486000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2076732.2076760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,5]]},"references-count":36,"alternative-id":["10.1145\/2076732.2076760","10.1145\/2076732"],"URL":"https:\/\/doi.org\/10.1145\/2076732.2076760","relation":{},"subject":[],"published":{"date-parts":[[2011,12,5]]},"assertion":[{"value":"2011-12-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}