{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:56Z","timestamp":1760202716820,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,20]],"date-time":"2016-06-20T00:00:00Z","timestamp":1466380800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,20]]},"DOI":"10.1145\/2909827.2930796","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:57:38Z","timestamp":1465567058000},"page":"81-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Provable Secure Universal Steganography of Optimal Rate"],"prefix":"10.1145","author":[{"given":"Sebastian","family":"Berndt","sequence":"first","affiliation":[{"name":"University of L\u00fcbeck, L\u00fcbeck, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[{"name":"University of L\u00fcbeck, L\u00fcbeck, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30576-7_12"},{"key":"e_1_3_2_1_2_1","volume-title":"Optimum perfect universal steganography of finite memoryless sources. CoRR, abs\/1410.2659","author":"Balado F.","year":"2014","unstructured":"F. Balado and D. Haughton . Optimum perfect universal steganography of finite memoryless sources. CoRR, abs\/1410.2659 , 2014 . F. Balado and D. Haughton. Optimum perfect universal steganography of finite memoryless sources. CoRR, abs\/1410.2659, 2014."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/795663.796360"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.02.003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1288869.1288873"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9020-3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04431-1_3"},{"key":"e_1_3_2_1_8_1","first-page":"801","volume-title":"Proc. EI, Media Forensics and Security","author":"Filler T.","year":"2009","unstructured":"T. Filler , A. D. Ker , and J. J. Fridrich . The square root law of steganographic capacity for markov covers . In Proc. EI, Media Forensics and Security , volume 7254 , pages 801 -- 811 . SPIE , 2009 . T. Filler, A. D. Ker, and J. J. Fridrich. The square root law of steganographic capacity for markov covers. In Proc. EI, Media Forensics and Security, volume 7254, pages 801--811. SPIE, 2009."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1721894"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography --","author":"Goldreich O.","year":"2004","unstructured":"O. Goldreich . The Foundations of Cryptography -- Volume 2 , Basic Applications. Cambridge University Press , 2004 . O. Goldreich. The Foundations of Cryptography -- Volume 2, Basic Applications. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030206"},{"key":"e_1_3_2_1_13_1","volume-title":"Toward a theory of steganography. Technical report","author":"Hopper N. J.","year":"2004","unstructured":"N. J. Hopper . Toward a theory of steganography. Technical report , Technical Report Carnegie Mellon University-CS-04-157, Carnegie Mellon Univ. , 2004 . N. J. Hopper. Toward a theory of steganography. Technical report, Technical Report Carnegie Mellon University-CS-04-157, Carnegie Mellon Univ., 2004."},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-45708-9_6","volume-title":"Proc. CRYPTO","author":"Hopper N. J.","year":"2002","unstructured":"N. J. Hopper , J. Langford , and L. Ahn . Provably secure steganography . In Proc. CRYPTO , volume 2442 of Lecture Notes in Computer Science , pages 77 -- 92 . Springer , 2002 . N. J. Hopper, J. Langford, and L. Ahn. Provably secure steganography. In Proc. CRYPTO, volume 2442 of Lecture Notes in Computer Science, pages 77--92. Springer, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.199"},{"key":"e_1_3_2_1_16_1","first-page":"50","volume-title":"Proc. EI","author":"Katzenbeisser S.","year":"2002","unstructured":"S. Katzenbeisser and F. A. Petitcolas . Defining security in steganographic systems . In Proc. EI , volume 4675 , pages 50 -- 56 . SPIE , 2002 . S. Katzenbeisser and F. A. Petitcolas. Defining security in steganographic systems. In Proc. EI, volume 4675, pages 50--56. SPIE, 2002."},{"key":"e_1_3_2_1_17_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-16435-4_12","volume-title":"Proc. IH","author":"Ker A. D.","year":"2010","unstructured":"A. D. Ker . The square root law in stegosystems with imperfect information. In Proc. IH , volume 6387 of Lecture Notes in Computer Science , pages 145 -- 160 . Springer , 2010 . A. D. Ker. The square root law in stegosystems with imperfect information. In Proc. IH, volume 6387 of Lecture Notes in Computer Science, pages 145--160. Springer, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482513.2482965"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411328.1411349"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-012-9135-4"},{"key":"e_1_3_2_1_21_1","series-title":"Lecture Notes in Computer Science","first-page":"297","volume-title":"Proc. IH","author":"Le T. V.","year":"2006","unstructured":"T. V. Le and K. Kurosawa . Bandwidth optimal steganography secure against adaptive chosen stegotext attacks . In Proc. IH , volume 4437 of Lecture Notes in Computer Science , pages 297 -- 313 . Springer , 2006 . T. V. Le and K. Kurosawa. Bandwidth optimal steganography secure against adaptive chosen stegotext attacks. In Proc. IH, volume 4437 of Lecture Notes in Computer Science, pages 297--313. Springer, 2006."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.037"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.06.004"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.921684"}],"event":{"name":"IH&MMSec '16: ACM Information Hiding and Multimedia Security Workshop","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Vigo Galicia Spain","acronym":"IH&MMSec '16"},"container-title":["Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2909827.2930796","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2909827.2930796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:23Z","timestamp":1750220603000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2909827.2930796"}},"subtitle":["Provably Secure Steganography does not Necessarily Imply One-Way Functions"],"short-title":[],"issued":{"date-parts":[[2016,6,20]]},"references-count":24,"alternative-id":["10.1145\/2909827.2930796","10.1145\/2909827"],"URL":"https:\/\/doi.org\/10.1145\/2909827.2930796","relation":{},"subject":[],"published":{"date-parts":[[2016,6,20]]},"assertion":[{"value":"2016-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}