New Techniques for Proving Fine-Grained Average-Case Hardness

The recent emergence of fine-grained cryptography strongly motivates developing an average-case analogue of Fine-Grained Complexity (FGC). Prior work [Goldreich-Rothblum 2018, Boix-Adserà et al. 2019, Ball et al. 2017] developed worst-case to average-case fine-grained reductions (WCtoACFG) for certa...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 774 - 785
Main Authors:	Dalirrooyfard, Mina, Lincoln, Andrea, Williams, Virginia Vassilevska
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2020
Subjects:	Average-Case Lower Bounds C# languages Computer science Fine-Grained Complexity Worst-Case to Average-Case
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!