<--- Back to Details
First PageDocument Content
Cryptography / Computational complexity theory / Complexity classes / Cryptographic protocols / Non-interactive zero-knowledge proof / Interactive proof system / Proof of knowledge / Zero-knowledge proof / NP / Zero knowledge / IP / Soundness
Date: 2018-10-25 10:32:39
Cryptography
Computational complexity theory
Complexity classes
Cryptographic protocols
Non-interactive zero-knowledge proof
Interactive proof system
Proof of knowledge
Zero-knowledge proof
NP
Zero knowledge
IP
Soundness

ZKProof Standards Security Track Proceedings 1 August 2018 + subsequent revisions This document is an ongoing work in progress. Feedback and contributions are encouraged. Track chairs:​​

Add to Reading List

Source URL: zkproof.org

Download Document from Source Website

File Size: 333,35 KB

Share Document on Facebook

Similar Documents

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

DocID: 1xUdf - View Document

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

DocID: 1xTKi - View Document

PDF Document

DocID: 1xSVG - View Document

PDF Document

DocID: 1xSM6 - View Document

PDF Document

DocID: 1xSJs - View Document