research-article

Open access

Multilevel Network Steganography in Fountain Codes

Author:

Jörg KellerAuthors Info & Claims

EICC '21: Proceedings of the 2021 European Interdisciplinary Cybersecurity Conference

Pages 72 - 76

https://doi.org/10.1145/3487405.3487420

Published: 22 November 2021 Publication History

All formats PDF

Abstract

We present a method to establish a network storage covert channel in a fountain code, which is used to provide reliable communication over lossy network with low overhead and without acknowledgment. As also parts of the secret message get lost when a carrier packet is lost, reliable transmission of the secret message is provided by using a second fountain code. Thus, our proposal opens the possibility for a multilevel steganographic method. We evaluate a proof-of-concept implementation that uses LT-codes and demonstrate that activation of the covert channel does not deteriorate the reliability of the carrier. We also discuss countermeasures that limit the possibilities for covert channels in fountain codes.

References

[1]

Rennie Archibald and Dipak Ghosal. 2012. A Covert Timing Channel Based on Fountain Codes. In 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2012, Liverpool, United Kingdom, June 25-27, 2012, Geyong Min, Yulei Wu, Lei (Chris) Liu, Xiaolong Jin, Stephen A. Jarvis, and Ahmed Yassin Al-Dubai (Eds.). IEEE Computer Society, Los Alamitos, CA, 970–977. https://doi.org/10.1109/TrustCom.2012.21

Digital Library

[2]

Lawrence E. Bassham III. 2002. The Advanced Encryption Standard Algorithm Validation Suite (AESAVS). Technical Report. National Institute of Standards and Technology, Gaithersburg, MD.

[3]

John W. Byers, Michael Luby, Michael Mitzenmacher, and Ashutosh Rege. 1998. A Digital Fountain Approach to Reliable Distribution of Bulk Data. In Proceedings of the ACM SIGCOMM 1998 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 31 - September 4, 1998, Vancouver, B.C., Canada, Gerald Neufeld, Gary S. Delp, Jonathan Smith, and Martha Steenstrup (Eds.). ACM, New York, NY, 56–67. https://doi.org/10.1145/285237.285258

Digital Library

[4]

Wojciech Fraczek, Wojciech Mazurczyk, and Krzysztof Szczypiorski. 2012. Multilevel Steganography: Improving Hidden Communication in Networks. J. Univers. Comput. Sci. 18, 14 (2012), 1967–1986. https://doi.org/10.3217/jucs-018-14-1967

[5]

Jessica Fridrich, Miroslav Goljan, and David Soukal. 2005. Perturbed quantization steganography. Multimedia Systems 11, 2 (01 Dec 2005), 98–107. https://doi.org/10.1007/s00530-005-0194-3

Digital Library

[6]

Weiwei Liu, Guangjie Liu, Jiangtao Zhai, Yuewei Dai, and Dipak Ghosal. 2016. Designing Analog Fountain Timing Channels: Undetectability, Robustness, and Model-Adaptation. IEEE Trans. Inf. Forensics Secur. 11, 4 (2016), 677–690. https://doi.org/10.1109/TIFS.2015.2505688

Digital Library

[7]

Michael Luby. 2002. LT codes. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.IEEE, New York, NY, 271–280. https://doi.org/10.1109/SFCS.2002.1181950

[8]

Norka B. Lucena, Grzegorz Lewandowski, and Steve J. Chapin. 2005. Covert Channels in IPv6. In Privacy Enhancing Technologies, 5th International Workshop, PET 2005, Cavtat, Croatia, May 30-June 1, 2005, Revised Selected Papers(Lecture Notes in Computer Science, Vol. 3856), George Danezis and David M. Martin Jr. (Eds.). Springer, Berlin, 147–166. https://doi.org/10.1007/11767831_10

Digital Library

[9]

Wojciech Mazurczyk, Steffen Wendzel, Mehdi Chourib, and Jörg Keller. 2019. Countering adaptive network covert communication with dynamic wardens. Future Gener. Comput. Syst. 94 (2019), 712–725. https://doi.org/10.1016/j.future.2018.12.047

Digital Library

[10]

