Chapter 12: Demand Privacy in Coded Caching

Learning Objectives

• Define information-theoretic demand privacy: eavesdroppers learn zero information about demands
• Prove the Wan-Caire result: demand-private shared-link coded caching achieves the same rate as non-private MAN
• Construct the shared-randomness-based private scheme
• Extend to D2D private caching with user collusion
• Analyze the Wan-Sun-Ji-Tuninetti-Caire result on colluding coalitions of size $z$
• Distinguish information-theoretic privacy from computational privacy