Covert communication refers to the process of communicating data through a channel that is neither designed, nor intended to transfer information. Traditionally, covert channels are considered as security threats in computer systems and a great deal of attention has been given to countermeasures for covert communication schemes. The evolution of computer networks led the communication community to revisit the concept of covert communication not only as a security threat but also as an alternative way of providing security and privacy to communication networks. In fact, the heterogeneous structure of computer networks and the diversity of communication protocols provide an appealing setting for covert channels. This dissertation is an exploration on a novel design methodology for undetectable and robust covert channels in communication networks. Our new design methodology is based on the concept of behavioral mimicry in computer systems. The objective is to design a covert transmitter that has enough degrees of freedom to behave like an ordinary transmitter and react normally to unpredictable network events, yet it has the ability to modulate a covert message over its behavioral fingerprints in the network. To this end, we argue that the inherent randomness in communication protocols and network environments is the key in finding the proper medium for network covert channels. We present a few examples on how random behaviors in communication protocols lead to discovery of suitable shared resources for covert channels. The proposed design methodology is tested on two new covert communication schemes, one is designed for wireless networks and the other one is optimized for public communication networks (e.g., Internet). Each design is accompanied by a comprehensive analysis from undetectability, achievable covert rate and reliability perspectives. In particular, we introduced turbo covert channels, a family of extremely robust model-based timing covert channels that achieve provable polynomial undetectability in public communication networks. This means that the covert channel is undetectable against any polynomial-time statistical test that analyzes samples of the covert traffic and the legitimate traffic of the network. Target applications for the proposed covert communication schemes are discussed including detailed practical scenarios in which the proposed channels can be implemented.

A covert communications network (CCN) is a connected, overlay peer-to-peer network used to support communications within a group in which the survival of the group depends on the confidentiality and anonymity of communications, on concealment of participation in the network to both other members of the group and external eavesdroppers, and finally on resilience against disconnection. In this dissertation, we describe the challenges and requirements for such a system. We consider the topologies of resilient covert communications networks that: (1) minimize the impact on the network in the event of a subverted node; and (2) maximize the connectivity of the survivor network with the removal of the subverted node and its closed neighborhood. We analyze the properties of resilient covert networks, propose measurements for determining the suitability of a topology for use in a covert communication network, and determine the properties of an optimal covert network topology. We analyze multiple topologies and identify two constructions that are capable of generating optimal topologies. We then extend these constructions to produce near-optimal topologies that can “grow” as new nodes join the network. We also address protocols for membership management and routing. Finally, we describe the architecture of a prototype system for instantiating a CCN.

Covert communication refers to the process of communicating data through a channel that is neither designed, nor intended to transfer information. Traditionally, covert channels are considered as security threats in computer systems and a great deal of attention has been given to countermeasures for covert communication schemes. The evolution of computer networks led the communication community to revisit the concept of covert communication not only as a security threat but also as an alternative way of providing security and privacy to communication networks. In fact, the heterogeneous structure of computer networks and the diversity of communication protocols provide an appealing setting for covert channels. This dissertation is an exploration on a novel design methodology for undetectable and robust covert channels in communication networks. Our new design methodology is based on the concept of behavioral mimicry in computer systems. The objective is to design a covert transmitter that has enough degrees of freedom to behave like an ordinary transmitter and react normally to unpredictable network events, yet it has the ability to modulate a covert message over its behavioral fingerprints in the network. To this end, we argue that the inherent randomness in communication protocols and network environments is the key in finding the proper medium for network covert channels. We present a few examples on how random behaviors in communication protocols lead to discovery of suitable shared resources for covert channels. The proposed design methodology is tested on two new covert communication schemes, one is designed for wireless networks and the other one is optimized for public communication networks (e.g., Internet). Each design is accompanied by a comprehensive analysis from undetectability, achievable covert rate and reliability perspectives. In particular, we introduced turbo covert channels, a family of extremely robust model-based timing covert channels that achieve provable polynomial undetectability in public communication networks. This means that the covert channel is undetectable against any polynomial-time statistical test that analyzes samples of the covert traffic and the legitimate traffic of the network. Target applications for the proposed covert communication schemes are discussed including detailed practical scenarios in which the proposed channels can be implemented.

No description available.

