{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T23:16:06Z","timestamp":1778541366086,"version":"3.51.4"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:00:00Z","timestamp":1774915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:00:00Z","timestamp":1778544000000},"content-version":"vor","delay-in-days":42,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2024QF112"],"award-info":[{"award-number":["ZR2024QF112"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2024QG134"],"award-info":[{"award-number":["ZR2024QG134"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Inf. Secur."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Designing novel and effective distortion functions for spatial image steganography has become increasingly challenging. The controversial pixels prior (CPP) rule mitigates this by fusing existing distortion functions rather than constructing new ones, but it is limited to functions with comparable security performance. We propose G-CPP, a generalized fusion framework based on the grading of controversial pixels. G-CPP assigns embedding priorities according to pixel conflict levels, enabling more effective utilization of high-potential embedding locations. Furthermore, we introduce a customized scheduling strategy for the G-CPP and cost-spreading rules, tailored to the intrinsic properties of different distortion-function combinations, thereby enhancing statistical undetectability against both conventional and deep learning\u2013based steganalyzers. G-CPP preserves the advantages of CPP while extending its applicability to functions with significantly divergent security levels. Experiments on multiple benchmark datasets show that G-CPP consistently outperforms the conventional CPP rule, achieving superior security performance across diverse function combinations.<\/jats:p>","DOI":"10.1186\/s13635-026-00233-x","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T09:48:31Z","timestamp":1774950511000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing steganographic security via controversial-pixel grading in multi-distortion function fusion"],"prefix":"10.1186","volume":"2026","author":[{"given":"Xiaosong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingliang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donghua","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenzi","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,31]]},"reference":[{"issue":"2","key":"233_CR1","first-page":"142","volume":"2","author":"B Li","year":"2011","unstructured":"B. Li, J. He, J. Huang, Y.Q. Shi, A survey on image steganography and steganalysis. J. Inf. Hiding Multimed. Signal Process. 2(2), 142\u2013172 (2011)","journal-title":"J. Inf. Hiding Multimed. Signal Process."},{"key":"233_CR2","doi-asserted-by":"crossref","unstructured":"T. Pevn\u1ef3, T. Filler, P. Bas, in International Workshop on Information Hiding. Using high-dimensional image models to perform highly undetectable steganography (Springer, Berlin, Heidelberg, 2010), pp. 161\u2013177","DOI":"10.1007\/978-3-642-16435-4_13"},{"key":"233_CR3","doi-asserted-by":"crossref","unstructured":"V. Holub, J. Fridrich, in 2012 IEEE International Workshop on Information Forensics and Security (WIFS), Designing steganographic distortion using directional filters (IEEE, Los Alamitos, CA, 2012), pp. 234\u2013239","DOI":"10.1109\/WIFS.2012.6412655"},{"issue":"1","key":"233_CR4","doi-asserted-by":"publisher","DOI":"10.1186\/1687-417X-2014-1","volume":"2014","author":"V Holub","year":"2014","unstructured":"V. Holub, J. Fridrich, T. Denemark, Universal distortion function for steganography in an arbitrary domain. EURASIP J. Inf. Secur. 2014(1), 1 (2014)","journal-title":"EURASIP J. Inf. Secur."},{"key":"233_CR5","doi-asserted-by":"crossref","unstructured":"B. Li, M. Wang, J. Huang, X. Li, in 2014 IEEE International Conference on Image Processing (ICIP), A new cost function for spatial image steganography (IEEE, Piscataway, NJ, 2014), pp. 4206\u20134210","DOI":"10.1109\/ICIP.2014.7025854"},{"key":"233_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2023.109370","volume":"219","author":"Q Liu","year":"2024","unstructured":"Q. Liu, W. Su, J. Ni, X. Hu, J. Huang, An efficient distortion cost function design for image steganography in spatial domain using quaternion representation. Signal Processing 219, 109370 (2024)","journal-title":"Signal Processing"},{"key":"233_CR7","doi-asserted-by":"crossref","unstructured":"V. Sedighi, J. Fridrich, R. Cogranne, in Media Watermarking, Security, and Forensics 2015. Content-adaptive pentary steganography using the multivariate generalized Gaussian cover model, vol. 9409 (SPIE, Bellingham,WA, 2015), pp. 144\u2013156","DOI":"10.1117\/12.2080272"},{"issue":"2","key":"233_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1109\/TIFS.2015.2486744","volume":"11","author":"V Sedighi","year":"2015","unstructured":"V. Sedighi, R. Cogranne, J. Fridrich, Content-adaptive steganography by minimizing statistical detectability. IEEE Trans. Inf. Forensics Secur. 11(2), 221\u2013234 (2015)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"3","key":"233_CR9","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1109\/TCSVT.2020.3001122","volume":"31","author":"W Su","year":"2020","unstructured":"W. Su, J. Ni, X. Hu, J. Fridrich, Image steganography with symmetric embedding using gaussian markov random field model. IEEE Trans. Circuits Syst. Video Technol. 31(3), 1001\u20131015 (2020)","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"233_CR10","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TIFS.2019.2922229","volume":"15","author":"J Yang","year":"2019","unstructured":"J. Yang, D. Ruan, J. Huang, X. Kang, Y.Q. Shi, An embedding cost learning framework using gan. IEEE Trans. Inf. Forensics Secur. 15, 839\u2013851 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"233_CR11","unstructured":"H. Wang, C.T. Leong, J. Wang, J. Wang, W. Li, Spa-rl: Reinforcing llm agents via stepwise progress attribution.\u00a0(2025).\u00a0arXiv\u00a0preprint\u00a0arXiv:2505.20732"},{"key":"233_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/TIFS.2023.3318939","volume":"19","author":"D Huang","year":"2023","unstructured":"D. Huang, W. Luo, M. Liu, W. Tang, J. Huang, Steganography embedding cost learning with generative multi-adversarial network. IEEE Trans. Inf. Forensics Secur. 19, 15\u201329 (2023)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"233_CR13","doi-asserted-by":"crossref","unstructured":"D. Huang, W. Luo, P. Zheng, J. Huang, in Proceedings of the 31st ACM International Conference on Multimedia. Automatic asymmetric embedding cost learning via generative adversarial networks (ACM, NY, USA, 2023), pp. 8316\u20138326","DOI":"10.1145\/3581783.3612399"},{"issue":"11","key":"233_CR14","doi-asserted-by":"publisher","first-page":"2654","DOI":"10.1109\/TIFS.2017.2718480","volume":"12","author":"W Zhou","year":"2017","unstructured":"W. Zhou, W. Zhang, N. Yu, A new rule for cost reassignment in adaptive steganography. IEEE Trans. Inf. Forensics Secur. 12(11), 2654\u20132667 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"233_CR15","doi-asserted-by":"crossref","unstructured":"P. Bas, T. Filler, T. Pevn\u1ef3, in International Workshop on Information Hiding. \u201cBreak our steganographic system\u201d: the ins and outs of organizing boss (Springer, Berlin, Heidelberg, 2011), pp. 59\u201370","DOI":"10.1007\/978-3-642-24178-9_5"},{"issue":"3","key":"233_CR16","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/TIFS.2012.2190402","volume":"7","author":"J Fridrich","year":"2012","unstructured":"J. Fridrich, J. Kodovsky, Rich models for steganalysis of digital images. IEEE Trans. Inf. Forensics Secur. 7(3), 868\u2013882 (2012)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"233_CR17","doi-asserted-by":"crossref","unstructured":"T. Denemark, V. Sedighi, V. Holub, R. Cogranne, J. Fridrich, in 2014 IEEE International Workshop on Information Forensics and Security (WIFS), Selection-channel-aware rich model for steganalysis of digital images (IEEE, Piscataway, NJ, 2014), pp. 48\u201353","DOI":"10.1109\/WIFS.2014.7084302"},{"issue":"2","key":"233_CR18","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/TIFS.2011.2175919","volume":"7","author":"J Kodovsky","year":"2011","unstructured":"J. Kodovsky, J. Fridrich, V. Holub, Ensemble classifiers for steganalysis of digital media. IEEE Trans. Inf. Forensics Secur. 7(2), 432\u2013444 (2011)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"233_CR19","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1109\/LSP.2022.3201727","volume":"29","author":"S Weng","year":"2022","unstructured":"S. Weng, M. Chen, L. Yu, S. Sun, Lightweight and effective deep image steganalysis network. IEEE Signal Process. Lett. 29, 1888\u20131892 (2022)","journal-title":"IEEE Signal Process. Lett."},{"issue":"5","key":"233_CR20","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1109\/TIFS.2018.2871749","volume":"14","author":"M Boroumand","year":"2018","unstructured":"M. Boroumand, M. Chen, J. Fridrich, Deep residual network for steganalysis of digital images. IEEE Trans. Inf. Forensics Secur. 14(5), 1181\u20131193 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"233_CR21","unstructured":"P. Bas, T. Furon. BOWS-2: Break Our Watermarking System. (2007). http:\/\/bows2.ec-lille.fr\/. Accessed Jul 2007"}],"container-title":["Journal on Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13635-026-00233-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-026-00233-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-026-00233-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:45:16Z","timestamp":1778539516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13635-026-00233-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,31]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["233"],"URL":"https:\/\/doi.org\/10.1186\/s13635-026-00233-x","relation":{},"ISSN":["3091-4515"],"issn-type":[{"value":"3091-4515","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,31]]},"assertion":[{"value":"6 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2026","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":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"12"}}