SoK: Private Programmability on Blockchain Systems
summary
Claim: zero-knowledge schemes verify a computation but do not perform live execution, so private interactive apps need a three-phase model: independent ZK inputs, mediated aggregation via MPC/FHE/TEEs/third parties, and global on-chain verification/state update. Paper compares concrete designs: ZsaSwap (off-chain solver on Zcash), Renegade F (2PC matching + collaborative SNARK), Secret Network TEEs, and Penumbra (threshold homomorphic encryption). Key trade-off is security versus expressivity; anonymity degrades with small batches. Proposes a DSL compiling to the right crypto engine.
AI-written summary · about
chapters (12)
- 0:00Programmable privacy intro
- 1:05Motivation and paper overview
- 2:08Programmability stack
- 8:53Private state for apps
- 10:22MTCS and auctions
- 15:28Three-phase computation model
- 18:39Privacy protocols categorized
- 20:23Protocol analysis examples
- 25:10Security vs expressivity trade-offs
- 27:19Future research directions
- 28:43Optimal protocol dream
- 31:11Q&A
related talks
01h 00mThe Path to Shielded Programmability
30mPractical Zero Knowledge Proofs
51mPanel: Zero Knowledge in the Enterprise
51mWhy you shouldn't trust me
35mEfficient Zero Knowledge Protocols: The Modular Approach
01h 26mPanel Discussion: The Challenges and Best Practices of Deploying Zero-Knowledge Proofs
44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacy
22mHow Zero Knowledge Proofs Change the Narrative Around Privacy