118.pdf
eprint.iacr.org · 9,365 words · saved by 1 readers
N/A
How to Prove False Statements: Practical Attacks on Fiat-Shamir Dmitry Khovratovich∗ Ron D. Rothblum† Lev Soukhanov‡ December 11, 2025 Abstract The Fiat-Shamir (FS) transform is a prolific and powerful technique for compiling public- coin interactive protocols into non-interactive ones. Roughly speaking, the idea is to replace the random coins of the verifier with the evaluations of a complex hash function. The FS…
related reading
- Computer Scientists Figure Out How To Prove Lies | Quanta Magazinequantamagazine.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Succinct Non-Interactive Arguments (SNARGs) for NP65610.csail.mit.edu
- 286.pdfeprint.iacr.org
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Fiat–Shamir heuristic - Wikipediaen.wikipedia.org
- 370.pdfeprint.iacr.org
- 17 misconceptions about SNARKs - a16z cryptoa16zcrypto.com
- A High-Level Technical Overview of Fully Homomorphic Encryption || Math ∩ Programmingjeremykun.com
- Lecture 14: Zero knowledge proofsboazbarak.org
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Mosaic: Practical Malicious Security for Garbled Circuits on Bitcoineprint.iacr.org