Get the latest tech news
How to prove false statements? (Part 1)
Trigger warning: incredibly wonky theoretical cryptography post (written by a non-theorist)! Also, this will be in two parts. I plan to be back with some more thoughts on practical stuff, like clou…
Along those lines, my interest was recently piqued by a new theoretical result by Khovratovich, Rothblum and Soukhanov entitled “ How to Prove False Statements: Practical Attacks on Fiat-Shamir.” This is a doozy of a paper! For example, people at Google are now starting to deploy complex multi-party computation and others are launching zero-knowledge protocols that are actually capable of running (or proving things about the execution of) arbitrary programs in a cryptographic way. (Just to illustrate this, there used to be an entire competition called the “ Underhanded C Contest ” where people would compete to write C programs full of malicious code that was hard to catch.
Or read this on Hacker News