v1v2 (latest)

New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length

25 October 2008

Papers citing "New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length"

4 / 4 papers shown

Title
More is Merrier: Relax the Non-Collusion Assumption in Multi-Server PIR Tiantian Gong Ryan Henry Alexandros Psomas Aniket Kate 28 3 0 19 Jan 2022
On the Modulus in Matching Vector Codes Lin Zhu W. Li Lingling Zhang 22 1 0 21 Jul 2021
2-Server PIR with sub-polynomial communication Zeev Dvir Sivakanth Gopi 95 88 0 24 Jul 2014
On Bringer-Chabanne EPIR Protocol for Polynomial Evaluation Yeow Meng Chee Huaxiong Wang L. Zhang 38 1 0 26 Aug 2012