= Fiat–Shamir heuristic
{wiki=Fiat–Shamir_heuristic}
The Fiat–Shamir heuristic is a method used in cryptography to transform interactive proof systems or protocols into non-interactive ones. It was introduced by Adi Shamir and Amos Fiat in 1986. The heuristic allows for the generation of a proof that can be verified without requiring interaction between the prover and the verifier, which is particularly useful in scenarios where interactions might be cumbersome or impractical.
Back to article page
