{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:31Z","timestamp":1773377011539,"version":"3.50.1"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195502","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Relatively-Secure LLM-Based Steganography via Constrained Markov Decision Processes"],"prefix":"10.1109","author":[{"given":"Yu-Shin","family":"Huang","sequence":"first","affiliation":[{"name":"Texas A&M University,Dept. of Electrical and Computer Engineering,College Station,TX,USA,77845"}]},{"given":"Chao","family":"Tian","sequence":"additional","affiliation":[{"name":"Texas A&M University,Dept. of Electrical and Computer Engineering,College Station,TX,USA,77845"}]},{"given":"Krishna","family":"Narayanan","sequence":"additional","affiliation":[{"name":"Texas A&M University,Dept. of Electrical and Computer Engineering,College Station,TX,USA,77845"}]},{"given":"Lizhong","family":"Zheng","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology,Dept. of Electrical Engineering and Computer Science,Cambridge,MA,USA,02139"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/49.668971"},{"key":"ref2","volume-title":"Digital water-marking and steganography","author":"Cox","year":"2007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSECP.2003.1203220"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-4730-9_5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1161366.1161397"},{"key":"ref6","first-page":"591","article-title":"Linguistic steganography using automatically generated paraphrases","volume-title":"Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics","author":"Chang"},{"key":"ref7","article-title":"Matryoshka: Hiding secret communication in plain sight","volume-title":"6th USENIX Workshop on Free and Open Communications on the Internet (FOCI 16)","author":"Safaka"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-3017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2871746"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1115"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2016EDP7358"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.3023279"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43575-2_2"},{"key":"ref14","article-title":"Perfectly secure steganography using minimum entropy coupling","author":"de Witt","year":"2022","journal-title":"arXiv preprint arXiv"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484550"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3361219"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.268"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP46215.2023.10179287"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1422"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3658664.3659657"},{"key":"ref22","article-title":"Semantic steganogra-phy: A framework for robust and high-capacity information hiding using large language models","author":"Bai","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref23","article-title":"FreStega: A plug-and-play method for boosting impercepti-bility and capacity in generative linguistic steganography for real-world scenarios","author":"Pang","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref24","article-title":"OD-Stega: LLM-based near-imperceptible steganography via optimized distributions","author":"Huang","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1201\/9781315140223"},{"key":"ref26","article-title":"Attention is all you need","author":"Vaswani","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref27","article-title":"Language models are few-shot learners","author":"Brown","year":"2020","journal-title":"arXiv preprint arXiv"},{"key":"ref28","article-title":"Llama: Open and efficient foundation language models","author":"Touvron","year":"2023","journal-title":"arXiv preprint arXiv"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1147\/rd.232.0149"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1515\/9781400874651"},{"key":"ref31","volume-title":"Reinforcement learning: An introduction","author":"Sutton","year":"2018"},{"key":"ref32","article-title":"Relatively-secure 11m-based steganography via constrained markov decision processes","author":"Huang","year":"2025","journal-title":"arXiv preprint arXiv"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195502.pdf?arnumber=11195502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:01Z","timestamp":1773347401000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195502","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}