Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
easy and natural some statements like for instance graph non-isomorphism can be proven in this new setup. It seems reasonable and is conjectured that the class of problems having an interactive proof (this class was denoted by IP) is substantially larger than the ones having only an interactive