The work of Rothblum, Vadhan, and Wigderson ({\em STOC}, 2013) is pivotal to the study of interactive proofs of proximity (IPPs).
We present the main contents of their work, while clarify a few (conceptual) aspects.
Specifically, starting with the definition of IPP systems, our main focus is on the construction of IPP systems for any property in log-space uniform $\cal NC$ (and beyond).
We also present limitations on the power of constant-round IPP systems.

Omitting the condition $\mu'\leq1/|F|$ from Lemma 2.3,
adding a new FN14 on $P_{\F,d}$ and a new FN20 on private to public coin.

The work of Rothblum, Vadhan, and Wigderson ({\em STOC}, 2013) is pivotal to the study of interactive proofs of proximity (IPPs).
We present the main contents of their work, while clarify a few (conceptual) aspects.
Specifically, starting with the definition of IPP systems, our main focus is on the construction of IPP systems for any property in log-space uniform $\cal NC$ (and beyond).
We also present limitations on the power of constant-round IPP systems.

Slightly rephrasing Theorem 2 and Lemma 2.1.
Clarifying Footnote 11.
Correcting a few typos.

The work of Rothblum, Vadhan, and Wigderson ({\em STOC}, 2013) is pivotal to the study of interactive proofs of proximity (IPPs).
We present the main contents of their work, while clarify a few (conceptual) aspects.
Specifically, starting with the definition of IPP systems, our main focus is on the construction of IPP systems for any property in log-space uniform $\cal NC$ (and beyond).
We also present limitations on the power of constant-round IPP systems.