TY - GEN
T1 - The caching broadcast channel with a wire and cache tapping adversary of type II
AU - Nafea, Mohamed
AU - Yener, Aylin
N1 - Publisher Copyright:
© 2018 IEEE Information Theory Workshop, ITW 2018. All rights reserved.
PY - 2018/7/2
Y1 - 2018/7/2
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85062060477&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85062060477&partnerID=8YFLogxK
U2 - 10.1109/ITW.2018.8613490
DO - 10.1109/ITW.2018.8613490
M3 - Conference contribution
AN - SCOPUS:85062060477
T3 - 2018 IEEE Information Theory Workshop, ITW 2018
BT - 2018 IEEE Information Theory Workshop, ITW 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Information Theory Workshop, ITW 2018
Y2 - 25 November 2018 through 29 November 2018
ER -