First Page | Document Content | |
---|---|---|
Date: 2013-10-07 12:12:36Cryptography Computational complexity theory Complexity classes Quantum complexity theory IP NP Randomized algorithms NEXPTIME Commitment scheme Soundness XTR PP | A note on efficient zero-knowledge (extended Joe NECAdd to Reading ListSource URL: people.csail.mit.eduDownload Document from Source WebsiteFile Size: 915,73 KBShare Document on Facebook |