Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

USENIX Security Symposium

Communication-Computation Trade-offs in PIR.

Asra Ali, Tancrède Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, Kevin Yeo

Published Jan 1, 2019• 49 citations
OpenAlex

Related papers

Sun-Jafar-Type Schemes for Weak Private Information Retrieval

Chandan Anand, Jayesh Seshadri, Prasad Krishnan +1 more

In information-theoretic private information retrieval (PIR), a client wants to retrieve one desired file out of$M$files, stored across$N$servers, while keeping the index of the desired file private from each$T$-sized subset of servers. A PIR protocol must ideally maximize the rate, which is the ratio of the file size to the total quantum of the download from the servers, while ensuring such privacy. In Weak-PIR (WPIR), the criterion of perfect information-theoretic privacy is relaxed. This enables higher rates to be achieved, while some information about the desired file index leaks to the servers. This leakage is captured by various known privacy metrics. By leveraging the well-established capacity-achieving schemes of Sun and Jafar under non-colluding ($T=1$) and colluding ($1<T \leq N$) scenarios, we present WPIR protocols for these scenarios. We also present a new WPIR scheme for the MDS scenario, by building upon the scheme by Banawan and Ulukus for this scenario. We present corresponding explicit rate-privacy trade-offs for these setups, under the mutual-information and the maximal leakage privacy metrics. In the collusion-free setup, our presented rateprivacy trade-off under maximal leakage matches that of the previous state of the art. With respect to the MDS scenario under the maximal leakage metric, we compare with the non-explicit trade-off in the literature, and show that our scheme performs better for some numerical examples. For the$T$-collusion setup (under both privacy metrics) and for the MDS setup under the mutual information metric, our rate-privacy trade-offs are the first in the literature, to the best of our knowledge.

arXiv:2501.11505•IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•1 citation

On the Security of Doubly Efficient PIR.

Elette Boyle, Justin Holmgren, Fermi Ma +1 more

•Jan 1, 2021•1 citation

Energy-Secrecy Trade-offs for Wireless Communication

Ruolin Zhang

This chapter investigates the secrecy-energy trade-offs for communication in wireless networks. It is shown that privacy requirements for applications such as image or video transmissions do not require perfect secrecy, and the level of privacy can be quantified using a Rate-Distortion metric. Using information theoretic analysis, the chapter formulates analytic secrecy trade-offs for various communication channel models. In particular we analyze the advantage of partial secrecy for the Gaussian and Rayleigh fading channel models and the MIMO channel. The impact of secrecy requirements and the inherent secrecy-energy-connectivity trade-offs are also analyzed for networks of wireless nodes.

InTech eBooks•Jul 19, 2017•1 citation

a Physics of Computation.

Wakefield Scott Stornetta

•Jan 1, 1989•0 citations

On No Communication Theorems

Omer Dickstein

•Dec 1, 2014•0 citations

Noise-aware quantum federated learning for NISQ IoT edge computing: Trainability, communication–accuracy trade-offs, and noise-reliability-weighted aggregation

Sungkwan Youm

Future Generation Computer Systems•Oct 25, 2026•0 citations
In information-theoretic private information retrieval (PIR), a client wants to retrieve one desired file out ofMMMfiles, stored acrossNNNservers, while keeping the index of the desired file private from eachTTT-sized subset of servers. A PIR protocol must ideally maximize the rate, which is the ratio of the file size to the total quantum of the download from the servers, while ensuring such privacy. In Weak-PIR (WPIR), the criterion of perfect information-theoretic privacy is relaxed. This enables higher rates to be achieved, while some information about the desired file index leaks to the servers. This leakage is captured by various known privacy metrics. By leveraging the well-established capacity-achieving schemes of Sun and Jafar under non-colluding (T=1T=1T=1) and colluding (1<T≤N1<T \leq N1<T≤N) scenarios, we present WPIR protocols for these scenarios. We also present a new WPIR scheme for the MDS scenario, by building upon the scheme by Banawan and Ulukus for this scenario. We present corresponding explicit rate-privacy trade-offs for these setups, under the mutual-information and the maximal leakage privacy metrics. In the collusion-free setup, our presented rateprivacy trade-off under maximal leakage matches that of the previous state of the art. With respect to the MDS scenario under the maximal leakage metric, we compare with the non-explicit trade-off in the literature, and show that our scheme performs better for some numerical examples. For theTTT-collusion setup (under both privacy metrics) and for the MDS setup under the mutual information metric, our rate-privacy trade-offs are the first in the literature, to the best of our knowledge.
This chapter investigates the secrecy-energy trade-offs for communication in wireless networks. It is shown that privacy requirements for applications such as image or video transmissions do not require perfect secrecy, and the level of privacy can be quantified using a Rate-Distortion metric. Using information theoretic analysis, the chapter formulates analytic secrecy trade-offs for various communication channel models. In particular we analyze the advantage of partial secrecy for the Gaussian and Rayleigh fading channel models and the MIMO channel. The impact of secrecy requirements and the inherent secrecy-energy-connectivity trade-offs are also analyzed for networks of wireless nodes.