The dining cryptographers problem: Unconditional sender and recipient untraceability (Q1109008): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q56172630, #quickstatements; #temporary_batch_1705508227706 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56172630 / rank | |||
Normal rank | |||
Revision as of 17:25, 17 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The dining cryptographers problem: Unconditional sender and recipient untraceability |
scientific article |
Statements
The dining cryptographers problem: Unconditional sender and recipient untraceability (English)
0 references
1988
0 references
dining cryptographers problem
0 references
untraceability
0 references
unconditional security
0 references
pseudonymity
0 references
one-time-use keys
0 references
public keys
0 references
