dec9.pdf
people.seas.harvard.edu · 1,234 words · saved by 1 readers
N/A
CS221: Computational Complexity Prof. Salil Vadhan Lecture 31: Multiprover Interactive Proofs and Probabilistically Checkable Proofs 12/09 Scribe: Qian Zhang Contents 1 Recap Note on hardness of approximate counting: Even though we used allowed randomized algo- rithms in our definition of α-approximation algorithm, the reductions we give to show hardness of approximate counting are not randomized. For example, if there is deterministic…
saved by
related reading
- Crash Course on Probabilistically Checkable Proofs (PCP)...youtube.com
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- 370.pdfeprint.iacr.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Reasons to believescottaaronson.blog
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca
- delegation.pdfpeople.csail.mit.edu
- lec5.pdfcrypto.stanford.edu
- pnp.pdfscottaaronson.com
- Collaborative zkSNARKseprint.iacr.org
- Interactive proof system - Wikipediaen.wikipedia.org
- A Succinct Story of Zero Knowledgenibnalin.me