Single Database Private Information Retrieval with Logarithmic Communication

In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously the best result could only achieve polylogarithmic communication, and was based on certain less well-studied assumptions in number theory [CMS99]. On the contrary, our construction is based on Paillier’s cryptosystem [P99], which along with its variants have drawn extensive studies in recent cryptographic researches [PP99, G00, CGGN01, DJ01, CGG02, CNS02, ST02, GMMV03, KT03], and have many important applications (e.g., the Cramer-Shoup CCA2 encryption scheme in the standard model [CS02]). Actually, our schemes can be directly used to implement 1-out-of-N -bit string oblivious transfer with O( ) sender-side communication complexity (against semi-honest receivers and malicious senders). Note the sender-side communication complexity is independent of N, the constant hidden in the big-O notation is in fact small,...

• Type: Conference
• Year: 2004
• Where: ACISP
• Authors: Yan-Cheng Chang
• Keywords: ACISP 2004, Communication Complexity, Security Privacy, Sender-side Communication Complexity, Server-side Communication Complexity