How to use Bitcoin to Enhance Secure Computation
summary
Uses Bitcoin claim-or-refund transaction primitives and timelocks to enforce a monetary penalty model that compensates honest parties when others abort, turning unfair MPC into fair outcomes. Builds a concrete ladder protocol of escalating deposits (Q, 2Q, …) so aborted reconstructions trigger payments; uses garbled circuits and SNARK-style proofs for verification. Shows compilation of verifiable computation into a fair service with validation done by simple hash checks so validation complexity independent of function in several constructions.
AI-written summary · about
chapters (14)
- 0:00Intro
- 3:23Penalty Model
- 5:48Claim-or-Refund Functionality
- 8:03Efficiency Metrics
- 11:43Talk Outline
- 13:52Secure Computation with Penalties • Honest parties submit
- 16:59Strategy Reduce fair secure computation to fair reconstruction
- 18:37"Ladder" Protocol BK14a
- 21:17Resource Fairness Verifiable Computation
- 22:59Resource Fairness Private Simultaneous Messages
- 25:02Secure Protocol Completion with Penalties
- 26:30Cash Distribution
- 28:19Efficient Secure Computation
- 28:30Summary • Applications
related talks
56mHaskelling Bitcoin for Great Good
40mSilent Payments and Alternatives to Bitcoin Privacy
51mEconomic Security of Distributed Systems
25mEgalitarian Computing
01h 11mDemystifying Bitcoin
32mSoK: Private Programmability on Blockchain Systems
52mBinding Blockchains Together with Accountability
19mThe Zero Trust Bitcoin Platform