Private Information Retrieval Based on the Subgroup Membership Problem

Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply the subgroup membership problem to private information retrieval schemes following the method by Kushilevitz and Ostrovsky. The resulting scheme has the same communication complexity as that of Kushilevitz and Ostrovsky. 1 Private Information Retrieval Chor, Goldreich, Kushilevitz and Sudan [3] introduced the private information retrieval scheme for remote database access, in which the user can retrieve the data of user’s choice without revealing it. Their scheme attains information theoretic security, however, the database must be replicated in several locations where the managers are not allowed to communicate each other. The computational private information retrieval scheme was introduced by Chor and Gilboa [4]. Their scheme attains more efficient communication than Chor, Goldreich, Kushilevitz and Sud...

• Type: Conference
• Year: 2001
• Where: ACISP
• Authors: Akihiro Yamamura, Taiichi Saito
• Keywords: ACISP 2001, Private Information Retrieval Scheme, Private Information Retrievals, Security Privacy, Subgroup Membership Problem