Performance analysis of private information retrieval scheme based on homomorphic encryption
Yacine Ichibane, Youssef Gahi, Mouhcine Guennoun, Zouhair Guennoun
Abstract
Yacine Ichibane, Youssef Gahi, Mouhcine Guennoun, Zouhair Guennoun
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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