JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
Quiz 1 - Introduction and History of ZKP
Make sure you carefully put a single email address in the Email field that matches the email address you put in the signup form. Otherwise, you will not be graded for this quiz.
Sign in to Google
to save your progress.
Learn more
* Indicates required question
Email
*
Your email
Which of the following are true about Interactive Proofs (IP)?
*
1 point
IP is a superset of NP
IP prover runs in probabilistic polynomial time
IP verifier runs in probabilistic polynomial time
IP verifier is only allowed to use public randomness, i.e., it reveals the randomness it samples
Required
How is IP different from NP?
*
1 point
IP prover is computationally more powerful than NP prover
IP verifier is computationally more efficient
There is interaction between prover and verifier in IP
IP Verifier is randomized
Soundness guarantee in IP is probabilistic
Required
The lecture discussed an IP for Quadratic Residuosity (QR), where the proof was divided into two parts. Which of the following are true about this IP proof?
*
1 point
Given both parts of a proof, the verifier is convinced that y is a quadratic residue with 100% certainty
Given one part of a proof, a computationally bounded verifier can not learn any information from this part about the witness, i.e., sqrt(y), but an unbounded verifier can
The verifier eventually learns both parts of the proof, which convinces it that the claim is correct
The verifier never learns both parts of a proof but the ability of the prover to show either part eventually convinces the verifier that the claim is correct
This IP proof is actually a proof of knowledge
Required
Which of the following are true for the Graph 3-coloring IP discussed in the lecture?
*
1 point
This protocol is only honest verifier zero-knowledge because a malicious verifier can start piecing together information on the graph coloring with each iteration and break zero-knowledge
The protocol only offers computational zero-knowledge due to the use of commitments
Due to NP-completeness of graph 3-coloring, this protocol implies all of NP has a zero-knowledge IP
Required
Which of the following are true for simulation and extraction?
*
1 point
The simulator can create the view without the prover because it is computationally unbounded unlike the verifier
The simulator can simulate the view without the prover because it can sample the view out of order
The extractor can extract the witness only from successful provers
The extractor can extract the witness because it is computationally unbounded
Required
Send me a copy of my responses.
Submit
Page 1 of 1
Clear form
reCAPTCHA
Privacy
Terms
This form was created inside of UC Berkeley.
Report Abuse
Forms
