{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T15:52:24Z","timestamp":1768837944647,"version":"3.49.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T00:00:00Z","timestamp":1625011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"LABEX MILYON","award":["ANR-10-LABX-0070"],"award-info":[{"award-number":["ANR-10-LABX-0070"]}]},{"name":"Investissements d\u2019Avenir","award":["ANR-11-IDEX-0007"],"award-info":[{"award-number":["ANR-11-IDEX-0007"]}]},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation","award":["CNS-1564067"],"award-info":[{"award-number":["CNS-1564067"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2021,6,30]]},"abstract":"<jats:p>\n            Consider a setting where Willie generates a Poisson stream of jobs and routes them to a single server that follows the first-in first-out discipline. Suppose there is an adversary Alice, who desires to receive service without being detected. We ask the question: What is the number of jobs that she can receive covertly, i.e., without being detected by Willie? In the case where both Willie and Alice jobs have exponential service times with respective rates \u03bc\n            <jats:sub>1<\/jats:sub>\n            and \u03bc\n            <jats:sub>2<\/jats:sub>\n            , we demonstrate a phase-transition when Alice adopts the strategy of inserting a single job probabilistically when the server idles: over\n            <jats:italic>n<\/jats:italic>\n            busy periods, she can achieve a covert throughput, measured by the expected number of jobs covertly inserted, of\n            <jats:italic>O<\/jats:italic>\n            (\u221a\n            <jats:italic>n<\/jats:italic>\n            ) when \u03bc\n            <jats:sub>1<\/jats:sub>\n            &lt; 2 \u03bc\n            <jats:sub>2<\/jats:sub>\n            ,\n            <jats:italic>O<\/jats:italic>\n            (\u221a\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ) when \u03bc\n            <jats:sub>1<\/jats:sub>\n            = 2\u03bc\n            <jats:sub>2<\/jats:sub>\n            , and\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>\n              \u03bc\n              <jats:sub>2<\/jats:sub>\n              \/\u03bc\n              <jats:sub>1<\/jats:sub>\n            <\/jats:sup>\n            ) when \u03bc\n            <jats:sub>1<\/jats:sub>\n            &gt; 2\u03bc\n            <jats:sub>2<\/jats:sub>\n            . When both Willie and Alice jobs have general service times, we establish an upper bound for the number of jobs Alice can execute covertly. This bound is related to the Fisher information. More general insertion policies are also discussed.\n          <\/jats:p>","DOI":"10.1145\/3462774","type":"journal-article","created":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T04:07:45Z","timestamp":1630728465000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Covert Cycle Stealing in a Single FIFO Server"],"prefix":"10.1145","volume":"6","author":[{"given":"Bo","family":"Jiang","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Nain","sequence":"additional","affiliation":[{"name":"Inria, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,9,3]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"G. Bachmann and L. Narici. 2012. Fourier and Wavelet Analysis. Springer Science & Business Media.  G. Bachmann and L. Narici. 2012. Fourier and Wavelet Analysis. Springer Science & Business Media."},{"key":"e_1_2_1_2_1","volume-title":"Nature Communications","volume":"6","author":"Bash B. A.","unstructured":"B. A. Bash , A. H. Gheorghe , M. Patel , J. L. Habif , D. Goeckel , D. Towsley , and S. Guha . 2015. Quantum-secure covert communication on Bosonic channels . In Nature Communications , Vol. 6 . B. A. Bash, A. H. Gheorghe, M. Patel, J. L. Habif, D. Goeckel, D. Towsley, and S. Guha. 2015. Quantum-secure covert communication on Bosonic channels. In Nature Communications, Vol. 6."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201912)","author":"Bash B. A.","unstructured":"B. A. Bash , D. Goeckel , and D. Towsley . 2012. Square root law for communication with low probability of detection on AWGN channels . In Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201912) . 448\u2013452. B. A. Bash, D. Goeckel, and D. Towsley. 2012. Square root law for communication with low probability of detection on AWGN channels. In Proceedings of the IEEE International Symposium on Information Theory (ISIT\u201912). 448\u2013452."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1177\/0008068319640304"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2530089"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the IEEE International Symposium on Information Theory. 448\u2013452","author":"Che P. H.","unstructured":"P. H. Che , M. Bakshi , C. Chan , and S. Jaggi . 2013. Reliable deniable communication with channel uncertainty . In Proceedings of the IEEE International Symposium on Information Theory. 448\u2013452 . P. H. Che, M. Bakshi, C. Chan, and S. Jaggi. 2013. Reliable deniable communication with channel uncertainty. In Proceedings of the IEEE International Symposium on Information Theory. 448\u2013452."},{"key":"e_1_2_1_7_1","unstructured":"T. M. Cover and J. A. Thomas. 2002. Elements of Information Theory (2nd ed.). John Wiley & Sons New York NY.  T. M. Cover and J. A. Thomas. 2002. Elements of Information Theory (2nd ed.). John Wiley & Sons New York NY."},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the IEEE Annual Computer Software and Applications Conference (COMPSAC\u201912)","author":"Emeakaroha V.","unstructured":"V. Emeakaroha , M. Netto T. Ferreto , I. Brandic , and C. De Rose . 2012. Casvid: Application level monitoring for SLA violation detection in clouds . In Proceedings of the IEEE Annual Computer Software and Applications Conference (COMPSAC\u201912) . 499\u2013508. V. Emeakaroha, M. Netto T. Ferreto, I. Brandic, and C. De Rose. 2012. Casvid: Application level monitoring for SLA violation detection in clouds. In Proceedings of the IEEE Annual Computer Software and Applications Conference (COMPSAC\u201912). 499\u2013508."},{"key":"e_1_2_1_9_1","volume-title":"Steganography in Digital Media: Principles, Algorithms, and Applications","author":"Fridrich J.","unstructured":"J. Fridrich . 2009. Steganography in Digital Media: Principles, Algorithms, and Applications . Cambridge University Press , Cambridge, UK . J. Fridrich. 2009. Steganography in Digital Media: Principles, Algorithms, and Applications. Cambridge University Press, Cambridge, UK."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 15th ACM Annual Symposium on Parallel Algorithms and Architectures. 274\u2013285","author":"Harchol-Balter M.","unstructured":"M. Harchol-Balter , C. Li , T. Osogami , A. Scheller-Wolf , and M. Squillante . 2003. Analysis of task assignment with cycle stealing under central queue . In Proceedings of the 15th ACM Annual Symposium on Parallel Algorithms and Architectures. 274\u2013285 . M. Harchol-Balter, C. Li, T. Osogami, A. Scheller-Wolf, and M. Squillante. 2003. Analysis of task assignment with cycle stealing under central queue. In Proceedings of the 15th ACM Annual Symposium on Parallel Algorithms and Architectures. 274\u2013285."},{"key":"e_1_2_1_11_1","unstructured":"B. Jiang P. Nain and D. Towsley. 2021. Covert Cycle Stealing in a Single FIFO Server (extended version). Retrieved from https:\/\/arxiv.org\/abs\/2003.05135.  B. Jiang P. Nain and D. Towsley. 2021. Covert Cycle Stealing in a Single FIFO Server (extended version). Retrieved from https:\/\/arxiv.org\/abs\/2003.05135."},{"key":"e_1_2_1_12_1","volume-title":"Theory","author":"Kleinrock L.","unstructured":"L. Kleinrock . 1975. Queueing Systems , Vol. 1 : Theory . Wiley-Interscience . L. Kleinrock. 1975. Queueing Systems, Vol. 1: Theory. Wiley-Interscience."},{"key":"e_1_2_1_13_1","volume-title":"Some Conditions for Consistency and Uniform Consistency of Statistical Procedures","author":"Kraft C. H.","unstructured":"C. H. Kraft . 1955. Some Conditions for Consistency and Uniform Consistency of Statistical Procedures . Vol. 2 . University of California Publications in Statistics, 125\u2013142. C. H. Kraft. 1955. Some Conditions for Consistency and Uniform Consistency of Statistical Procedures. Vol. 2. University of California Publications in Statistics, 125\u2013142."},{"key":"e_1_2_1_14_1","volume-title":"Information Theory and Statistics","author":"Kullback S.","unstructured":"S. Kullback . 1968. Information Theory and Statistics . Dover , Oxford, UK . S. Kullback. 1968. Information Theory and Statistics. Dover, Oxford, UK."},{"key":"e_1_2_1_15_1","unstructured":"E. Lehmann and J. Romano. 2005. Testing Statistical Hypotheses (3rd ed.). Springer New York.  E. Lehmann and J. Romano. 2005. Testing Statistical Hypotheses (3rd ed.). Springer New York."},{"key":"e_1_2_1_16_1","volume-title":"Mathematische Statistiek.","author":"Oosterhoff J.","unstructured":"J. Oosterhoff and W. R. Van Zwet . 1975. A note on contiguity and hellinger distance . In Mathematische Statistiek. Vol. 36 . Stichting Mathematisch Centrum . J. Oosterhoff and W. R. Van Zwet. 1975. A note on contiguity and hellinger distance. In Mathematische Statistiek. Vol. 36. Stichting Mathematisch Centrum."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the ACM Conference on Sigmetrics. 184\u2013195","author":"Osogami T.","unstructured":"T. Osogami , M. Harchol-Balter , and A. Scheller-Wolf . 2003. Analysis of cycle stealing with switching times and thresholds . In Proceedings of the ACM Conference on Sigmetrics. 184\u2013195 . T. Osogami, M. Harchol-Balter, and A. Scheller-Wolf. 2003. Analysis of cycle stealing with switching times and thresholds. In Proceedings of the ACM Conference on Sigmetrics. 184\u2013195."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1103384.1103387"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2812881"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2720736"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2548471"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"A. Yardi and T. Bodas. 2020. A covert queueing problem with busy period statistic. IEEE Commun. Lett. (2020).  A. Yardi and T. Bodas. 2020. A covert queueing problem with busy period statistic. IEEE Commun. Lett. (2020).","DOI":"10.1109\/ITW48936.2021.9611410"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3462774","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3462774","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3462774","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:27Z","timestamp":1750195887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3462774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,30]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6,30]]}},"alternative-id":["10.1145\/3462774"],"URL":"https:\/\/doi.org\/10.1145\/3462774","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"value":"2376-3639","type":"print"},{"value":"2376-3647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,30]]},"assertion":[{"value":"2020-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}