Zero Knowledge, Zkp, Fiat Shamir, Zero Knowledge Proofs.
common random string à la Blum — Feldman — Micali, we can obtain non-interactive zero-knowledge proofs. You might be wondering if these do not contradict the impossibility result of Goldreich-Oren. The answer is no. These are all part of different computational models. Goldreich-Oren is a result in