most citedA Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers

34 citations · 40 across the 4 of their papers we have counts for

collaborators
Showing math.NTShow all

1 paper · 1 filter

math.NT2012★ 3 cited

Discrete logarithm computations over finite fields using Reed-Solomon codes

Daniel Augot, François Morain

Cheng and Wan have related the decoding of Reed-Solomon codes to the computation of discrete logarithms over finite fields, with the aim of proving the hardness of their decoding.…