Cover Image

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Adversarial Servers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Miki, Atsushi, Matsushima, Toshiyasu
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Necessary and Sufficient Conditions for Capacity-Achieving Private Information Retrieval with Non-Colluding and Colluding Servers
by: Miki, Atsushi, et al.
Published: (2024)

The Capacity of Semantic Private Information Retrieval with Colluding Servers
by: Nomeir, Mohamed, et al.
Published: (2025)

On Single Server Private Information Retrieval with Private Coded Side Information
by: Lu, Yuxiang, et al.
Published: (2022)

Single-Server Pliable Private Information Retrieval with Identifiable Side Information
by: Rayer, Megha, et al.
Published: (2024)

Weakly Private Information Retrieval from Heterogeneously Trusted Servers
by: Zhao, Wenyuan, et al.
Published: (2024)

Single Server Private Information Retrieval Protocols With Codes Over Rings
by: Bodur, Şeyma, et al.
Published: (2023)

Private Information Retrieval from Locally Repairable Databases with Colluding Servers
by: Martínez-Peñas, Umberto
Published: (2019)

A New Approach to Harnessing Side Information in Multi-Server Private Information Retrieval
by: Wang, Ningze, et al.
Published: (2024)

Robust, Secure and Private Cache-aided Scalar Linear Function Retrieval from Distributed System with Blind and Adversarial Servers
by: Yan, Qifa, et al.
Published: (2023)

Quantum $X$-Secure $T$-Private Information Retrieval From MDS Coded Storage With Unresponsive and Byzantine Servers
by: Lu, Yuxiang, et al.
Published: (2023)

Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes
by: Erhili, Leila, et al.
Published: (2024)

Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems
by: Hayashi, Masahito, et al.
Published: (2022)

Code-Based Single-Server Private Information Retrieval: Circumventing the Sub-Query Attack
by: Verma, Neehar, et al.
Published: (2024)

Optimizing Leaky Private Information Retrieval Codes to Achieve ${O}(\log K)$ Leakage Ratio Exponent
by: Zhao, Wenyuan, et al.
Published: (2025)

Private Information Retrieval with Private Noisy Side Information
by: ZivariFard, Hassan, et al.
Published: (2023)

On the Leaky Private Information Retrieval with Side Information
by: Huangfu, Yingying, et al.
Published: (2026)

Double Blind $T$-Private Information Retrieval
by: Lu, Yuxiang, et al.
Published: (2020)

Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity
by: Zieder, Ian, et al.
Published: (2024)

The Asymptotic Capacity of Byzantine Symmetric Private Information Retrieval and Its Consequences
by: Nomeir, Mohamed, et al.
Published: (2025)

The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions
by: Nakiboğlu, Barış, et al.
Published: (2023)

A Linear Programming Approach to Private Information Retrieval
by: Heidarzadeh, Anoosheh, et al.
Published: (2025)

Correction to "Private Information Retrieval Over Gaussian MAC"
by: Elimelech, Or, et al.
Published: (2024)

Capacity-Achieving Codes for Noisy Insertion Channels
by: Liu, Hengfeng, et al.
Published: (2025)

CB-cPIR: Code-Based Computational Private Information Retrieval
by: Hollanti, Camilla, et al.
Published: (2025)

On the Computability of Finding Capacity-Achieving Codes
by: Gkekas, Angelos, et al.
Published: (2025)

A General Coding Framework for Adaptive Private Information Retrieval
by: Zhu, Jinbao, et al.
Published: (2025)

Sun-Jafar-Type Schemes for Weak Private Information Retrieval
by: Anand, Chandan, et al.
Published: (2025)

Capacity-Achieving Codes with Inverse-Ackermann-Depth Encoders
by: Li, Yuan
Published: (2025)

A Low-Complexity Scheme for Multi-Message Private Information Retrieval
by: Wang, Ningze, et al.
Published: (2025)

Algebraic Geometry Codes for Cross-Subspace Alignment in Private Information Retrieval
by: Makkonen, Okko, et al.
Published: (2024)

Multishot Capacity of Networks with Restricted Adversaries
by: Cotardo, Giuseppe, et al.
Published: (2025)

Private Structured-Subset Retrieval
by: Issa, Maha, et al.
Published: (2026)

Private Contiguous-Block Retrieval
by: Issa, Maha, et al.
Published: (2026)

Some Necessary and Sufficient Conditions for Diophantine Graphs
by: Seoud, M. A., et al.
Published: (2024)

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
by: Mosheiff, Jonathan, et al.
Published: (2024)

Achieving Gaussian Vector Broadcast Channel Capacity with Scalar Lattices
by: Şener, M. Yusuf, et al.
Published: (2024)

Geno-Weaving: Low-Complexity Capacity-Achieving DNA Storage
by: Wang, Hsin-Po, et al.
Published: (2024)

Private Information Retrieval over Graphs
by: Ge, Gennian, et al.
Published: (2025)

Differentially Private Secure Multiplication with Erasures and Adversaries
by: Hu, Haoyang, et al.
Published: (2025)