DeepAI AI Chat
Log In Sign Up

On the privacy of a code-based single-server computational PIR scheme

by   Sarah Bordage, et al.

We show that the single-server computational PIR protocol proposed by Holzbaur, Hollanti and Wachter-Zeh in 2020 is not private, in the sense that the server can recover in polynomial time the index of the desired file with very high probability. The attack relies on the following observation. Removing rows of the query matrix corresponding to the desired file yields a large decrease of the dimension over F_q of the vector space spanned by the rows of this punctured matrix. Such a dimension loss only shows up with negligible probability when rows unrelated to the requested file are deleted.


page 1

page 2

page 3

page 4


Computational Code-Based Single-Server Private Information Retrieval

A new computational private information retrieval (PIR) scheme based on ...

Capacity of Quantum Private Information Retrieval with Multiple Servers

We consider the capacity of quantum private information retrieval (QPIR)...

An analysis of Coggia-Couvreur attack on Loidreau's rank-metric public key encryption scheme in the general case

In this paper we show that in the case where the public-key can be disti...

Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval

Private information retrieval protocols guarantee that a user can privat...

Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval

We consider the problem of information retrieval from a dataset of files...

PIR codes from combinatorial structures

A k-server Private Information Retrieval (PIR) code is a binary linear [...

INTERPOL: Information Theoretically Verifiable Polynomial Evaluation

We study the problem of verifiable polynomial evaluation in the user-ser...