{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T00:58:48Z","timestamp":1780880328073,"version":"3.54.1"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["NSTC 114-2221-E-468-007"],"award-info":[{"award-number":["NSTC 114-2221-E-468-007"]}],"id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Displays"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.displa.2026.103461","type":"journal-article","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:58:33Z","timestamp":1775030313000},"page":"103461","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A high-capacity coverless steganography scheme using bit-plane complexity segmentation"],"prefix":"10.1016","volume":"94","author":[{"given":"Kanza","family":"Fatima","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nan-I","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chi-Shiang","family":"Chan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min-Shinag","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.displa.2026.103461_b1","first-page":"1202","article-title":"Social internet privacy protection combining K-subgraph and D-KDLD","volume":"27","author":"Li","year":"2025","journal-title":"Int. J. Netw. Secur."},{"issue":"5","key":"10.1016\/j.displa.2026.103461_b2","first-page":"960","article-title":"A speech steganography privacy protection scheme based on secret sharing","volume":"27","author":"Zhao","year":"2025","journal-title":"Int. J. Netw. Secur."},{"issue":"14","key":"10.1016\/j.displa.2026.103461_b3","doi-asserted-by":"crossref","first-page":"4422","DOI":"10.3390\/s25144422","article-title":"A fuzzy-based relay security algorithm for wireless sensor networks","volume":"25","author":"Wu","year":"2025","journal-title":"Sensors"},{"issue":"2","key":"10.1016\/j.displa.2026.103461_b4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.3390\/cryptography9020028","article-title":"A quantum key distribution for securing smart grid","volume":"9","author":"Lin","year":"2025","journal-title":"Cryptography"},{"key":"10.1016\/j.displa.2026.103461_b5","article-title":"A review of coverless steganography","author":"Meng","year":"2023","journal-title":"Neurocomputing"},{"issue":"6","key":"10.1016\/j.displa.2026.103461_b6","first-page":"1016","article-title":"Coverless text information hiding method using the frequent words hash","volume":"19","author":"Zhang","year":"2017","journal-title":"Int. J. Netw. Secur."},{"issue":"3","key":"10.1016\/j.displa.2026.103461_b7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.15388\/23-INFOR521","article-title":"A robust and high-capacity coverless information hiding based on combination theory","volume":"34","author":"Anggriani","year":"2023","journal-title":"Informatica"},{"issue":"2","key":"10.1016\/j.displa.2026.103461_b8","first-page":"1","article-title":"A high capacity coverless information hiding based on the lowest and highest image fragment","volume":"12","author":"Anggriani","year":"2017","journal-title":"Electronics"},{"issue":"17","key":"10.1016\/j.displa.2026.103461_b9","doi-asserted-by":"crossref","first-page":"3498","DOI":"10.3390\/electronics14173498","article-title":"A high-payload data hiding method utilizing an optimized voting strategy and dynamic mapping table","volume":"14","author":"Fatima","year":"2025","journal-title":"Electronics"},{"issue":"2","key":"10.1016\/j.displa.2026.103461_b10","first-page":"389","article-title":"An innovative data hiding scheme for color images","volume":"13","author":"Fatima","year":"2025","journal-title":"Balt. J. Mod. Comput."},{"key":"10.1016\/j.displa.2026.103461_b11","first-page":"1093","article-title":"Research on multimedia application on information hiding forensics and cybersecurity","volume":"23","author":"Lee","year":"2021","journal-title":"Int. J. Netw. Secur. (IJNS)"},{"issue":"12","key":"10.1016\/j.displa.2026.103461_b12","doi-asserted-by":"crossref","first-page":"7050","DOI":"10.3390\/app13127050","article-title":"High imperceptible data hiding method for AMBTC compressed images based on combination theory","volume":"13","author":"Anggriani","year":"2023","journal-title":"Appl. Sci."},{"issue":"1","key":"10.1016\/j.displa.2026.103461_b13","first-page":"25","article-title":"Research on coverless image steganography","volume":"25","author":"Anggriani","year":"2023","journal-title":"Int. J. Netw. Secur."},{"key":"10.1016\/j.displa.2026.103461_b14","article-title":"Secret data sharing through coverless video steganography based on bit plane segmentation","volume":"78","author":"Debnath","year":"2023","journal-title":"J. Inf. Secur. Appl."},{"key":"10.1016\/j.displa.2026.103461_b15","series-title":"Cloud Computing and Security: First International Conference, ICCCS 2015, Nanjing, China, August 13-15, 2015. Revised Selected Papers 1","first-page":"123","article-title":"Coverless image steganography without embedding","author":"Zhou","year":"2015"},{"key":"10.1016\/j.displa.2026.103461_b16","series-title":"Intelligent Computing Methodologies: 13th International Conference, ICIC 2017, Liverpool, UK, August 7-10, 2017, Proceedings, Part III 13","first-page":"536","article-title":"Coverless information hiding based on robust image hashing","author":"Zheng","year":"2017"},{"issue":"1","key":"10.1016\/j.displa.2026.103461_b17","first-page":"67","article-title":"Applying permutations and cuckoo search for obtaining a new steganography approach in spatial domain","volume":"23","author":"Nassr","year":"2021","journal-title":"Int. J. Netw. Secur."},{"key":"10.1016\/j.displa.2026.103461_b18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ins.2020.12.002","article-title":"An encrypted coverless information hiding method based on generative models","volume":"553","author":"Li","year":"2021","journal-title":"Inform. Sci."},{"key":"10.1016\/j.displa.2026.103461_b19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13640-020-00512-8","article-title":"A video coverless information hiding algorithm based on semantic segmentation","volume":"2020","author":"Pan","year":"2020","journal-title":"EURASIP J. Image Video Process."},{"key":"10.1016\/j.displa.2026.103461_b20","series-title":"Geometry and Vision: First International Symposium, ISGV 2021, Auckland, New Zealand, January 28-29, 2021, Revised Selected Papers 1","first-page":"134","article-title":"Coverless video steganography based on inter frame combination","author":"Zou","year":"2021"},{"issue":"1","key":"10.1016\/j.displa.2026.103461_b21","article-title":"Coverless steganography based on motion analysis of video","volume":"2021","author":"Tan","year":"2021","journal-title":"Secur. Commun. Networks"},{"issue":"1","key":"10.1016\/j.displa.2026.103461_b22","first-page":"1571","article-title":"Coverless video steganography based on frame sequence perceptual distance mapping","volume":"73","author":"Li","year":"2022","journal-title":"Comput. Mater. Contin."},{"key":"10.1016\/j.displa.2026.103461_b23","doi-asserted-by":"crossref","unstructured":"Kawaguchi Eiji, Principle and applications of bpcs-steganography, in: Proceedings of SPIE: Multimedia Systems and Applications, 1998, 3528, 1998, pp. 464\u2013463.","DOI":"10.1117\/12.337436"},{"issue":"9","key":"10.1016\/j.displa.2026.103461_b24","first-page":"4860","article-title":"Review: steganography\u2013bit plane complexity segmentation (bpcs) technique","volume":"2","author":"Khaire","year":"2010","journal-title":"Int. J. Eng. Sci. Technol."},{"issue":"1","key":"10.1016\/j.displa.2026.103461_b25","article-title":"Coverless video steganography based on audio and frame features","volume":"2022","author":"Zhang","year":"2022","journal-title":"Secur. Commun. Networks"},{"issue":"5","key":"10.1016\/j.displa.2026.103461_b26","doi-asserted-by":"crossref","first-page":"13427","DOI":"10.1007\/s11042-023-15697-z","article-title":"A robust coverless video steganography based on maximum DC coefficients against video attacks","volume":"83","author":"Meng","year":"2024","journal-title":"Multimedia Tools Appl."},{"key":"10.1016\/j.displa.2026.103461_b27","doi-asserted-by":"crossref","first-page":"5996","DOI":"10.1109\/TMM.2023.3344357","article-title":"A robust coverless video steganography based on the similarity of inter-frames","volume":"26","author":"Meng","year":"2023","journal-title":"IEEE Trans. Multimed."},{"key":"10.1016\/j.displa.2026.103461_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.jvcir.2024.104303","article-title":"A robust coverless image-synthesized video steganography based on asymmetric structure","volume":"104","author":"Jiao","year":"2024","journal-title":"J. Vis. Commun. Image Represent."}],"container-title":["Displays"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141938226001241?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141938226001241?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T00:13:11Z","timestamp":1780877591000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0141938226001241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":28,"alternative-id":["S0141938226001241"],"URL":"https:\/\/doi.org\/10.1016\/j.displa.2026.103461","relation":{},"ISSN":["0141-9382"],"issn-type":[{"value":"0141-9382","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A high-capacity coverless steganography scheme using bit-plane complexity segmentation","name":"articletitle","label":"Article Title"},{"value":"Displays","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.displa.2026.103461","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"103461"}}