The dining cryptographers problem: Unconditional sender and recipient untraceability (Q1109008)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The dining cryptographers problem: Unconditional sender and recipient untraceability |
scientific article; zbMATH DE number 4068778
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The dining cryptographers problem: Unconditional sender and recipient untraceability |
scientific article; zbMATH DE number 4068778 |
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
