Caching content at the edge network is a popular and effective technique widely deployed to alleviate the burden of network backhaul, shorten service delay, and improve service quality …
We consider private information retrieval (PIR) of a single file out of K files from N non- colluding databases with heterogeneous storage constraints m=(m 1,⋯, m N). The aim of this …
We study the problem of private set intersection (PSI). In this problem, there are two entities, for, each storing a set, whose elements are picked from a finite set, on replicated and non …
We investigate the problem of multi-party private set intersection (MP-PSI). In MP-PSI, there are M parties, each storing a data set P i over N i replicated and non-colluding databases …
We investigate the problem of semantic private information retrieval (semantic PIR). In semantic PIR, a user retrieves a message out of independent messages stored in replicated …
We consider the private information retrieval (PIR) problem from decentralized uncoded caching databases. There are two phases in our problem setting, a caching phase, and a …
K Banawan, S Ulukus - 2019 IEEE International Symposium on …, 2019 - ieeexplore.ieee.org
We consider the problem of private information retrieval (PIR) of a single message out of K messages from N non-colluding and non-replicated databases. Different from the majority of …
X Yao, N Liu, W Kang - IEEE Transactions on Information …, 2021 - ieeexplore.ieee.org
We study the private information retrieval (PIR) problem under arbitrary collusion patterns for replicated databases. We find a general characterization of the PIR capacity, which is the …
Z Wang, S Ulukus - IEEE Journal on Selected Areas in …, 2022 - ieeexplore.ieee.org
We consider the problem of symmetric private information retrieval (SPIR) with user-side common randomness. In SPIR, a user retrieves a message out of messages from non …