Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 11 of 11 for “"Timing Channel"”.
-
Efficient and Verifiable Timing Channel Protection for Multi-Core Processors
… systems are becoming increasingly vulnerable to timing channel attacks that leak confidential information through the timing of microarchitectural events. Many timing channel attacks are caused by the interference between different programs in the shared resources of a multi-core processor. For …
-
Timing channel codes for covert communication and network flow tracing
… unintended for data transmission. In a covert channel, only the sender and receiver are aware of the communication and capable of reading the transmitted message, and any other party would not be aware of the existence of this transmission. The timing channel has been studied as a medium for …
-
Detection of data leakage and disruption of covert timing channel in secure drone communication using machine and deep learning
… the detectability and disruptability of covert timing channel traffic in secure drones. The investigation aims to ascertain the effects of multiple interarrival times, distances ranging from 1 to 330 feet, various detection algorithms, and stream sizes between 32-bit and 256-bits on the …
-
Timing channels in traffic analysis
"We study two timing channel problems abstracted from practices of network traffic analysis. The first timing channel exists in a router receiving packets from two users; due to the sharing of router buffer, queuing delays of one user's packets incidentally convey information about the other user's …
-
Identifying the origins of business’ data breaches utilizing covert timing channels
… efficiently and from multiple locations. Covert timing channels are a cybersecurity attack method in which malicious actors embed privileged information into normal network traffic without authorization. Malicious actors, by carefully manipulating timing patterns in covert timing channels, can …
-
Achievable rates for queue-based timing stegocodes
… codes) for covert communication over timing channels. In a timing channel, the information resides in the packet interdeparture times as opposed to the packets themselves. The en- coding procedure should preserve the statistics of the packet interarrival process. Our steganographic …
-
A study of covert queueing channels in shared schedulers
We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user modulates messages to another user via his pattern of access to the shared resource. One example of such a channel …
-
Privacy-preserving techniques for computer and network forensics
… also be showing how law enforcement could use timing channel techniques to fingerprint anonymous servers that are running websites with illegal content and services. Finally I will show the results from a thought experiment about how network administrators can identify pattern-like software …
-
Scheduling with privacy constraints
… Bob wishes to learn about the pattern (size and timing) of jobs of Alice. Depending on the context, knowledge of this pattern could have serious implications on Alice's privacy and security. For instance, shared routers can reveal traffic patterns, shared memory access can reveal cloud usage …
-
Fine-grained reasoning about the security and usability trade-off in modern security tools
… and reason about the possibility of creating timing channel attacks against AV software. The attacker could infer information about the AV based only on the scanning time the AV spends to scan benign inputs. The other aspect of AV this dissertation explores is the low-level AV performance …
-
Communication and time distortion
… information can be conveyed by controlling the timing of packets when sent from their source towards their destination in a packet-switched network. By using Markov chain analysis, we prove a lower bound on the maximal channel coding rate achievable at a given blocklength and error probability. …