Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
share a common random string, computational zero-knowledge is possible, without the need for interaction. In some sense this is a weakening of interaction, as through interaction they could agree on a common random string, but not the other way around. Arthur-Merlin Proofs Rather than cutting out