<--- Back to Details
First PageDocument Content
Cryptography / Proof theory / Computational complexity theory / Zero-knowledge proof / Complexity classes / Soundness / IP / Zero knowledge / Interactive proof system / PSPACE / Mathematical proof / Proof of knowledge
Date: 2018-10-12 13:22:58
Cryptography
Proof theory
Computational complexity theory
Zero-knowledge proof
Complexity classes
Soundness
IP
Zero knowledge
Interactive proof system
PSPACE
Mathematical proof
Proof of knowledge

The Art of Cryptography Zero Knowledge Proofs Abhiram Kothapalli Two Balls and the Color-Blind Friend

Add to Reading List

Source URL: abhiram.me

Download Document from Source Website

File Size: 4,26 MB

Share Document on Facebook

Similar Documents

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 1rgbF - View Document

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

DocID: 1raDV - View Document

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti

DocID: 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 grant

An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant

DocID: 1qOst - View Document

JOURNAL  OF COMPUTER AND SYSTEM SCIENCES

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

DocID: 1qf4Y - View Document