Metraipolis › archive › dc_259762eb7f32
Forking lemma — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Forking_lemma
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T18:03:18.345Z
- SHA-256 of the archived text
5f901ab493da08057a94cae093981388fc611784e8d15090627724c107c1f742- Stable URL of this page
https://metraipolis.com/documento/dc_259762eb7f32
How to cite
Forking lemma — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Forking_lemma (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_259762eb7f32 (Metraipolis archive dc_259762eb7f32, sha256 5f901ab493da08057a94cae093981388fc611784e8d15090627724c107c1f742)
BibTeX
@misc{dc259762eb7f32,
title = {Forking lemma — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Forking_lemma},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_259762eb7f32; sha256 5f901ab493da08057a94cae093981388fc611784e8d15090627724c107c1f742},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Forking_lemma. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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. This concept was first used by David Pointcheval and Jacques Stern in "Security proofs for signature schemes," published in the proceedings of Eurocrypt 1996. In their paper, the forking lemma is specified in terms of an adversary that attacks a digital signature scheme instantiated in the random oracle model. They show that if an adversary can forge a signature with non-negligible probability, then there is a non-negligible probability that the same adversary with the same random tape can create a second forgery in an attack with a different random oracle. The forking lemma was later generalized by Mihir Bellare and Gregory Neven. The forking lemma has been used and further generalized to prove the security of a variety of digital signature schemes and other random-oracle based cryptographic constructions. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «digital signature»). Fonte: Wikipedia in inglese, voce «Forking lemma» — https://en.wikipedia.org/wiki/Forking_lemma Wikidata Q5469821 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5469821 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Forking_lemma?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1368820575, consultata il 2026-10-15T17:13:32.689Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fb5ce9fae423b115cfd18666aac3d63059646293d0e7a4b96f7b250acc05f913