Fiat-Shamir heuristic
Jump to navigation
Jump to search
Fiat-Shamir heuristic is a cryptographic technique that transforms interactive proof systems into non-interactive ones. Named after its inventors, Amos Fiat and Adi Shamir, this approach enables the conversion of protocols requiring multiple rounds of communication into single-round protocols using hash functions. The Fiat-Shamir heuristic is employed in cryptographic applications like zero-knowledge proofs, where interactive interactions are replaced with a cryptographic hash function. This technique enhances efficiency and scalability, making it possible to achieve the same security properties without the need for repeated communication, contributing to the optimization of secure protocols within Web3 environments.