Notes on SMPC, based on "An Introduction to Secret-Sharing-Based Secure Multiparty Computation" by D. Escudero. These are simply notes and not original content. Since this is based off of Daniel's book, I do not dive deep into each topic, instead I provide my own general introductory notes and leave it at that.
- The Theory of Multiparty Computation 1.1 A General Introduction to MPC 1.1.1 Adversaries and their Power 22.214.171.124 Possible Corrupted Sets 126.96.36.199 Type of Corruption 1.1.2 Privacy Guarantees 1.1.3 Output Guarantees 1.1.4 Different Functions to be Computed 188.8.131.52 Public-Output vs Private-Output 184.108.40.206 Reactive vs Non-Reactive Functionalities 220.127.116.11 General vs Special-Purpose MPC 1.1.5 Efficiency Metrics 1.2 Simulation-Based Security 1.2.1 High-Level Idea 1.2.2 Interactive Agents 18.104.22.168 Relevant Interactive Agents in the UC Framework 1.2.3 Interactive Systems 22.214.171.124 Relevant Interactive Systems in the UC Framework 126.96.36.199 Parameterized Interactive Systems 1.2.4 Security Definition 188.8.131.52 Perfect Security 184.108.40.206 Statistical Security 220.127.116.11 Computational Security 1.2.5 The Composition Theorem 1.2.6 Some Basic Functionalities 18.104.22.168 Underlying Communication Resource 22.214.171.124 Arithmetic Black Box Model 1.3 Fundamental Results 1.3.1 Results for tn 1.3.2 Results for tn 126.96.36.199 The Case of a Passive Adversary 188.8.131.52 The Case of an Active Adversary 1.3.3 Positive Results for tn< 1.3.4 Summary of Main Results
- Secret-Sharing-Based MPC 2.1 Linear Secret-Sharing Schemes 2.2 MPC based on Linear Secret-Sharing Schemes 2.2.1 The Case of an Active Adversary
- Discussions on Honest Majority
- Discussions on Dishonest Majority
- 2.2.2 Offline-Online Paradigm