A method of implementing non-interactive proof in zero-knowledge proof algorithm called the Fiat-Shamir Heuristic. By using a hash function to generate random numbers instead of the challenge phase in traditional interactive proof。

FOAKS (Fast Oblivious Algorithm for Knapsack based on Sort) is a common zero-knowledge proof algorithm that also uses the Fiat-Shamir Heuristic in the proof generation process. By introducing a hash function in the Breakdown section of the proof, FOAKS can achieve non-interactive proof, making it more suitable for some application scenarios that require efficiency and have high network communication costs, such as on-chain data privacy protection and zkRollup.

Reply to this note

Please Login to reply.

Discussion

No replies yet.