Average-Case Fine-Grained Hardness

@article{Ball2017AverageCaseFH,
  title={Average-Case Fine-Grained Hardness},
  author={Marshall Ball and Alon Rosen and Manuel Sabin and Prashant Nalini Vasudevan},
  journal={IACR Cryptology ePrint Archive},
  year={2017},
  volume={2017},
  pages={202}
}
We present functions that can be computed in some fixed polynomial time but are hard on average for any algorithm that runs in slightly smaller time, assuming widely-conjectured worst-case hardness for problems from the study of fine-grained complexity. Unconditional constructions of such functions are known from before (Goldmann et al., IPL ’94), but these have been canonical functions that have not found further use, while our functions are closely related to well-studied problems and have… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
14 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Similar Papers

Loading similar papers…