2019 · 42 citations · 28 references
ComputingComputer ScienceCryptographyGame TheoryCryptographic HashingCryptographic ProtocolsHash FunctionsInteractive Proof SystemsNash EquilibriumNoncooperative Game TheoryHash-based Cryptographic ProtocolsHash-based CryptographyNash Equilibrium ComputationNash Equilibrium ProblemsPublic-coin ProtocolsSecurity Proofs
The Fiat-Shamir heuristic transforms a public-coin interactive proof into a non-interactive argument, by replacing the verifier with a cryptographic hash function that is applied to the protocol’s transcript. Constructing hash functions for which this transformation is sound is a central and long-standing open question in cryptography.
28