Provable unlinkability against traffic analysis with low message overhead (Q2516530)
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 6469029
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Provable unlinkability against traffic analysis with low message overhead |
scientific article; zbMATH DE number 6469029 |
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
0.9122034907341005
0 references
0.8827165365219116
0 references
0.8258534073829651
0 references
0.8192464113235474
0 references