Wojciech Mazurczyk, Steffen Wendzel, Sebastian Zander, Amir Houmansadr, and Krzysztof Szczypiorski. 2016. Information Hiding in Communication Networks. Wiley-IEEE, Hoboken, NJ.

[11]

Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone. 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL.

[12]

Michele Rossi, Giovanni Zanca, Luca Stabellini, Riccardo Crepaldi, Albert F. Harris III, and Michele Zorzi. 2008. SYNAPSE: A Network Reprogramming Protocol for Wireless Sensor Networks Using Fountain Codes. In Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2008, June 16-20, 2008, Crowne Plaza, San Francisco International Airport, California, USA. IEEE, New York, NY, 188–196. https://doi.org/10.1109/SAHCN.2008.32

[13]

Amin Shokrollahi. 2006. Raptor codes. IEEE Trans. Inf. Theory 52, 6 (2006), 2551–2567. https://doi.org/10.1109/TIT.2006.874390

Digital Library

[14]

Shu Tezuka. 1995. Derandomization. In Uniform Random Numbers. Springer International Series in Engineering and Computer Science (Discrete Event Dynamic Systems), Vol. 315. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2317-8_6

[15]

Osman Ugus. 2013. Secure and Reliable Remote Programming in Wireless Sensor Networks. Ph.D. Dissertation. FernUniversität in Hagen. http://deposit.fernuni-hagen.de/2915/

[16]

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.3470069

Digital Library

[17]

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/2684195

Digital Library

Cited By

Keller JImhof SSobe P(2024)Error correction and erasure codes for robust network steganographyJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2024.103191153:COnline publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1016/j.sysarc.2024.103191
Keller JLangsdorf S(2023)Error Codes in and for Network SteganographyArchitecture of Computing Systems10.1007/978-3-031-42785-5_6(81-93)Online publication date: 13-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-42785-5_6
Flowers R(2022)A Zero-Day Cloud Timing Channel AttackIEEE Access10.1109/ACCESS.2022.322742010(128177-128186)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3227420

Recommendations

Combined Fountain Code with Network Coding in Cooperative Communication
NSWCTC '10: Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02

In this paper, we will investigate the block error rate (BLER) performance in cooperative communication, through combining fountain code with network coding. Contrast to the fixed-rate code, the rate of fountain code is not determined in advance, since ...
Application of Chaos in Digital Fountain Codes
ICYCS '08: Proceedings of the 2008 The 9th International Conference for Young Computer Scientists

Fountain codes provide an efficient and reliable way to transfer information over erasure channels like Internet. LT codes are the first practical realization of Fountain codes. Implementation of fountain codes usually realizes the randomness in the ...
Designing of Fountain Codes in Cooperative Relay Systems
NSWCTC '10: Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 02

As the degree distribution of fountain codes plays a key role in affecting their performance, this paper presents a designing method of degree distribution based on the characteristics of relay systems, and optimizes the fountain codes in 3GPP. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences

EICC '21: Proceedings of the 2021 European Interdisciplinary Cybersecurity Conference

November 2021

97 pages

ISBN:9781450390491

DOI:10.1145/3487405

Copyright © 2021 Owner/Author.

This work is licensed under a Creative Commons Attribution International 4.0 License.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 November 2021

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

EICC '21

EICC '21: European Interdisciplinary Cybersecurity Conference

November 10 - 11, 2021

Virtual Event, Romania

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
270
Total Downloads

Downloads (Last 12 months)102
Downloads (Last 6 weeks)14

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Keller JImhof SSobe P(2024)Error correction and erasure codes for robust network steganographyJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2024.103191153:COnline publication date: 1-Aug-2024
https://dl.acm.org/doi/10.1016/j.sysarc.2024.103191
Keller JLangsdorf S(2023)Error Codes in and for Network SteganographyArchitecture of Computing Systems10.1007/978-3-031-42785-5_6(81-93)Online publication date: 13-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-42785-5_6
Flowers R(2022)A Zero-Day Cloud Timing Channel AttackIEEE Access10.1109/ACCESS.2022.322742010(128177-128186)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3227420

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents