Provable unlinkability against traffic analysis with low message overhead (Q2516530)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Provable unlinkability against traffic analysis with low message overhead |
scientific article |
Statements
Provable unlinkability against traffic analysis with low message overhead (English)
0 references
3 August 2015
0 references
mix protocol
0 references
traffic analysis
0 references
mixing time
0 references
Markov chain
0 references
unlinkability
0 references
