First Page | Document Content | |
---|---|---|
Date: 2018-10-25 10:32:39Cryptography 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 ListSource URL: zkproof.orgDownload Document from Source WebsiteFile Size: 333,35 KBShare Document on Facebook |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1rgbF - View Document | |
Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995DocID: 1raDV - View Document | |
ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro CorettiDocID: 1r8mX - View Document | |
An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grantDocID: 1qOst - View Document | |
JOURNAL OF COMPUTER AND SYSTEM SCIENCESDocID: 1qf4Y - View Document |