Private Information Retrieval from Coded Databases with Colluding Servers

DOI10.1137/16M1102562zbMath1386.68049arXiv1611.02062OpenAlexW2963413537MaRDI QIDQ4603025

Oliver Wilhelm Gnilke, David A. Karpuk, Ragnar Freij-Hollanti, Camilla Hollanti

Publication date: 14 February 2018

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.02062

zbMATH Keywords

generalized Reed-Solomon codesprivate information retrievaldistributed storage systems

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information storage and retrieval of data (68P20) Distributed systems (68M14) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

A survey on single server private information retrieval in a coding theory perspective ⋮ Private information retrieval schemes using cyclic codes ⋮ Capacity-achieving private information retrieval scheme with a smaller sub-packetization ⋮ Squares of matrix-product codes ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ A general private information retrieval scheme for MDS coded databases with colluding servers

Cites Work

• Unnamed Item
• A general private information retrieval scheme for MDS coded databases with colluding servers
• Critical Pairs for the Product Singleton Bound
• Private information retrieval
• Private Information Retrieval From MDS Coded Data in Distributed Storage Systems
• Private Information Retrieval from MDS Coded Data With Colluding Servers: Settling a Conjecture by Freij-Hollanti et al.
• The Capacity of Private Information Retrieval From Coded Databases
• The Capacity of Robust Private Information Retrieval With Colluding Databases
• On the minimum distance of cyclic codes
• PIR Schemes With Small Download Complexity and Low Storage Requirements
• An Upper Bound of Singleton Type for Componentwise Products of Linear Codes
• The Capacity of Private Information Retrieval
• Maximum distance<tex>q</tex>-nary codes

This page was built for publication: Private Information Retrieval from Coded Databases with Colluding Servers