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 the normal view instead:
scientific article; zbMATH DE number 4068778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.755341112613678
0 references
0.7500116229057312
0 references
0.7477338314056396
0 references
