Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
rounds of interaction (a.k.a. round complexity) required for a ZK proof for problems in various complexity classes, for various notions of zero-knowledge and under various assumptions (existence of one-way functions, collision-resistant hash functions). Despite all the impossibility results not