Homework #4

Due: March 5, 2012 Points: 100


  1. (25 points) Suppose the composite machine catdog (see Section 8.4.1) emits the same value from the left and the right. Show that it has received an even number of inputs from the left. (text, problem 8.7 modified)
  2. (30 points) Consider a scheme that allows a recipient to reply to a message from a chain of Cypherpunk remailers. Assume that encipherment is used throughout the chain.
    1. Bob selects a chain of remailers for the return path. He creates a set of keys and enciphers them so that only the key for the current remailer is visible to that remailer. Design a technique by which he could accomplish this. Describe how he would include this data in his message.
    2. How should Alice's mailer handle the processing of the return address information?
    3. When Bob receives the reply, what does it contain? How can he obtain the cleartext reply?
    (text, problem 14.3)
  3. (25 points) Revisit the example for x := y + z in Section 16.1.1. Assume that x does not exist in state s. Confirm that information flows from y and z to x by computing H(ys | xt), H(ys), H(zs | xs), and H(zs) and showing that H(ys | xs) ≤ H(ys) and H(zs | xs) ≤ H(zs)$ (text, problem 16.1)
  4. (20 points) Let L = (SL, ≤L) be a lattice. Define:
    1. SIL = { [a, b] | a, bSLaL b }
    2. IL = { ([a1, b1], [a2, b2]) | a1L a2b1L b2 }
    3. lubIL([a1, b1], [a2, b2]) = (lubL(a1, a2), lubL(b1, b2))
    4. glbIL([1, b1, [a2, b2]) = (glbL(a1, a2), glbL(b1, b2))
    Prove that the structure IL = (SL, ≤IL) is a lattice. (text, problem 16.2, modified)

Extra Credit

  1. (30 points) Prove that a system that meets the definition of generalized noninterference security also meets the definition of deducible security. (text, problem 8.6)

A PDF version is available here.
UC Davis sigil
ECS 235B, Foundations of Computer and Information Security
Winter Quarter 2012