Abstract

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]).

Citations

1001	Probabilistic encryption - Goldwasser, Micali - 1984
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
441	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT - Paillier - 1999
258	How to exchange secrets by oblivious transfer - Rabin - 1981
198	Founding Cryptography on Oblivious Transfer - Kilian - 1988
187	Computationally private information retrieval with polylogarithmic communication - Cachin, Micali, et al. - 1999
170	Replication is not needed: Single database, computationally-private information retrieval - Kushilevitz, Ostrovsky - 1997
114	Efficient oblivious transfer protocols - NAOR, PINKAS - 2001
113	A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system - Damg˚ard, Jurik
105	Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption - Cramer, Shoup - 2002
81	Priced oblivious transfer: How to sell digital goods - Aiello, Ishai, et al.
64	Secure multi-party computation - Goldreich - 1998
44	Single database private information retrieval implies oblivious transfer - Crescenzo, Malkin, et al. - 2000
27	Paillier’s cryptosystem revisited - Catalano, Gennaro, et al. - 2001
25	One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval - Kushilevitz, Ostrovsky - 2000
24	E cient oblivious transfer protocols - Naor, Pinkas - 2001
15	Elliptic Curve Paillier Schemes - Galbraith - 2002
11	Efficient public-key cryptosystems provably secure against active adversaries - Paillier, Pointcheval - 1999
8	Private information retrieval - an overview and current trends - Asonov - 2001
7	The hardness of Hensel lifting: The case of RSA and discrete logarithm - Catalano, Nguyen, et al. - 2002
7	New semantically secure public-key cryptosystems from the RSA primitive - Sakurai, Takagi - 2002
5	Paillier’s trapdoor function hides up to O(n) bits - Catalano, Gennaro, et al.
5	One-way trapdoor permutations are su cient for non-trivial single-server private information retrieval - Kushilevitz, Ostrovsky - 2000
5	Some RSA-Based Encryption Schemes with Tight Security Reduction - Kurosawa, Takagi - 2003
4	A practical public key cryptosystem from Paillier and Rabin schemes - Galindo, Martin, et al. - 2003
4	D.: Deficient Public-Key Cryptosystems Provably Secure Against Active Adversaries - Paillier, Pointcheval - 1999
4	Oblivious transfer and polynomial evaluation. STOC - Naor, Pinkas - 1999
2	Oblivious transfer and Polynomial Evaluation(extended abstract - Naor, Pinkas
2	Extending oblivious transfers efficiently,” CRYPTO - Ishai, Kilian, et al. - 2003
1	Extending oblivious transfers e#ciently," CRYPTO - Ishai, Kilian, et al. - 2003
1	Short proofs of knowledge for factoring," Public Key Cryptography 2000 - Poupard, Stern
1	Short proofs of knowledge for factoring,” Public Key Cryptography 2000 - Poupard, Stern