Provable unlinkability against traffic analysis with low message overhead (Q2516530): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62398445, #quickstatements; #temporary_batch_1707149277123 |
Removed claim: author (P16): Item:Q536067 |
||
Property / author | |||
Property / author: Amos Fiat / rank | |||
Revision as of 03:17, 16 February 2024
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