A survey on single server private information retrieval in a coding theory perspective
From MaRDI portal
Publication:6157852
DOI10.1007/s00200-021-00508-5arXiv2008.06417OpenAlexW3156656627MaRDI QIDQ6157852
Karan Khathuria, Gianira N. Alfarano, Violetta Weger
Publication date: 12 May 2023
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.06417
Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99)
Cites Work
- Unnamed Item
- Unnamed Item
- On the privacy of a code-based single-server computational PIR scheme
- 2-Server PIR with Sub-Polynomial Communication
- Minkowski's Convex Body Theorem and Integer Programming
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- The Capacity of Private Information Retrieval From Coded Databases
- The Capacity of Robust Private Information Retrieval With Colluding Databases
- Private Information Retrieval from Coded Databases with Colluding Servers
- The Capacity of Symmetric Private Information Retrieval
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- A Simpler Rate-Optimal CPIR Protocol
This page was built for publication: A survey on single server private information retrieval in a coding theory perspective