skip to main content
10.1145/3590777.3590797acmotherconferencesArticle/Chapter ViewAbstractPublication PageseiccConference Proceedingsconference-collections
short-paper

Improving Covert Channel Bandwidth by Variable-Length Exponent Re-Coding in Floating-Point Representations

Published:14 June 2023Publication History

ABSTRACT

In previous work, covert channels in network payload data were introduced that recode floating-point representations, yet introduce errors by modifying mantissa bits. The present research refines those covert channels for the case of fully reversible covert channels, i.e., where the original data is reconstructable by the covert receiver. By using knowledge about the distribution of the data over the number range, a variable length encoding of the exponent is derived that allows to improve covert channel bandwidth to levels comparable with previous work but without introducing errors to original data.

The approach is evaluated numerically for two example distributions with respect to bandwidth and detectability.

References

  1. Andrew Banks, Ed Briggs, Ken Borgendale, and Rahul Gupta. 2019. MQTT V5.0. OASIS Std.. https://docs.oasis-open.org/mqtt/mqtt/v5.0/os/mqtt-v5.0-os.pdfGoogle ScholarGoogle Scholar
  2. Javier Burgues, Juan Manuel Jimenez-Soto, and Santiago Marco. 2018. Estimation of the limit of detection in semiconductor gas sensors through linearized calibration models.Analytica chimica acta 1013 (2018), 13–25.Google ScholarGoogle Scholar
  3. Serdar Cabuk, Clara E. Brodley, and Clay Shields. 2009. IP Covert Channel Detection. ACM Transactions on Information and System Security (TISSEC) 12, 4 (April 2009), 22:1–22:29. https://doi.org/10.1145/1513601.1513604Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Carina Heßeling, Jörg Keller, and Sebastian Litzinger. 2022. Network Steganography Through Redundancy in Higher-Radix Floating-Point Representations. In ARES 2022: The 17th International Conference on Availability, Reliability and Security, Vienna,Austria, August 23 - 26, 2022. ACM, New York, NY, 48:1–48:7. https://doi.org/10.1145/3538969.3544429Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Carina Heßeling and Jörg Keller. 2022. Pareto-Optimal Covert Channels in Sensor Data Transmission. In EICC 2022: Proccedings of the European Interdisciplinary Cybersecurity Conference (Barcelona, Spain) (EICC 2022). Association for Computing Machinery, New York, NY, USA, 79–84. https://doi.org/10.1145/3528580.3532844Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. David A. Huffman. 1952. A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the IRE 40, 9 (1952), 1098–1101. https://doi.org/10.1109%2FJRPROC.1952.273898Google ScholarGoogle ScholarCross RefCross Ref
  7. IEEE754 2019. IEEE Standard for Floating-Point Arithmetic. https://doi.org/10.1109/IEEESTD.2019.8766229 IEEE Standard 754-2019 (Revision of IEEE 754-2008).Google ScholarGoogle Scholar
  8. Jörg Keller and Steffen Wendzel. 2021. Reversible and Plausibly Deniable Covert Channels in One-Time Passwords Based on Hash Chains. Applied Sciences 11, 2 (2021), 11 pages. https://doi.org/10.3390/app11020731Google ScholarGoogle Scholar
  9. Lawrence L. Larmore and Daniel S. Hirschberg. 1990. A Fast Algorithm for Optimal Length-Limited Huffman Codes. J. ACM 37, 3 (1990), 464–473. https://doi.org/10.1145/79147.79150Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Wojciech Mazurczyk, Przemyslaw Szary, Steffen Wendzel, and Luca Caviglione. 2019. Towards Reversible Storage Network Covert Channels. In Proceedings of the 14th International Conference on Availability, Reliability and Security, ARES 2019, Canterbury, UK, August 26-29, 2019. ACM, New York, NY, 69:1–69:8. https://doi.org/10.1145/3339252.3341493Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Wojciech Mazurczyk, Steffen Wendzel, Sebastian Zander, Amir Houmansadr, and Krzysztof Szczypiorski. 2016. Information Hiding in Communication Networks: Fundamentals, Mechanisms, and Applications. Wiley, New York, NY.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Tobias Schmidbauer and Steffen Wendzel. 2022. Detection Of Computational Intensive Reversible Covert Channels Based On Packet Runtime. J. Wirel. Mob. Networks Ubiquitous Comput. Dependable Appl. 13, 1 (2022), 137–166. https://doi.org/10.22667/JOWUA.2022.03.31.137Google ScholarGoogle Scholar
  13. Steffen Wendzel, Luca Caviglione, Wojciech Mazurczyk, Aleksandra Mileva, Jana Dittmann, Christian Krätzer, Kevin Lamshöft, Claus Vielhauer, Laura Hartmann, Jörg Keller, and Tom Neubert. 2021. A Revised Taxonomy of Steganography Embedding Patterns. In ARES 2021: The 16th International Conference on Availability, Reliability and Security, Vienna, Austria, August 17-20, 2021, Delphine Reinhardt and Tilo Müller (Eds.). ACM, New York, NY, 67:1–67:12. https://doi.org/10.1145/3465481.3470069Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Steffen Wendzel, Sebastian Zander, Bernhard Fechner, and Christian Herdin. 2015. Pattern-Based Survey and Categorization of Network Covert Channel Techniques. ACM Comput. Surv. 47, 3 (2015), 50:1–50:26. https://doi.org/10.1145/2684195Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Improving Covert Channel Bandwidth by Variable-Length Exponent Re-Coding in Floating-Point Representations

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Other conferences
              EICC '23: Proceedings of the 2023 European Interdisciplinary Cybersecurity Conference
              June 2023
              205 pages
              ISBN:9781450398299
              DOI:10.1145/3590777

              Copyright © 2023 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 14 June 2023

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • short-paper
              • Research
              • Refereed limited
            • Article Metrics

              • Downloads (Last 12 months)28
              • Downloads (Last 6 weeks)1

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            HTML Format

            View this article in HTML Format .

            View HTML Format