CS283 - Lecture 6 - Part 4 - Additional Topics - Covert Channels

CS283 Lecture 6- - Lecture 6 Part 4 Additional Topics Covert Channels GWU CS 172/283 Autumn 2009 Draws extensively from Memons notes Brooklyn Poly

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 6 Part 4 - Additional Topics – WU Covert Channels GWU CS 172/283 Autumn 2009 Draws extensively from Memon’s notes, Brooklyn Poly And book by Pfleeger, Chapters 3 and 4 11/16/2009 CS283- 172/Fall06/GWU/Vora/Identity
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Covert Channels ¾ A covert channel is a path of communication that was not esigned to be used for communication designed to be used for communication. ¾ Say p is a Trojan horse watching the instructor write the T/F answers in the test. q is the student who wrote the Trojan horse and who has an account on SEAS. To send a message the trojan horse p creates a file named outputs in q’s directory on SEAS. In this file, the number of spaces between two words veals a bit of information: 2 spaces is True, one space is reveals a bit of information: 2 spaces is True, one space is False. q can deny everything if accused. ¾ Different from traditional crypto in the sense that not only is essage encrypted in some sense but an adversary cannot message encrypted in some sense, but an adversary cannot even determine if it is present. GWU CS 172/283 - Autumn 2009 Holmblad - Lecture 06 – Part 4 - Rev 20091117 2
Background image of page 2
Storage channel ¾ A covert storage channel uses an attribute of the shared resource, for example, whether a file is locked or not. This attribute can be checked at pre-determined time intervals by the receiver. ¾ The Trojan horse p can create and erase a directory in q’s account, with a pre-determined name at pre-determined time intervals. ¾ If p does not have such access to the same a/c as q, then, as an alternative method, p can signal 1’s by creating a large file, using up available disk capacity, so that q cannot if q tries to as well. ¾ Note that p and q need to share a resource and a time cycle. GWU CS 172/283 - Autumn 2009 Holmblad - Lecture 06 – Part 4 - Rev 20091117 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Timing channel covert timing channel uses a temporal or ordering ¾ A covert timing channel uses a temporal or ordering relationship among accesses to a shared resource. It can also be thought of as a shared resource channel here the shared resource is time where the shared resource is time. ¾ Examples: iming attack on RSA (time of decryption helps factor n) ¾ Timing attack on RSA (time of decryption helps factor n).
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 12/05/2009.

Page1 / 20

CS283 Lecture 6- - Lecture 6 Part 4 Additional Topics Covert Channels GWU CS 172/283 Autumn 2009 Draws extensively from Memons notes Brooklyn Poly

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online