Towards a Doubly Efficient IP = PSPACEResearch Paper
An interactive proof lets a verifier with limited resources check a claim "" by exchanging messages with a prover. The theorem of Lund, Fortnow, Karloff and Nisan and of Shamir (1992) shows that every time-, space- computation can be checked by a -time verifier. In those protocols the honest prover…