Back to Results
First PageMeta Content
Cryptography / Computational complexity theory / Complexity classes / Interactive proof system / Zero-knowledge proof / NP / Probabilistically checkable proof / IP / Soundness / Commitment scheme / NEXPTIME / P versus NP problem


The Complexity of Zero Knowledge Salil Vadhan∗ School of Engineering and Applied Sciences Harvard University Cambridge, MA 02138
Add to Reading List

Document Date: 2010-03-21 22:20:21

Open Document

File Size: 202,09 KB

Share Result on Facebook
UPDATE