{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:38Z","timestamp":1750220078540,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T00:00:00Z","timestamp":1655942400000},"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":[[2022,6,23]]},"DOI":"10.1145\/3531536.3532948","type":"proceedings-article","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T22:18:44Z","timestamp":1656022724000},"page":"147-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Capacity Laws for Steganography in a Crowd"],"prefix":"10.1145","author":[{"given":"Andrew D.","family":"Ker","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,23]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.5555\/647594.731520"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1214\/aoms\/1177729330"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/TIFS.2015.2470220"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1109\/TIFS.2011.2134094"},{"key":"e_1_3_2_1_5_1","volume-title":"Media Forensics and Security XI (Proc. SPIE","volume":"08","author":"Filler Tomas","year":"2009","unstructured":"Tomas Filler , Andrew D. Ker , and Jessica Fridrich . 2009 . The Square Root Law of Steganographic Capacity for Markov Covers . In Media Forensics and Security XI (Proc. SPIE , Vol. 7254). SPIE, Article 08 , 11 pages. https:\/\/doi.org\/10.1117\/12.805911 10.1117\/12.805911 Tomas Filler, Andrew D. Ker, and Jessica Fridrich. 2009. The Square Root Law of Steganographic Capacity for Markov Covers. In Media Forensics and Security XI (Proc. SPIE, Vol. 7254). SPIE, Article 08, 11 pages. https:\/\/doi.org\/10.1117\/12.805911"},{"key":"e_1_3_2_1_6_1","first-page":"1","article-title":"Divergences and Risks for Multiclass Experiments. In Proceedings of the 25th Annual Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 23). PMLR, Edinburgh","volume":"28","author":"Garc\u00eda-Garc\u00eda Dario","year":"2012","unstructured":"Dario Garc\u00eda-Garc\u00eda and Robert C. Williamson . 2012 . Divergences and Risks for Multiclass Experiments. In Proceedings of the 25th Annual Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 23). PMLR, Edinburgh , Scotland , 28 . 1 -- 28 .20. Dario Garc\u00eda-Garc\u00eda and Robert C. Williamson. 2012. Divergences and Risks for Multiclass Experiments. In Proceedings of the 25th Annual Conference on Learning Theory (Proceedings of Machine Learning Research, Vol. 23). PMLR, Edinburgh, Scotland, 28.1--28.20.","journal-title":"Scotland"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/LSP.2019.2929435"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1080\/01621459.1963.10500830"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1854229.1854267"},{"key":"e_1_3_2_1_10_1","first-page":"10","volume-title":"SPIE","volume":"12","author":"Ker Andrew D.","year":"2011","unstructured":"Andrew D. Ker . 2011 . A Curiosity Regarding Steganographic Capacity of Pathologically Nonstationary Sources. In Media Watermarking, Security, and Forensics XIII (Proc . SPIE , Vol. 7880). SPIE, Article 0E, 12 pages. https:\/\/doi.org\/ 10 .1117\/12.871885 10.1117\/12.871885 Andrew D. Ker. 2011. A Curiosity Regarding Steganographic Capacity of Pathologically Nonstationary Sources. In Media Watermarking, Security, and Forensics XIII (Proc. SPIE, Vol. 7880). SPIE, Article 0E, 12 pages. https:\/\/doi.org\/10.1117\/12.871885"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/3082031.3083235"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/TIFS.2014.2336380"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/18.61115"},{"key":"e_1_3_2_1_14_1","volume-title":"Smart","author":"Nigel","year":"2015","unstructured":"Nigel P. Smart . 2015 . Cryptography Made Simple. Springer . https:\/\/doi.org\/10.1007\/978--3--319--21936--3 10.1007\/978--3--319--21936--3 Nigel P. Smart. 2015. Cryptography Made Simple. Springer. https:\/\/doi.org\/10.1007\/978--3--319--21936--3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/ICME.2017.8019320"}],"event":{"sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"acronym":"IH&MMSec '22","name":"IH&MMSec '22: ACM Workshop on Information Hiding and Multimedia Security","location":"Santa Barbara CA USA"},"container-title":["Proceedings of the 2022 ACM Workshop on Information Hiding and Multimedia Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531536.3532948","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531536.3532948","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:22Z","timestamp":1750183762000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531536.3532948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,23]]},"references-count":15,"alternative-id":["10.1145\/3531536.3532948","10.1145\/3531536"],"URL":"https:\/\/doi.org\/10.1145\/3531536.3532948","relation":{},"subject":[],"published":{"date-parts":[[2022,6,23]]},"assertion":[{"value":"2022-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}