Construct · 1 fields · 1 citations

dining cryptographers problem: a standalone construct

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

● anchor · a standalone construct Nearest construct by meaning·not indexed

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

Anonymous communication

a protocol problem in which participants broadcast combined shared secrets so one of them can send a message with unconditional sender untraceability.

In anonymous communication, dining cryptographers problem refers to a protocol problem in which participants broadcast combined shared secrets so one of them can send a message with unconditional sender untraceability. This meaning comes from Chaum (1988) in Journal of Cryptology.[1]

Unit
Recovery means
Measured by

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

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

Open in Collider Export BibTeX Report this entry

Nearby constructs

message3 fields · 6 citationsjingle · one word, three constructs protocol1 fields · 1 citationsanchor · a standalone construct send1 fields · 1 citationsanchor · a standalone construct

References

Chaum, D. (1988). The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1), 65-75. https://doi.org/10.1007/bf00206326

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