Information Security and Privacy
Lecture Notes in Computer Science, 2001, Volume 2119/2001, 206-220, DOI: 10.1007/3-540-47719-5_18

Private Information Retrieval Based on the Subgroup Membership Problem

Akihiro Yamamura and Taiichi Saito

View Related Documents

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.

Fulltext Preview

Image of the first page of the fulltext document