Fiat-Shamir in the standard model: Current state-of-the-art and future challenges

The Fiat-Shamir heuristic is an extremely simple, general approach for constructing non-interactive argument systems from public-coin interactive protocols. We survey what is known about the provable security of the Fiat-Shamir heuristic, focusing on correlation intractability and the "bad challenge" paradigm.