Constructions for efficient Private Information Retrieval protocols

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.
Type de document :
Communication dans un congrès
WCC 2017 - The Tenth International Workshop on Coding and Cryptography, Sep 2017, Saint-Petersbourg, Russia. pp.1-12, 2017
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01633469
Contributeur : Julien Lavauzelle <>
Soumis le : lundi 13 novembre 2017 - 09:37:20
Dernière modification le : mercredi 15 novembre 2017 - 01:12:21

Fichier

pir-camera-ready.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01633469, version 1

Citation

Julien Lavauzelle. Constructions for efficient Private Information Retrieval protocols. WCC 2017 - The Tenth International Workshop on Coding and Cryptography, Sep 2017, Saint-Petersbourg, Russia. pp.1-12, 2017. 〈hal-01633469〉

Partager

Métriques

Consultations de la notice

18

Téléchargements de fichiers

4