Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 53318 (05)
- University: Sharif University of Technology
- Department: Electrical Engineering
- Advisor(s): Maddah Ali, Mohammad Ali
- Abstract:
- Zero knowledge proofs allow a person (prover) to convince another person (verifier) that he has performed a specific computation on a secret data correctly, and has obtained a true answer, without having to disclose the secret data. QAP (Quadratic Arithmetic Program) based zkSNARKs (zero knowledge Succinct Non-interactive Argument of Knowledge) are a type of zero knowledge proof. They have several properties that make them attractive in practice, e.g. verifier's work is very easy. So they are used in many areas such as Blockchain and cloud computing. But yet prover's work in QAP based zkSNARKs is heavy, therefore, it may not be possible for a prover with limited processing resource to run the prover algorithm alone. In this thesis, we propose a secure multi party algorithm to distribute the prover's work in QAP based zkSNARKs, by which a prover can partition his data into several pieces and delegate a coded version of them to several servers. In our scheme, servers are untrusted so they don't understand the secret data, and their work is a fraction of prover's total work. For example, a prover can delegate his task to 3 servers in the way that the servers don't understand the secret data, and the work of each server is less than half of the original prover's work. Based on our proposed scheme, we introduce a system for execution of smart contracts, which doesn't have some of the problems of previous systems
- Keywords:
- Secure Multiparty Computation (SMC) ; Smart Contracts ; Coding ; Secret Sharing ; Zero Knowledge Succinct Noninteractive Argument of Knowledge (zkSNARK) ; Quadratic Arithmetic Program (QAP)
Digital Object List
محتواي کتاب
Bookmark