Reversible and Plausibly Deniable Covert Channels in One-Time Passwords Based on Hash Chains

Keller, Jörg and Wendzel, Steffen (2021) Reversible and Plausibly Deniable Covert Channels in One-Time Passwords Based on Hash Chains. Applied Sciences, 11 (2). p. 731. ISSN 2076-3417

[thumbnail of applsci-11-00731-v2.pdf] Text
applsci-11-00731-v2.pdf - Published Version

Download (298kB)

Abstract

Covert channels enable stealthy communications over innocent appearing carriers. They are increasingly applied in the network context. However, little work is available that exploits cryptographic primitives in the networking context to establish such covert communications. We present a covert channel between two devices where one device authenticates itself with Lamport’s one-time passwords based on a cryptographic hash function. Our channel enables plausible deniability jointly with reversibility and is applicable in different contexts, such as traditional TCP/IP networks, CPS/IoT communication, blockchain-driven systems and local inter-process communications that apply hash chains. We also present countermeasures to detect the presence of such a covert channel, which are non-trivial because hash values are random-looking binary strings, so that deviations are not likely to be detected. We report on experimental results with MD5 and SHA-3 hash functions for two covert channel variants running in a localhost setup. In particular, we evaluate the channels’ time performance, conduct statistical tests using the NIST suite and run a test for matching hash values between legitimate and covert environments to determine our channels’ stealthiness.

Item Type: Article
Subjects: Open Library Press > Engineering
Depositing User: Unnamed user with email support@openlibrarypress.com
Date Deposited: 13 Jan 2023 11:04
Last Modified: 13 Jan 2023 11:04
URI: https://openlibrarypress.com/id/eprint/73

Actions (login required)

View Item
View Item