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)

Related topics

Related topics

9 relations
CryptographyDigital signatureDiscrete logarithmEurocrypt

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The Local Forking Lemma and its Application to Deterministic Encryption
We bypass impossibility results for the deterministic encryption of public-key-dependent messages, showing that, in this setting… 
Highly Cited
2019
Highly Cited
2019
On the Security of Two-Round Multi-Signatures
A multi-signature scheme allows a group of signers to collaboratively sign a message, creating a single signature that convinces… 
2013
2013
Forking and JSJ decompositions in the free group
We give a description of the model theoretic relation of forking independence in terms of the notion of JSJ decompositions in non… 
Highly Cited
2011
Highly Cited
2011
To Fork or Not to Fork: Fork Motivations in SourceForge Projects
A project fork occurs when software developers take a copy of source code from one software package and use it to begin an… 
Highly Cited
2011
Highly Cited
2011
Towards the ideal on-chip fabric for 1-to-many and many-to-1 communication
The prevalence of multicore architectures has accentuated the need for scalable cache coherence solutions. Many of the proposed… 
Highly Cited
2008
Highly Cited
2008
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the… 
Highly Cited
2006
Highly Cited
2006
Multi-signatures in the plain public-Key model and a general forking lemma
A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many… 
Highly Cited
2006
Highly Cited
2006
Properties and consequences of Thorn-independence
Abstract We develop a new notion of independence (ϸ-independence, read “thorn”-independence) that arises from a family of ranks… 
Highly Cited
2000
Highly Cited
2000
A Multi-population Approach to Dynamic Optimization Problems
Time-dependent optimization problems pose a new challenge to evolutionary algorithms, since they not only require a search for… 
1982
1982
Dimension theory and homogeneity for elementary extensions of a model
We take a fixed countable model M0, and we look at the structure of and number of its countable elementary extensions (up to… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)