Results 21 to 30 of about 251,490 (326)
Quantum symmetrically-private information retrieval [PDF]
Information Processing Letters, 2004 Private information retrieval systems (PIRs) allow a user to extract an item from a database that is replicated over k>=1 servers, while satisfying various privacy constraints. We exhibit quantum k-server symmetrically-private information retrieval systems (QSPIRs) that use sublinear communication, do not use shared randomness among the servers, and
Kerenidis, Iordanis, De Wolf, Ronald
openaire +3 more sources
Multi-User PIR with Cyclic Wraparound Multi-Access Caches
Entropy, 2023 We consider the problem of multi-access cache-aided multi-user Private Information Retrieval (MACAMuPIR) with cyclic wraparound cache access. In MACAMuPIR, several files are replicated across multiple servers.
Kanishak Vaidya, Balaji Sundar Rajan
doaj +1 more source
Robust private information retrieval for low encoding/decoding complexity distributed storage
IET Information Security, 2023 Private information retrieval (PIR) means a user retrieves a file while revealing no information on which file is being retrieved. In classic PIR, the user needs to wait for the responses of all the storage nodes.
Mingjun Dai +4 more
doaj +1 more source
Multiround private information retrieval: Capacity and storage overhead [PDF]
, 2018 Private information retrieval (PIR) is the problem of retrieving one message out of $K$ messages from $N$ non-communicating replicated databases, where each database stores all $K$ messages, in such a way that each database learns no information about ...
Jafar, SA, Sun, H
core +1 more source
Double Blind T-Private Information Retrieval [PDF]
IEEE Journal on Selected Areas in Information Theory, 2021 Double blind $T$-private information retrieval (DB-TPIR) enables two users, each of whom specifies an index ($θ_1, θ_2$, resp.), to efficiently retrieve a message $W(θ_1,θ_2)$ labeled by the two indices, from a set of $N$ servers that store all messages $W(k_1,k_2), k_1\in\{1,2,\cdots,K_1\}, k_2\in\{1,2,\cdots,K_2\}$, such that the two users' indices ...
Lu, Yuxiang, Jia, Zhuqing, Jafar, Syed A
openaire +4 more sources
Information-theoretic privacy in federated submodel learning
ICT Express, 2023 We consider information-theoretic privacy in federated submodel learning, where a global server has multiple submodels. Compared to the privacy considered in the conventional federated submodel learning where secure aggregation is adopted for ensuring ...
Minchul Kim, Jungwoo Lee
doaj +1 more source
Towards Efficient Information-Theoretic Function Secret Sharing
IEEE Access, 2020 A (t, r)-function secret sharing ((t, r)-FSS) scheme allows a dealer to secret-share a functionf among r parties as r secret keys k1, ... , kr such that for any input x the parties can compute r output shares that allow the reconstruction of f (x) but ...
Wen Ming Li, Liang Feng Zhang
doaj +1 more source
The capacity of symmetric Private information retrieval [PDF]
, 2016 Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of K messages from N non-communicating replicated databases (each holds all K messages) while keeping the identity of the desired message index a secret ...
Jafar, SA, Sun, H
core +2 more sources
Avoiding Occupancy Detection From Smart Meter Using Adversarial Machine Learning
IEEE Access, 2021 More and more conventional electromechanical meters are being replaced with smart meters because of their substantial benefits such as providing faster bi-directional communication between utility services and end users, enabling direct load control for ...
Ibrahim Yilmaz, Ambareen Siraj
doaj +1 more source
Complexity, 2021 Web search engines usually keep users’ profiles for multiple purposes, such as result ranking and relevancy, market research, and targeted advertisements. However, user web search history may contain sensitive and private information about the user, such
Rafiullah Khan +4 more
doaj +1 more source