Background. Coverless steganography is a relatively unexplored area of steganography where the message is not embedded into a cover media. Instead the message is derived from one or several properties already existing in the carrier media. This renders steganalysis methods used for traditional steganography useless. Early coverless methods were applied to images or texts but more recently the possibilities in the video and audio domain have been explored. The audio domain still remains relatively unexplored however, with the earliest work being presented in 2022. In this thesis, we narrow the existing research gap by proposing an audio-compatible method which uses the timestamp that marks when a carrier media was received to generate a time-based key which can be applied to the hash produced by said carrier. This effectively allows one carrier to represent a range of different hashes depending on the timestamp specifying when it was received, increasing capacity. Objectives. The objectives of the thesis are to explore what features of audio are suitable for steganographic use, to establish a method for finding audio clips which can represent a specific message to be sent and to improve on the current state-of-the-art method, taking capacity, robustness and cost into consideration. Methods. A literature review was first conducted to gain insight on techniques used in previous works. This served both to illuminate features of audio that could be used to good effect in a coverless approach, and to identify coverless approaches which could work but had not been tested yet. Experiments were then performed on two datasets to show the effective capacity increase of the proposed method when used in tandem with the existing state-of-the-art method for coverless audio steganography. Additional robustness tests for said state-of-the-art method were also performed. Results. The results show that the proposed method could increase the per-message capacity from eight bits to 16 bits, while still retaining 100% effective capacity using only 200 key permutations, given a database consisting of 50 one-minute long audio clips. They further show that the time cost added by the proposed method is in total less than 0.1 seconds for 2048 key permutations. The robustness experiments show that the hashing algorithms used in the state-of-the-art method have high robustness against additive white gaussian noise, low-pass filters, and resampling attacks but are weaker against compression and band-pass filters.  Conclusions. We address the scientific gap and complete our objectives by proposing a method which can increase capacity of existing coverless steganography methods. We demonstrate the capacity increase our method brings by using it in tandem with the state-of-the-art method for the coverless audio domain. We argue that our method is not limited to the audio domain, or to the coverless method with which we performed our experiments. Finally, we discuss several directions for future works. / Bakgrund. Täcklös steganografi är ett relativt outforskat område inom steganografi där meddelandet, istället för att gömmas i ett medium, representeras av en eller flera egenskaper som kan erhållas från mediet. Detta faktum hindrar nuvarande steganalysmetoder från att upptäcka bruk av täcklös steganografi. Tidiga studier inom området behandlar bilder och text, senare studier har utökat området genom att behandla video och ljud. Den första studien inom täcklös ljudsteganografi publicerades år 2022. Målet med examensarbetet är att utöka forskningen med en föreslagen ljudkompatibel metod som använder tidsstämpeln då ett meddelande mottagits för att skapa en tidsbaserad nyckel som kan appliceras på en hash erhållen från ett steganografiskt medium. Detta tillåter mediet att representera olika hashar beroende på tiden, vilket ökar kapaciteten.   Syfte. Syftet med examensarbetet är att utforska vilka egenskaper i ett ljudmedia som lämpar sig åt steganografiskt bruk, att skapa en metod som kan hitta ljudklipp som representerar ett efterfrågat meddelande, samt att förbättra nuvarande state-of-the-art inom täcklös ljudsteganografi genom att finna en bra balans mellan kapacitet, robusthet och kostnad.   Metod. En litteraturstudie utfördes för att få förståelse för metoder använda i tidigare studier. Syftet var att hitta egenskaper i ljud som lämpar sig åt täcklös ljudsteganografi samt identifiera icke-täcklösa metoder som skulle kunna anpassas för att fungera som täcklösa. Experiment utfördes sedan på två dataset för att påvisa den ökning i effektiv kapacitet den föreslagna metoden ger när den appliceras på state-of-the-art-metoden inom täcklös ljudsteganografi. Experiment utfördes även för att utöka tidigare forskning på robustheten av state-of-the-art-metoden inom täcklös ljudsteganografi. Resultat. Resultaten visar att den föreslagna metoden kan öka kapaciteten per meddelande från åtta till 16 bits med 100% effektiv kapacitet med 200 nyckelpermutationer och en databas bestående av 50 stycken en-minut långa ljudklipp. De visar även att tidskostnaden för den föreslagna metoden är mindre än 0,1 sekund för 2048 nyckelpermutationer. Experimenten på robusthet visar att state-of-the-art-metoden har god robusthet mot additivt vitt gaussiskt brus, lågpassfilter och omsampling men är svagare mot kompression och bandpassfilter. Slutsatser. Vi fullbordar målen och utökar forskningen inom området genom att föreslå en metod kan öka kapaciteten av befintliga täcklösa metoder. Vi demonstrerar kapacitetsökningen genom att applicera vår metod på den senaste täcklösa ljudsteganografimetoden. Vi presenterar argument för vår metods tillämpning i områden utanför ljuddomänen och utanför metoden som den applicerades på. Slutligen diskuteras riktningar för framtida forskning.

No description available.