DocumentCode
3010385
Title
Embedding covert information flow
Author
Marano, Stefano ; Matta, Vincenzo ; Tong, Lang
Author_Institution
Dept. of Inf. & Electr. Eng., Univ. of Salerno, Fisciano, Italy
fYear
2010
fDate
7-10 Nov. 2010
Firstpage
52
Lastpage
56
Abstract
The problem of embedding a covert information flow in independent renewal cover traffic is considered. Such embedding provides maximum anonymity against traffic analysis. The maximum embedding efficiency is characterized, and an accurate approximation is obtained by formulating the problem as a Riemann-Hilbert boundary value problem.
Keywords
boundary-value problems; telecommunication traffic; Riemann-Hilbert boundary value problem; covert information flow embedding; independent renewal cover traffic; maximum anonymity; traffic analysis; Approximation methods; Conferences; Delay; Integral equations; Privacy; Security; Anonymous networking; Fredholm integral equation; Riemann-Hilbert problem; traffic analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Signals, Systems and Computers (ASILOMAR), 2010 Conference Record of the Forty Fourth Asilomar Conference on
Conference_Location
Pacific Grove, CA
ISSN
1058-6393
Print_ISBN
978-1-4244-9722-5
Type
conf
DOI
10.1109/ACSSC.2010.5757465
Filename
5757465
Link To Document