{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:07:58Z","timestamp":1759334878282,"version":"build-2065373602"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["Grant No. SBK2023041256"],"award-info":[{"award-number":["Grant No. SBK2023041256"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant No. 62302097"],"award-info":[{"award-number":["Grant No. 62302097"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Network flow fingerprinting technology extends the number of embedded bits based on watermarking, thereby conveying additional information about the marked traffic, such as the traffic origin or the identity of the marking entity. However, existing fingerprinting\/watermarking techniques follow the same embedding pattern under various levels of network noise, which hinders adaptation to high-noise environments and increases the risk of information loss. Therefore, this paper introduces the concept of embedding strength and proposes a network flow fingerprinting method with adaptive embedding strength. The embedding strength is adaptive for different network flows and can be freely adjusted. To achieve this, we design a two-stage training framework to generate fingerprint delays. In the first stage, we use an autoencoder architecture to obtain the optimal embedding for the fingerprint. In the second stage, we introduce a new component-the Adaptor-to produce a minimized embedding strength that eliminates redundant embeddings from the previous stage, thus balancing robustness and invisibility. Experimental results show that, after two stages of training, our scheme achieves an extraction rate of 98.33% and a bit error rate of 0.83%. Furthermore, in high-noise environments, our scheme can adjust the embedding strength to improve the extraction rate from 60.83 to over 90%.<\/jats:p>","DOI":"10.1186\/s42400-025-00376-3","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:03:24Z","timestamp":1759277004000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A network flow fingerprinting method with adaptive embedding strength"],"prefix":"10.1186","volume":"8","author":[{"given":"Yali","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Jian","family":"Ge","sequence":"additional","affiliation":[]},{"given":"Guang","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"376_CR1","unstructured":"Tor Project: Tor Metrics. [EB\/OL]. Accessed: 2024-10. https:\/\/metrics.torproject.org\/userstats-relay-country.html"},{"key":"376_CR2","doi-asserted-by":"crossref","unstructured":"Nasr M, Bahramali A, Houmansadr A (2018) Deepcorr: Strong flow correlation attacks on tor using deep learning. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1962\u20131976","DOI":"10.1145\/3243734.3243824"},{"key":"376_CR3","doi-asserted-by":"crossref","unstructured":"Oh SE, Yang T, Mathews N, Holland JK, Rahman MS, Hopper N, Wright M (2022) Deepcoffea: Improved flow correlation attacks on tor via metric learning and amplification. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 1915\u20131932. IEEE","DOI":"10.1109\/SP46214.2022.9833801"},{"key":"376_CR4","doi-asserted-by":"crossref","unstructured":"Lopes D, Dong J-D, Medeiros P, Castro D, Barradas D, Portela B, Vinagre J, Ferreira B, Christin N, Santos N (2024) Flow correlation attacks on tor onion service sessions with sliding subset sum. In: Proceedings 2024 Network and Distributed System Security Symposium","DOI":"10.14722\/ndss.2024.24337"},{"issue":"3","key":"376_CR5","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1117\/1.1494075","volume":"11","author":"C Honsinger","year":"2002","unstructured":"Honsinger C (2002) Digital Watermarking. J Electron Imaging 11(3):414. https:\/\/doi.org\/10.1117\/1.1494075","journal-title":"J Electron Imaging"},{"key":"376_CR6","doi-asserted-by":"crossref","unstructured":"Houmansadr A, Borisov N (2013) The need for flow fingerprints to link correlated network flows. In: Privacy Enhancing Technologies: 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013. Proceedings 13, pp. 205\u2013224. Springer","DOI":"10.1007\/978-3-642-39077-7_11"},{"issue":"5","key":"376_CR7","first-page":"524","volume":"30","author":"L Zhang","year":"2012","unstructured":"Zhang L, Wang Z, Xu J (2012) A novel invisible and private flow watermarking scheme. J Appl Sci 30(5):524\u2013530","journal-title":"J Appl Sci"},{"issue":"4","key":"376_CR8","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1109\/TNET.2013.2272740","volume":"22","author":"A Houmansadr","year":"2013","unstructured":"Houmansadr A, Kiyavash N, Borisov N (2013) Non-blind watermarking of network flows. IEEE\/ACM Trans Netw 22(4):1232\u20131244","journal-title":"IEEE\/ACM Trans Netw"},{"key":"376_CR9","doi-asserted-by":"crossref","unstructured":"Yao Z, Zhang L, Ge J, Wu Y, Zhang X (2019) An invisible flow watermarking for traffic tracking: A hidden markov model approach. In: ICC 2019-2019 IEEE International Conference on Communications (ICC), pp. 1\u20136. IEEE","DOI":"10.1109\/ICC.2019.8761135"},{"key":"376_CR10","doi-asserted-by":"crossref","unstructured":"Yu L, Zhang L, Zhang Y, Wen W, Du X, Cao F (2021) Dynamic interval-based watermarking for tracking down network attacks. In: 2021 IEEE 21st International Conference on Software Quality, Reliability and Security (QRS), pp. 52\u201361. IEEE","DOI":"10.1109\/QRS54544.2021.00016"},{"key":"376_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109424","volume":"219","author":"T Li","year":"2022","unstructured":"Li T, Liu K, Feng W, Yang C, Luo X (2022) Heterotic: a Robust network flow watermarking based on heterogeneous time channels. Comput Netw 219:109424","journal-title":"Comput Netw"},{"key":"376_CR12","unstructured":"Houmansadr A, Kiyavash N, Borisov N (2009) Rainbow: A robust and invisible non-blind watermark for network flows. In: NDSS, vol. 47, pp. 406\u2013422. Citeseer"},{"key":"376_CR13","unstructured":"Houmansadr A, Borisov N (2011) Swirl: A scalable watermark to detect correlated network flows. In: NDSS. Citeseer"},{"key":"376_CR14","doi-asserted-by":"crossref","unstructured":"Rezaei F, Houmansadr A (2021) Finn: Fingerprinting network flows using neural networks. In: Proceedings of the 37th Annual Computer Security Applications Conference, pp. 1011\u20131024","DOI":"10.1145\/3485832.3488010"},{"key":"376_CR15","doi-asserted-by":"crossref","unstructured":"Wang X, Reeves DS, Wu SF, Yuill J (2001) Sleepy watermark tracing: An active network-based intrusion response framework. In: Trusted Information: The New Decade Challenge 16, pp. 369\u2013384. Springer","DOI":"10.1007\/0-306-46998-7_26"},{"key":"376_CR16","doi-asserted-by":"crossref","unstructured":"Choi Y-S, Seo D-i, Sohn S-W, Lee S-H (2003) Network-based real-time connection traceback system (nrcts) with packet marking technology. In: International Conference on Computational Science and Its Applications, pp. 31\u201340. Springer","DOI":"10.1007\/3-540-44843-8_4"},{"key":"376_CR17","doi-asserted-by":"crossref","unstructured":"Yu W, Fu X, Graham S, Xuan D, Zhao W (2007) Dsss-based flow marking technique for invisible traceback. In: 2007 IEEE Symposium on Security and Privacy (SP\u201907), pp. 18\u201332. IEEE","DOI":"10.1109\/SP.2007.14"},{"key":"376_CR18","doi-asserted-by":"crossref","unstructured":"Huang J, Pan X, Fu X, Wang J (2011) Long pn code based dsss watermarking. In: 2011 Proceedings IEEE INFOCOM, pp. 2426\u20132434. IEEE","DOI":"10.1109\/INFCOM.2011.5935064"},{"issue":"3","key":"376_CR19","doi-asserted-by":"publisher","first-page":"144","DOI":"10.2991\/ijndc.2013.1.3.3","volume":"1","author":"W Yu","year":"2013","unstructured":"Yu W, Fu X, Blasch E, Pham K, Shen D, Chen G, Lu C (2013) On effectiveness of hopping-based spread spectrum techniques for network forensic traceback. Int J Netw Distr Comput 1(3):144\u2013158","journal-title":"Int J Netw Distr Comput"},{"key":"376_CR20","doi-asserted-by":"crossref","unstructured":"Chan-Tin E, Shin J, Yu J (2013) Revisiting circuit clogging attacks on tor. In: 2013 International Conference on Availability, Reliability and Security, pp. 131\u2013140. IEEE","DOI":"10.1109\/ARES.2013.17"},{"issue":"5","key":"376_CR21","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1109\/TIFS.2017.2779113","volume":"13","author":"A Iacovazzi","year":"2017","unstructured":"Iacovazzi A, Sarda S, Frassinelli D, Elovici Y (2017) Dropwat: an invisible network flow watermark for data exfiltration traceback. IEEE Trans Inf Forensics Secur 13(5):1139\u20131154","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"6088","key":"376_CR22","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1038\/323533a0","volume":"323","author":"DE Rumelhart","year":"1986","unstructured":"Rumelhart DE, Hinton GE, Williams RJ (1986) Learning representations by back-propagating errors. Nature 323(6088):533\u2013536","journal-title":"Nature"},{"key":"376_CR23","doi-asserted-by":"crossref","unstructured":"Fang H, Jia Z, Ma Z, Chang E-C, Zhang W (2022) Pimog: An effective screen-shooting noise-layer simulation for deep-learning-based watermarking network. In: Proceedings of the 30th ACM International Conference on Multimedia, pp. 2267\u20132275","DOI":"10.1145\/3503161.3548049"},{"key":"376_CR24","doi-asserted-by":"crossref","unstructured":"Liu Y, Guo M, Zhang J, Zhu Y, Xie X (2019) A novel two-stage separable deep learning framework for practical blind watermarking. In: Proceedings of the 27th ACM International Conference on Multimedia, pp. 1509\u20131517","DOI":"10.1145\/3343031.3351025"},{"key":"376_CR25","doi-asserted-by":"crossref","unstructured":"Fu J, Zhu BB, Zhang H, Zou Y, Ge S, Cui W, Wang Y, Zhang D, Ma X, Jin H (2022) Chartstamp: Robust chart embedding for real-world applications. In: Proceedings of the 30th ACM International Conference on Multimedia, pp. 2786\u20132795","DOI":"10.1145\/3503161.3548286"},{"key":"376_CR26","doi-asserted-by":"crossref","unstructured":"Jia Z, Fang H, Zhang W (2021) Mbrs: Enhancing robustness of dnn-based watermarking by mini-batch of real and simulated jpeg compression. In: Proceedings of the 29th ACM International Conference on Multimedia, pp. 41\u201349","DOI":"10.1145\/3474085.3475324"},{"key":"376_CR27","doi-asserted-by":"crossref","unstructured":"Fang H, Chen K, Qiu Y, Liu J, Xu K, Fang C, Zhang W, Chang E-C (2023) Denol: A few-shot-sample-based decoupling noise layer for cross-channel watermarking robustness. In: Proceedings of the 31st ACM International Conference on Multimedia, pp. 7345\u20137353","DOI":"10.1145\/3581783.3612068"},{"key":"376_CR28","doi-asserted-by":"crossref","unstructured":"Nasr M, Houmansadr A, Mazumdar A (2017) Compressive traffic analysis: A new paradigm for scalable traffic analysis. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 2053\u20132069","DOI":"10.1145\/3133956.3134074"},{"key":"376_CR29","unstructured":"Nasr M, Bahramali A, Houmansadr A (2021) Defeating $$\\{$$DNN-Based$$\\}$$ traffic analysis systems in $$\\{$$Real-Time$$\\}$$ with blind adversarial perturbations. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 2705\u20132722"},{"key":"376_CR30","unstructured":"Paszke A, Gross S, Massa F, Lerer A, Bradbury J, Chanan G, Killeen T, Lin Z, Gimelshein N, Antiga L, et al (2019) Pytorch: an imperative style, high-performance deep learning library. Adv Neural Inform Process Syst 32"},{"key":"376_CR31","unstructured":"Kexian L, Jianfeng G, Wancheng Z, Zhikai H, Dijia Y (2023) Multiple redundant flow fingerprint model based on time slots. Chin J Netw Inform Sec9(1)"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00376-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00376-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00376-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:03:43Z","timestamp":1759277023000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-025-00376-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["376"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00376-3","relation":{},"ISSN":["2523-3246"],"issn-type":[{"type":"electronic","value":"2523-3246"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"17 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"73"}}