Forking lemma

The forking lemma is any of a number of related lemmas in cryptography research. The lemma states that if an adversary, 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.