What is forking lemma?

Forking Lemma

The forking lemma is any of a number of related lemmas in cryptography research. The lemma states that if an adversary (typically a probabilistic Turing machine), on inputs drawn from some distribution, produces an output that has some property with non-negligible probability, then with non-negligible probability, if the adversary is re-run on new inputs but with the same random tape, its second output will also have the property.

Read more about Forking Lemma.

Some articles on forking lemma:

Known Issues With Application of Forking Lemma
... The reduction provided by the forking lemma is not a tight reduction ... arguments for Digital Signatures and Blind Signature using Forking Lemma ...