Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many… Expand
  • table 1
2014
2014
The demand for automated railway tracks extraction is driven by the importance of maintaining and updating the fundamental… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
2013
2013
This study had three main objectives: (1) to evaluate the aboveground biomass and volume yield of three unrelated hybrid poplar… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
2013
2013
We give a description of the model theoretic relation of forking independence in terms of the notion of JSJ decompositions in non… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2011
Highly Cited
2011
The prevalence of multicore architectures has accentuated the need for scalable cache coherence solutions. Many of the proposed… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2011
Highly Cited
2011
A project fork occurs when software developers take a copy of source code from one software package and use it to begin an… Expand
  • figure 1
Highly Cited
2008
Highly Cited
2008
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2006
Highly Cited
2006
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many… Expand
  • table 1
Highly Cited
2006
Highly Cited
2006
  • Alf Onshuus
  • Journal of Symbolic Logic
  • 2006
  • Corpus ID: 5751067
Abstract We develop a new notion of independence (ϸ-independence, read “thorn”-independence) that arises from a family of ranks… Expand
Highly Cited
2000
Highly Cited
2000
Time-dependent optimization problems pose a new challenge to evolutionary algorithms, since they not only require a search for… Expand
  • figure 1
  • figure 3
  • figure 4