Maximum throughput of clandestine relay
暂无分享,去创建一个
[1] Yih-Chun Hu. Packet Leashes : A Defense against Wormhole Attacks in Wireless Ad Hoc Networks , 2001 .
[2] G. Arfken. Mathematical Methods for Physicists , 1967 .
[3] Lang Tong,et al. Detection of Information Flows , 2008, IEEE Transactions on Information Theory.
[4] Xiaoyan Hong,et al. ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks , 2003, MobiHoc '03.
[5] Bruce Hajek,et al. Hiding traffic flow in communication networks , 1992, MILCOM 92 Conference Record.
[6] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[7] Ting He. Maximum Throughput of Clandestine Relay: Proof of Selected Theorems , 2008 .
[8] Sally Floyd,et al. Wide area traffic: the failure of Poisson modeling , 1995, TNET.
[9] Dawn Xiaodong Song,et al. Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds , 2004, RAID.
[10] Lang Tong,et al. Anonymous Networking Amidst Eavesdroppers , 2008, IEEE Transactions on Information Theory.
[11] Lang Tong,et al. On security-aware transmission scheduling , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.
[12] Yih-Chun Hu,et al. Packet leashes: a defense against wormhole attacks in wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[13] Riccardo Bettati,et al. On Flow Correlation Attacks and Countermeasures in Mix Networks , 2004, Privacy Enhancing Technologies.