1
Sneak-Peek: High Speed Covert Channels in Data Center Networks Rashid Tahir*, Mohammad Taha Khan , Xun Gong*, Adnan Ahmed , Amerimad Ghassami*, Hasanat Kazmi , Matthew Caesar* Fareed Zaffar and Negar Kiyavash* University of Illinois at Urbana Champaign* University of Illinois at Chicago Lahore University of Management Sciences The Problem: Clouds, Businesses and Users Modern businesses face an increasing need to store sensitive information on the cloud. Clouds are multi-tenant infrastructures that share resources for achieving economies of scale. Cloud enterprises employ shared management and statistical multiplexing on physical recourses for efficient utilization. The necessity of shared infrastructure leads to the danger of information leakage across tenants. Covert and side channels are a concern as they can easily bypass network monitors and cause sensitive data exfiltration. The Contributions of Our Work Construction of a high speed timing based covert channel. Derivation of a mathematical model along with analysis of an upper bound on the channel bitrate. Empirical evaluations of the achieved bitrate in an in-house environment as well as on EC2 and Azure clouds. Discussion of possible mitigation techniques for our channel. Channel Construction and Analysis Our channel is of a unidirectional nature and operates across virtually isolated networks Our channel is modeled as a FIFO queue shared by two packet processes on different networks To maintain queue stability, the maximum achievable information rate proposed by our channel is 67% of the bitrate. The Adaptive decoding algorithms leverages on the following methodologies to minimize channel error rates: L S 1 S 2 Infected Machine T 1 U 2 T 2 U 1 . 6 7 8 9 5 4 3 n . . . . 1 2 . 9 . . . 8 7 6 . n 4 5 3 1 2 Receiver observes delays Bursty Traffic (Signaling 0 or 1) Sender sends without delays Covert Channel Threshold Evaluation: Calculating accurate cutoffs for 0’s & 1’s Bit Marking: Synchronizing clocks at the sender and receiver Delay (ms) Time (seconds) 0.1 1.35 0.4 1.2 2 1.1 0.85 0.6 0.35 Channel Evaluation We use a UDP based scheme to evaluate the covert channel in various environments. For a realistic evaluation, cross traffic is generated as temporally spaced UDP and TCP flows of varying duration and size The Hurst measure of self similarity for our covert channel remains well below the threshold of anomalous behavior. To optimize our channel we also consider the following empirical factors: Achieved Error Rates 0 5 10 15 20 25 30 35 A1 A5 Percentage Error A3 VM Instance 1 bps 10 bps 100 bps In House Cloud Microsoft Azure Empirical Evaluation Parameters Covert Channel Message Encoding Adaptive Decoding Scheme Mitigation Techniques Leveraging on the over-provisioned paths between nodes and high quality load balancers in data-centers, we suggest “path-hopping” to rate limit the capacity of the covert channel. Flow Selection: Can be done based on flow similarity, flow timing or just random. Flow Placement: Performed randomly, or by selecting either the earliest available or least crowded link. Effect of Total Traffic Load/Network Conditions Effect of Packet Size Effect of Queuing Policy and Hypervisor 0 5 10 15 20 0 1 2 3 Time (seconds) Packet Latnecy (ms) Peaks Showing Downtime During Migration Results From a Random Selection and Random Placement Migration Scheme

Sneak-Peek: High Speed Covert Channels in Data Center Networks · Sneak-Peek: High Speed Covert Channels in Data Center Networks Rashid Tahir*, Mohammad Taha Khan , Xun Gong*, Adnan

  • Upload
    others

  • View
    6

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Sneak-Peek: High Speed Covert Channels in Data Center Networks · Sneak-Peek: High Speed Covert Channels in Data Center Networks Rashid Tahir*, Mohammad Taha Khan , Xun Gong*, Adnan

Sneak-Peek: High Speed Covert Channels in Data Center NetworksRashid Tahir*, Mohammad Taha Khan✩, Xun Gong*, Adnan Ahmed†, Amerimad Ghassami*, Hasanat Kazmi†, Matthew Caesar*

Fareed Zaffar† and Negar Kiyavash* University of Illinois at Urbana Champaign* University of Illinois at Chicago✩

Lahore University of Management Sciences†

The Problem: Clouds, Businesses and Users

▪ Modern businesses face an increasing need to store sensitive information on the cloud.

▪ Clouds are multi-tenant infrastructures that share resources for achieving economies of scale.

▪ Cloud enterprises employ shared management and statistical multiplexing on physical recourses for efficient utilization.

▪ The necessity of shared infrastructure leads to the danger of information leakage across tenants.

▪ Covert and side channels are a concern as they can easily bypass network monitors and cause sensitive data exfiltration.

The Contributions of Our Work

▪ Construction of a high speed timing based covert channel.

▪ Derivation of a mathematical model along with analysis of an upper bound on the channel bitrate.

▪ Empirical evaluations of the achieved bitrate in an in-house environment as well as on EC2 and Azure clouds.

▪ Discussion of possible mitigation techniques for our channel.

Channel Construction and Analysis

▪ Our channel is of a unidirectional nature and operates across virtually isolated networks

▪ Our channel is modeled as a FIFO queue shared by two packet processes on different networks

▪ To maintain queue stability, the maximum achievable information rate proposed by our channel is 67% of the bitrate.

▪ The Adaptive decoding algorithms leverages on the following methodologies to minimize channel error rates:

L

S1 S2Infected Machine T1

U2

T2

U1

.6 7 8 9543 n. . . .1 2 .9 . . .876 . n4 531 2

Receiver observes delays

Bursty Traffic (Signaling 0 or 1)

Sender sends without delays

Covert Channel

• Threshold Evaluation: Calculating accurate cutoffs for 0’s & 1’s• Bit Marking: Synchronizing clocks at the sender and receiver

Del

ay (m

s)

Time (seconds)0.1 1.35

0.41.22

1.10.850.60.35

Channel Evaluation

▪ We use a UDP based scheme to evaluate the covert channel in various environments.

▪ For a realistic evaluation, cross traffic is generated as temporally spaced UDP and TCP flows of varying duration and size

▪ The Hurst measure of self similarity for our covert channel remains well below the threshold of anomalous behavior.

▪ To optimize our channel we also consider the following empirical factors:

Achieved Error Rates

05

101520253035

A1 A5

Per

cent

age

Err

or

A3VM Instance

1 bps10 bps100 bps

• In House Cloud

• Microsoft Azure

Empirical Evaluation Parameters

Covert Channel Message Encoding

Adaptive Decoding Scheme

Mitigation Techniques

▪ Leveraging on the over-provisioned paths between nodes and high quality load balancers in data-centers, we suggest “path-hopping” to rate limit the capacity of the covert channel.

▪ Flow Selection: Can be done based on flow similarity, flow timing or just random.

▪ Flow Placement: Performed randomly, or by selecting either the earliest available or least crowded link.

• Effect of Total Traffic Load/Network Conditions • Effect of Packet Size• Effect of Queuing Policy and Hypervisor

0 5 10 15 200

1

2

3

Time (seconds)Pack

et L

atne

cy (m

s)

Peaks Showing Downtime During Migration

Results From a Random Selection and Random Placement Migration Scheme