What is the difference between proofs and arguments of knowledge in the context of zero-knowledge?
I have read this sentence in this ePrint:
It is useful to distinguish between zero-knowledge proofs, with statistical soundness, and zero-knowledge arguments with computational soundness. In general proofs can only have computational zero-knowledge, while arguments may have perfect zero-knowledge.
It is also indicated in this article that:
Zero-knowledge protocols come in several flavors, depending on how one formulates the two security conditions: (1) the zero-knowledge condition, which says that the verifier “learns nothing” other than the fact the assertion being proven is true, and (2) the soundness conditions, which says that the prover cannot convince the verifier of a false assertion. In statistical zero knowledge, the zero-knowledge condition holds regardless of the computational resources the verifier invests into trying to learn something from the inter-action. In computational zero knowledge, we only require that a probabilistic polynomial-time verifier learn nothing from the interaction.1 Similarly, for soundness, we have statistical soundness, a.k.a. proof systems, where even a computationally unbounded prover cannot convince the verifier of a false statement (except with negligible probability), and computational soundness, a.k.a. argument systems [BCC], where we only require that a polynomial-time prover cannot convince the verifier of a false statement.
Which I assume that a zero knowledge argument is just a zero knowledge proof that has computational soundness rather than statistical soundness.
Am I right?