Single server private information retrieval protocols with codes over rings

DOI10.1142/S0219498825410129MaRDI QIDQ6876069zbMATH OpenFDO

Authors Şeyma Bodur, E. Martínez-Moro, Diego Ruano

Publication date 13 January 2026

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219498825410129

zbMATH Keywords

codes over ringsprivate information retrievalsingle server

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data encryption (aspects in computer science) (68P25) Information theory (general) (94A15) Linear codes (general theory) (94B05)

Cites work

• 2-server PIR with sub-polynomial communication
• A simpler rate-optimal CPIR protocol
• A survey on single server private information retrieval in a coding theory perspective
• Codes over affine algebras with a finite commutative chain coefficient ring
• Compressible FHE with applications to PIR
• Do non-free LCD codes over finite commutative Frobenius rings exist?
• Matrix-product codes over \(\mathbb{F}_q\)
• Matrix-product codes over finite chain rings
• On the privacy of a code-based single-server computational PIR scheme
• On the structure of linear and cyclic codes over a finite chain ring
• Private information retrieval
• Private information retrieval from coded databases with colluding servers
• The Capacity of Private Information Retrieval From Coded Databases
• The Capacity of Robust Private Information Retrieval With Colluding Databases
• The Capacity of Symmetric Private Information Retrieval

This page was built for publication: Single server private information retrieval protocols with codes over rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876069)