<--- Back to Details
First PageDocument Content
Cryptography / Computational complexity theory / Theory of computation / Randomized algorithms / Complexity classes / Zero-knowledge proof / Interactive proof system / Quantum complexity theory / NP / IP / Soundness / Computational indistinguishability
Cryptography
Computational complexity theory
Theory of computation
Randomized algorithms
Complexity classes
Zero-knowledge proof
Interactive proof system
Quantum complexity theory
NP
IP
Soundness
Computational indistinguishability

ECE/CS498: Applied Cryptography Instructor: Andrew Miller, TA: Kevin Liao Lecture 2: Interactive Proofs 1

Add to Reading List

Source URL: gitlab-beta.engr.illinois.edu

Download Document from Source Website

File Size: 260,06 KB

Share Document on Facebook

Similar Documents

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

DocID: 1xUdf - View Document

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

DocID: 1xTKi - View Document

PDF Document

DocID: 1xSVG - View Document

PDF Document

DocID: 1xSM6 - View Document

PDF Document

DocID: 1xSJs - View Document