Zero Knowledge Proofs and Their Future Applications
summary
Claims that secure multi-party computation and zero-knowledge proofs can compute any joint function f while keeping each party’s input secret (origins in the 1980s–90s), enabling private auctions, Tinder-style match checks, and blockchain payments beyond Zcash. Practical tools include MPC compilers that turn a defined function f into protocols, and interim tacit execution environments / TEEs (Enigma-style) to speed things up. Current reality: MPC often remains too slow for some apps but improves yearly; private ad auctions and algorithmic redistribution prototypes exist and are moving toward deployment.
AI-written summary · about
chapters (4)
related talks
33mAn Introduction to Zero Knowledge Proofs
14mWhat are zero-knowledge proofs? And why do they matter beyond crypto?
26mHow zero-knowledge proofs can be used to balance privacy and compliance
12mThe Limits of Technology in Achieving Privacy
53mProofs Without Evidence: Assurance on the Blockchain and Other Applications
23mZKBoo: Faster Zero-Knowledge for Boolean Circuits
26mPractical, Efficient ZKPs, Economic and Social Processes
48mSoK: Programmable Privacy