分叉引理 - 引用次数：2参考来源 - 一种基于Pairing的带有阈下信道的灵活数字签名方案 A Pairing
·2,447,543篇论文数据，部分数据来源于NoteExpress
Forking lemma
abstract: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.