Loading...
Please wait, while we are loading the content...
Similar Documents
Succinct Non-Interactive Arguments from Quadratic Arithmetic Programs
| Content Provider | Semantic Scholar |
|---|---|
| Author | Pankova, Alisa |
| Copyright Year | 2013 |
| Abstract | Verifiable computation in zero knowledge allows the verifier to prove that he performed the computation of a certain functionality correctly without having to repeat the entire computational process, and without revealing any details of the computation. Any program can be represented by a circuit, and verifying the correctness of the computation is equivalent to checking circuit satisfiability on given input and output. There exist cryptographic solutions to this task, based on reduction to different mathematical problems. This survey gives an overview of verifying circuit satisfiability (Circuit-SAT) in zero knowledge using quadratic arithmetic programs (QAP). |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://courses.cs.ut.ee/MTAT.07.022/2013_fall/uploads/Main/alisa-report |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |