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
- Interactive proof system - Wikipediaen.wikipedia.org
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Mediummia-tang.medium.com
- delegation.pdfpeople.csail.mit.edu
- A Succinct Story of Zero Knowledgenibnalin.me
- Zero-Knowledge Proofs | MIT CSAIL Theory of Computationtoc.csail.mit.edu
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- Lecture 14: Zero knowledge proofsboazbarak.org
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Collaborative zkSNARKseprint.iacr.org
- PCP theorem - Wikipediaen.wikipedia.org
- Secure multi-party computation - Wikipediaen.wikipedia.org