A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers

DOI10.1007/978-3-319-12280-9_15zbMath1436.94034arXiv1412.5012OpenAlexW2161788512MaRDI QIDQ5498730

Abdullatif Shikfa, Françoise Levy-dit-Vehel, Daniel Augot

Publication date: 10 February 2015

Published in: Cryptology and Network Security (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60) Information storage and retrieval of data (68P20) Privacy of data (68P27)

Related Items (3)

Fast systematic encoding of multiplicity codes ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two ⋮ A general private information retrieval scheme for MDS coded databases with colluding servers

This page was built for publication: A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers