Skip to Main content Skip to Navigation
Conference papers

Constructions for efficient Private Information Retrieval protocols

Julien Lavauzelle 1, 2, 3
Abstract : Private Information Retrieval (PIR) protocols aim at ensuring a user that he can retrieve some part Di of a distributed database D without revealing the index i to the server(s). Most of known PIR protocols focus on decreasing the communication complexity between the client and the server(s). Recently, the use of PIR codes by Fazeli et. al. also lead to a huge reduction of the storage overhead supported by the servers. However, only a few works address the issue of the computational complexity of the servers. In this paper, we show that transversal designs and their generalizations provide PIR schemes achieving simultaneously reasonable communication complexity, low storage overhead, optimal computational complexity for the servers, and resistance to a collusion of some of them.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Julien Lavauzelle <>
Submitted on : Monday, November 13, 2017 - 9:37:20 AM
Last modification on : Friday, April 30, 2021 - 10:03:53 AM
Long-term archiving on: : Wednesday, February 14, 2018 - 12:40:24 PM


Files produced by the author(s)


  • HAL Id : hal-01633469, version 1



Julien Lavauzelle. Constructions for efficient Private Information Retrieval protocols. WCC 2017 - The Tenth International Workshop on Coding and Cryptography, INRIA; SUAI; Skoltech, Sep 2017, Saint-Petersbourg, Russia. pp.1-12. ⟨hal-01633469⟩



Record views


Files downloads