| Table of Contents | 第1-6页 |
| Abstract | 第6-7页 |
| Acknowledgements | 第7-8页 |
| Introduction to MPC and VSS Problems | 第8-16页 |
| ·Multi-Party Computation (MPC) | 第8页 |
| ·The Definition of Verifiable Secret Sharing | 第8-16页 |
| ·Adversaries and their Powers | 第9-10页 |
| ·A scenario of secret sharing (SS) | 第10-11页 |
| ·Shamir's Algorithm | 第11-14页 |
| ·Analysis of Shamir's Scheme | 第14页 |
| ·Definition of Verifiable Secret Sharing [Cra00] | 第14-16页 |
| 1 Security of MPC | 第16-24页 |
| ·Universally Composable Security | 第18-22页 |
| ·G-hybrid model | 第22-24页 |
| 3 General Secure MPC Protocol | 第24-30页 |
| ·MPC for Threshold Adversaries | 第24页 |
| ·Players and General Adversaries | 第24-26页 |
| ·Linear Secret Sharing Scheme (LSSS) and Multiplicative Monotone Span Programs (MSP) | 第26-30页 |
| 4 Distribution Course of SS Scheme | 第30-40页 |
| ·MPC Protocols | 第30-31页 |
| ·Security of The passive case | 第31-37页 |
| ·Complexity and security on a SS protocol | 第37-40页 |
| 5 Robustness for Free with One-way Functions in Secure Computations | 第40-54页 |
| ·The model | 第40-42页 |
| ·Preparation course | 第42-50页 |
| ·Preliminary | 第42-43页 |
| ·Generation of t-sharing triple (a,b,c) | 第43-45页 |
| ·Verification of shares | 第45-47页 |
| ·Verification of multiplication sharing | 第47-49页 |
| ·Error probability and repeating verification | 第49-50页 |
| ·Computation Course | 第50-52页 |
| ·Input sharing | 第50-52页 |
| ·Circuit computation and output reconstruction | 第52页 |
| ·Conclusions | 第52-54页 |
| Bibliography | 第54-57页 |
