# Wikipedia Authors - Fiat–Shamir heuristic (Highlights) ![rw-book-cover|256](https://readwise-assets.s3.amazonaws.com/static/images/article1.be68295a7e40.png) ## Highlights - In [cryptography](https://en.wikipedia.org/wiki/Cryptography), the **Fiat–Shamir heuristic** is a technique for taking an [interactive proof of knowledge](https://en.wikipedia.org/wiki/Proof_of_knowledge) and creating a [digital signature](https://en.wikipedia.org/wiki/Digital_signature) based on it. ([View Highlight](https://read.readwise.io/read/01hr95xhjvetdqek3sap04mg7s)) ^688776974 - In the case that random oracles do not exist, the Fiat–Shamir heuristic has been proven insecure by [Shafi Goldwasser](https://en.wikipedia.org/wiki/Shafi_Goldwasser) and [Yael Tauman Kalai](https://en.wikipedia.org/wiki/Yael_Tauman_Kalai). ([View Highlight](https://read.readwise.io/read/01hr95xtmd5e7wrgfsjwn6jgrd)) ^688776981 - More generally, the Fiat–Shamir heuristic may also be viewed as converting a public-coin interactive proof of knowledge into a [non-interactive proof of knowledge](https://en.wikipedia.org/wiki/Non-interactive_zero-knowledge_proof). ([View Highlight](https://read.readwise.io/read/01hr95ynk7110xk3ppx41he7br)) ^688777003