Construct · 1 fields · 1 citations

forking lemma: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
forkinglemma1 CONSTRUCTForking lemmaPOINTCHEVAL · CRYPTOGRAPHY

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Cryptography

a lemma showing that rewinding an adversary with a different random oracle answer yields two related forgeries, used to prove signature schemes secure.

In cryptography, forking lemma refers to a lemma showing that rewinding an adversary with a different random oracle answer yields two related forgeries, used to prove signature schemes secure. This meaning comes from Pointcheval (2000) in Journal of Cryptology.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how forking lemma sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

lemma1 fields · 3 citationsanchor · a standalone constructoracle4 fields · 8 citationsjingle · one word, four constructssignature3 fields · 4 citationsjingle · one word, three constructs

References

  1. Pointcheval, D., & Stern, J. (2000). Security Arguments for Digital Signatures and Blind Signatures. Journal of Cryptology, 13(3), 361-396. https://doi.org/10.1007/s001450010003

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct