<--- 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

Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014

Lebesgue density and Π01 Classes Mushfeq Khan University of Hawai‘i at M¯anoa Algorithmic Randomness and Complexity Shonan Village Center September 12th, 2014

DocID: 1ubuP - View Document

Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri

Rademacher Complexity Margin Bounds for Learning with a Large Number of Classes Vitaly Kuznetsov Courant Institute of Mathematical Sciences, 251 Mercer street, New York, NY, 10012 Mehryar Mohri

DocID: 1t1hx - View Document

Principles of metabolism: coping with complexity Six classes of enzymes

Principles of metabolism: coping with complexity Six classes of enzymes

DocID: 1sh47 - View Document

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

DocID: 1ruap - View Document

The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1  School of Engineering and Computing Sciences, Durham University,

The complexity of positive first-order logic without equality II: The four-element case Barnaby Martin1? and Jos Martin2 1 School of Engineering and Computing Sciences, Durham University,

DocID: 1rtIQ - View Document