Secured Data Transmission Over Insecure Networks-on-Chip by Modulating Inter-Packet Delays

As the network-on-chip (NoC) integrated into an SoC design can come from an untrusted third party, there is a growing risk that data integrity and security get compromised when supposedly sensitive data flows through such an untrusted NoC. We thus introduce a new method that can ensure secure and secret data transmission over such an untrusted NoC. Essentially, the proposed scheme relies on encoding binary data as delays between packets travelling across the source and destination pair. The maximum data transmission rate of this inter-packet-delay (IPD)-based communication channel can be determined from the analytical model developed in this article. To further improve the undetectability and robustness of the proposed data transmission scheme, a new block coding method and communication protocol are also proposed. Experimental results show that the proposed IPD-based method can achieve a packet error rate (PER) of as low as 0.3% and an effective throughput of $\boldsymbol {2.3\times 10^{5}}$ b/s, outperforming the methods of thermal covert channel, cache covert channel, and circuit-based encryption and, thus, is suitable for secure data transmission in unsecure systems

A survey of timing channels and countermeasures

A timing channel is a communication channel that can transfer information to a receiver/decoder by modulating the timing behavior of an entity. Examples of this entity include the interpacket delays of a packet stream, the reordering packets in a packet stream, or the resource access time of a cryptographic module. Advances in the information and coding theory and the availability of high-performance computing systems interconnected by high-speed networks have spurred interest in and development of various types of timing channels. With the emergence of complex timing channels, novel detection and prevention techniques are also being developed to counter them. In this article, we provide a detailed survey of timing channels broadly categorized into network timing channel, in which communicating entities are connected by a network, and in-system timing channel, in which the communicating entities are within a computing system. This survey builds on the last comprehensive survey by Zander et al. [2007] and considers all three canonical applications of timing channels, namely, covert communication, timing side channel, and network flow watermarking. We survey the theoretical foundations, the implementation, and the various detection and prevention techniques that have been reported in literature. Based on the analysis of the current literature, we discuss potential future research directions both in the design and application of timing channels and their detection and prevention techniques

Building Covert Timing Channel of the IoT-'Enabled MTS Based on Multi-Stage Verification

Although the global shipping industry is experiencing a productivity revolution due to the adoption of IoTs (Internet of Things), the dependence on complex data transmission and interactive centers is also increasing, which makes the IoT-enabled Maritime Transportation Systems (MTS) one of the most valuable but vulnerable industries against network security attacks. To guarantee the transmission security of confidential data, an important alternative in an untrustworthy IoT-enabled MTS is to apply the covert timing channels. This paper mainly introduces the construction of covert timing channel with low bit shifting rate and high reliability by multi-stage verification and error correction. For the covert timing channel schemes realized by active packet loss, the packet loss noise interferes with the channel's reliability. However, due to the constraints of stealthiness, the active packet loss ratio during covert communication is low, so more effective reliable strategies are needed to reduce noise interference. In the excellent scenario, when the bit error rate is lower than 0.08%, the transmission performance is kept at 0.49 bps. In the good scenario with strong network noise, although this method loses some performance, it can still maintain the transmission performance of 0.2 bps under the condition of bit error rate less than 1%, which effectively proves the effectiveness of multi-stage verification and error correction

Behavioral Mimicry Covert Communication

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

Funnel Vision: Through the Looking Glass of Recruitment and Admission Practices

This inquiry employed a convergent mixed-methods case study through a collaborative partnership with a College of Education at a private, West Coast Jesuit university. The study’s purpose was to interrogate recruitment and admission policies and practices of a Student Affairs graduate program to determine the extent to which they did or did not align with equity- and justice-oriented principles. The Education Deans for Justice and Equity framework, Critical Race Theory, and Social Reproduction Theory served as the conceptual and theoretical frameworks for this study. Research participants were employees and students associated with the program and its recruitment and admissions processes. Data collection involved interviews, focus groups, artifacts, and electronic surveys. Data analyses revealed four overarching themes: (1) recognition of mission-driven philosophy, (2) integration of practices to values, (3) expansion of fiscal resources, and (4) development of human capital. Recruitment recommendations included: (a) implement a graduate enrollment management plan; (b) collaborating with key stakeholders to develop policies and clear role responsibilities; (c) expanding and diversifying recruitment and outreach strategies; (d) using CRM data to leverage a return on investment of recruitment activities; and, (e) updating recruitment imagery on printed and digital materials Admissions recommendations included: (a) articulation of the true costs of college attendance before and after the application of financial assistance; (b) clarifying and strengthening graduate assistantship and internship structures; (c) conducting a regular program assessment to strengthen equity and justice-oriented goals; (d) developing intentional collaborative practices across university departments; and, (d) implementing a developmental process to support applicants through the graduate admission process

Building Security Protocols Against Powerful Adversaries

As our sensitive data is increasingly carried over the Internet and stored remotely, security in communications becomes a fundamental requirement. Yet, today's security practices are designed around assumptions the validity of which is being challenged. In this thesis we design new security mechanisms for certain scenarios where traditional security assumptions do not hold. First, we design secret-agreement protocols for wireless networks, where the security of the secrets does not depend on assumptions about the computational limitations of adversaries. Our protocols leverage intrinsic characteristics of the wireless to enable nodes to agree on common pairwise secrets that are secure against computationally unconstrained adversaries. Through testbed and simulation experimentation, we show that it is feasible in practice to create thousands of secret bits per second. Second, we propose a traffic anonymization scheme for wireless networks. Our protocol aims in providing anonymity in a fashion similar to Tor - yet being resilient to computationally unbounded adversaries - by exploiting the security properties of our secret-agreement. Our analysis and simulation results indicate that our scheme can offer a level of anonymity comparable to the level of anonymity that Tor does. Third, we design a lightweight data encryption protocol for protecting against computationally powerful adversaries in wireless sensor networks. Our protocol aims in increasing the inherent weak security that network coding naturally offers, at a low extra overhead. Our extensive simulation results demonstrate the additional security benefits of our approach. Finally, we present a steganographic mechanism for secret message exchange over untrustworthy messaging service providers. Our scheme masks secret messages into innocuous texts, aiming in hiding the fact that secret message exchange is taking place. Our results indicate that our schemes succeeds in communicating hidden information at non-negligible rates

Spartan Daily, February 2, 1977

Volume 68, Issue 2https://scholarworks.sjsu.edu/spartandaily/6156/thumbnail.jp