Abstract
A wiretap model with two receivers equipped with fixed-size cache memories, and a type II adversary is considered. The adversary in this model chooses a subset of symbols to tap into either from cache placement, delivery transmission, or both phases. The legitimate parties do not know the fractions or the positions of the tapped symbols in either phase. For a library of size three files or more, lower and upper bounds on the strong secrecy capacity, i.e., the maximum achievable file rate while keeping the overall library strongly secure, are derived. The strong secrecy capacity is identified for the instance of large, tapped subsets. Achievability is established by wiretap coding, security embedding codes, one-time pad keys, and coded caching techniques. The upper bound is constructed by three successive channel transformations.
Recommended Citation
M. Nafea and A. Yener, "The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type Ii: Multiple Library Files," 2018 56th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2018, pp. 989 - 996, article no. 8635931, Institute of Electrical and Electronics Engineers, Jul 2018.
The definitive version is available at https://doi.org/10.1109/ALLERTON.2018.8635931
Department(s)
Electrical and Computer Engineering
International Standard Book Number (ISBN)
978-153866596-1
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
