Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Blockchain has attracted great attention as the basis of cryptocurrencies such as Bitcoin, but its capabilities extend far beyond… 
2016
2016
Security of a key exchange protocol is formally established through an abstract game between a chal-lenger and an adversary. In… 
2015
2015
The invention discloses a baking tray capable of fixedly forking hamburgers to rotate. A body comprises a heating element… 
Review
2012
Review
2012
In recent years many unexpected results have been proven using methods from model theoretic stability theory in unstable contexts… 
2008
2008
Using forking lemma to prove signature scheme is an important method to prove the security of signature schemes. Pointcheval and… 
2007
2007
Assume p∗ is a meager type in a superstable theory T . We investigate definability properties of p∗-closure. We prove that if T… 
2005
2005
Information about local events are to be distributed by agents in a sensor network. The agents are sent out traveling hop-by-hop… 
2005
2005
We define a “forking node” to be a service center with one input feeding two outputs (each served by its own queue) under the… 
2004
2004
In this paper we address the issue of denial of service (DoS) attacks targeting the hardware and software of voice over IP… 
2003
2003
Abstract. We prove that for any simple theory which is constructed via Fräissé-Hrushovski method, if the forking independence is…