Interactive proof system
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover possesses unlimited computational resources but cannot be trusted, while the verifier has bounded computation power but is assumed to be always honest. Messages are sent between the verifier and prover until the verifier has an answer to the problem and has "convinced" itself that it is correct.
Interactive proof system - Wikipedia Jump to content From Wikipedia, the free encyclopedia Abstract machine that models computation Not to be confused with Proof assistant . General representation of an interactive proof protocol. In computational complexity theory , an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier . The parties interact by exchanging messages in order to ascertain whether a given string belongs to a language or not. The prover is assumed to possess unlimited computational resour
Explore this link on the map →related reading
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Mediummia-tang.medium.com
- 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
- Zero-knowledge proof - Wikipediaen.wikipedia.org
- Lecture 14: Zero knowledge proofsboazbarak.org
- Complexity class - Wikipediaen.wikipedia.org
- PCP theorem - Wikipediaen.wikipedia.org
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca
- P vs NP and its application to zero knowledge proofs | RareSkillsrareskills.io
- P versus NP problem - Wikipediaen.wikipedia.org
- A Masters project | MyCQstatemycqstate.wordpress.com