210 citations · 238 across the 24 of their papers we have counts for
5 papers · 2 filters
2-Server PIR with sub-polynomial communication
Zeev Dvir, Sivakanth Gopi
A 2-server Private Information Retrieval (PIR) scheme allows a user to retrieve the th bit of an -bit database replicated among two servers (which do not communicate) while n…
Factors of Sparse Polynomials are Sparse
Zeev Dvir, Rafael Mendes de Oliveira
This paper was removed due to an error in the proof (Claim 4.12 as stated is not true). The authors would like to thank Ilya Volkovich for pointing out a counterexample to this pap…
Lower Bounds for Approximate LDC
Jop Briët, Zeev Dvir, Guangda Hu +1
We study an approximate version of -query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A -query -a…
Testing Equivalence of Polynomials under Shifts
Zeev Dvir, Rafael Oliveira, Amir Shpilka
Two polynomials are called shift-equivalent if there exists a vector such that the polynomial identity…
Affine extractors over large fields with exponential error
Jean Bourgain, Zeev Dvir, Ethan Leeman
We describe a construction of explicit affine extractors over large finite fields with exponentially small error and linear output length. Our construction relies on a deep theorem…