Key points are not available for this paper at this time.
In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space.
Adi Shamir (Thu,) studied this question.