Abstract
This paper introduces the notion of cache-tapping into information theoretic models of coded caching. In particular, the wiretap II model with two receivers equipped with fixed-size cache memories is considered. The adversary chooses a set of symbols from cache placement, delivery, or both to tap into. The legitimate parties know neither whether cache placement, delivery, or both transmissions are tapped, nor the positions of tapped symbols. Only the size of overall tapped set is known. The strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, is identified for the instance of two library files. Achievability is established using a code design which combines wiretap coding, security embedding codes, one-time pad keys, and coded caching. The study overall demonstrates that information theoretic security guarantees are possible against a powerful adversary which optimizes its attack over both phases of a cache-aided communication system.
Recommended Citation
M. Nafea and A. Yener, "The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type Ii," 2018 IEEE Information Theory Workshop, ITW 2018, article no. 8613490, Institute of Electrical and Electronics Engineers, Jul 2018.
The definitive version is available at https://doi.org/10.1109/ITW.2018.8613490
Department(s)
Electrical and Computer Engineering
International Standard Book Number (ISBN)
978-153863599-5
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
02 Jul 2018
