Abstract
Private Information Retrieval (PIR) schemes offer privacy to Internet users by protecting the contents of their queries from the servers that they use. As the problem of user data collected by various services is becoming an issue of increasing concern, the functionality offered by such schemes is gaining a lot of attention. There are various PIR methods that ensure privacy, ranging from information-theoretic secure solutions that require multiple non-colluding servers, to hardware implementations based on secure trusted components. In this paper, we focus on computational PIR (cPIR) techniques which ensure privacy while using only one server and no dedicated hardware modules. Privacy is achieved with the help of encryption that relies on mathematical problems that are computationally intractable. We present an overview of the available cPIR techniques, we identify the major challenges of implementing such schemes, and we evaluate their relative performance. We provide an in-depth analysis of the strengths and weaknesses of cPIR solutions, and present scenarios where each technique is best suited.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
