First Page | Document Content | |
---|---|---|
Date: 2010-03-21 22:20:21Cryptography 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 02138Add to Reading ListSource URL: people.seas.harvard.eduDownload Document from Source WebsiteFile Size: 202,09 KBShare Document on Facebook |