2015Unpublished venueRequires access

Performance analysis of private information retrieval scheme based on homomorphic encryption

Yacine Ichibane, Youssef Gahi, Mouhcine Guennoun, Zouhair Guennoun

Open publisher page 2 citations

Abstract

Private Information Retrieval (PIR) is the fact that a client retrieves a certain record from a remote database managed by untrusted parties without letting them know which record has actually been requested, thus preserving the privacy of the client. Ostrovsky and Skeith showed in [1] that any homomorphic encryption can actually be used to achieve PIR. In this paper we use their protocol as basis to compare five well known homomorphic encryption schemes by providing simulation results.

About this research paper

What this paper is about

Private Information Retrieval (PIR) is the fact that a client retrieves a certain record from a remote database managed by untrusted parties without letting them know which record has actually been requested, thus preserving the privacy of the client. Ostrovsky and Skeith showed in [1] that any homomorphic encryption can actually be used to achieve PIR. In this paper we use their protocol as basis to compare five well known homomorphic encryption schemes by providing simulation results.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Private Information Retrieval (PIR) is the fact that a client retrieves a certain record from a remote database managed by untrusted parties without letting them know which record has actually been requested, thus preserving the privacy of the client. Ostrovsky and Skeith showed in [1] that any homomorphic encryption can actually be used to achieve PIR. In this paper we use their protocol as basis to compare five well known homomorphic encryption schemes by providing simulation results.

Key concepts: Homomorphic encryption, Computer science, Encryption, Private information retrieval, Scheme (mathematics), Protocol (science), Computer security, Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Performance analysis of private information retrieval scheme based on homomorphic encryption — Research Paper | ScholarLens