A tight lower bound for restricted pir protocols

Page 1

	Year	Citations
Private information retrieval Benny Chor, Eyal Kushilevitz, Oded Goldreich, Journal of the ACM EngineeringInformation SecurityInformation PrivacyPublicly Accessible DatabasesInformation Retrieval	1998	1.6K
Replication is not needed: single database, computationally-private information retrieval Eyal Kushilevitz, Rafail Ostrovsky Quadratic Residuosity AssumptionEngineeringInformation SecurityComputational ComplexityCommunication Complexity	2002	920
Computationally private information retrieval (extended abstract) Benny Chor, Niv Gilboa	1997	243
Breaking the O(n/sup 1/(2k-1)/) barrier for information-theoretic Private Information Retrieval Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Privacy ProtectionCryptographic PrimitiveEngineeringPir ProtocolsInformation Security	2003	226
A Survey on Private Information Retrieval William Gasarch	2004	209
Exponential lower bound for 2-query locally decodable codes via a quantum argument Iordanis Kerenidis, Ronald de Wolf EngineeringQ Classical QueriesQuantum ComputingPost-quantum CryptographyExponential Lower Bound	2003	204
A Survey on Private Information Retrieval (Column: Computational Complexity). William Gasarch Bulletin of the European Association for Theoretical Computer Science	2004	67
Upper bound on the communication complexity of private information retrieval. Andris Ambainis IACR Cryptology ePrint Archive	1996	64

Page 1