References & Further Reading

References

  1. A. Sengupta, R. Tandon, and T. C. Clancy, Fundamental Limits of Caching with Secure Delivery, 2015

    Original STC paper. Establishes the $M \geq 1$ lower bound and the achievable scheme. Foundation of Chapter 17.

  2. M. A. Maddah-Ali and U. Niesen, Fundamental Limits of Caching, 2014

    MAN scheme; baseline for STC's combinatorial structure.

  3. K. Wan and G. Caire, On Coded Caching with Private Demands, 2021

    CommIT paper on demand privacy (Ch 12). Contrast with STC's delivery secrecy.

  4. A. Shamir, How to Share a Secret, 1979

    Original Shamir secret sharing paper. Foundational for §17.3.

  5. A. D. Wyner, The Wire-Tap Channel, 1975

    Foundational paper on information-theoretic secrecy. Background for secure delivery.

  6. H. Awan, A. Sengupta, and R. Tandon, Secure Caching under Distinct Files, 2018

    Extends STC to more general demand structures.

  7. A. Zewail and A. Yener, Combination Networks with or without Secrecy Constraints, 2016

    Multi-hop secure coded caching.

  8. V. Ravindrakumar, P. Panda, N. Karamchandani, and V. Prabhakaran, Private Coded Caching, 2017

    Combined privacy + secrecy in coded caching.

  9. S. Kamath, V. Ravindrakumar, N. Karamchandani, and V. Prabhakaran, Fundamental Limits of Secure Caching, 2015

    Parallel result to STC; establishes similar converse bounds.

  10. V. Ravindrakumar and V. Prabhakaran, Secure Multi-Antenna Coded Caching, 2018

    Combines STC with multi-antenna coded caching (Ch 5).

  11. CommIT Group, Post-Quantum Secure Coded Caching: Research Roadmap, 2024

    CommIT research on post-quantum secure coded caching for 6G MBMS. Active work.

  12. J. L. Carter and M. N. Wegman, Universal Classes of Hash Functions, 1979

    Universal hash families; basis for info-theoretic authentication (Exercise 17.15).

Further Reading

Resources for deeper study of secure coded caching.

  • Original STC paper

    Sengupta, Tandon, Clancy (2015). 'Fundamental Limits of Caching with Secure Delivery,' IEEE TIFS

    Core paper for Ch 17. Full proof of $M \geq 1$ converse and STC achievable scheme.

  • Shamir sharing

    Shamir (1979). 'How to Share a Secret,' CACM

    Classic crypto paper used in §17.3. Short and readable.

  • Combined privacy + secrecy

    Ravindrakumar et al. (2017). 'Private Coded Caching,' IEEE TIT

    Joint treatment of demand privacy and delivery secrecy. §17.4.

  • Wyner wiretap channel

    Wyner (1975). 'The Wire-Tap Channel,' BSTJ

    Foundational information-theoretic secrecy. Background for the secure delivery framework.

ExercisesCh 18 →