Classically, a mathematical proof of a theorem is something that can be written down and efficiently checked line by line. However, over the last 30 years, computer scientists have introduced a variety of nonclassical notions of proofs. These can be broadly described as "probabilistic proof systems", because they fundamentally involve randomness. The study of probabilistic proof systems has led to many exciting developments in cryptography and theoretical computer science over the last three decades. This course will describe a variety of probabilistic proof systems and their applications to cryptography and complexity theory. Topics include interactive proofs, multi-prover interactive proofs, probabilistically checkable proofs, zero-knowledge proofs, and proofs secure against computationally bounded provers (i.e., argument systems). Particular attention will be devoted to recent applications of probabilistic proof systems to cloud computing and cryptocurrencies. There are no formal prerequisites for this course. However, mathematical maturity will be expected. ">

Data Recovery

It appears you may have used Coursicle on this device and then cleared your cookies. You can recover your data by answering these questions.

User's photo
User ID:

Your account no longer exists

Your user ID no longer exists. Please refresh the page. If the issue persists, please contact us at support@coursicle.com.

Dismiss

COSC 544 - Probabilistic Proof Systems

Description
Classically, a mathematical proof of a theorem is something that can be written down and efficiently checked line by line. However, over the last 30 years, computer scientists have introduced a variety of nonclassical notions of proofs. These can be broadly described as "probabilistic proof systems", because they fundamentally involve randomness. The study of probabilistic proof systems has led to many exciting developments in cryptography and theoretical computer science over the last three decades. This course will describe a variety of probabilistic proof systems and their applications to cryptography and complexity theory. Topics include interactive proofs, multi-prover interactive proofs, probabilistically checkable proofs, zero-knowledge proofs, and proofs secure against computationally bounded provers (i.e., argument systems). Particular attention will be devoted to recent applications of probabilistic proof systems to cloud computing and cryptocurrencies. There are no formal prerequisites for this course. However, mathematical maturity will be expected. 
Recent Professors
Recent Semesters
Fall 2020, Fall 2017
Class Size
20-30
Credits
3
Usually Offered
MW (1 hour 15 minutes), TuTh (1 hour 15 minutes)