Relay Secrecy in wireless networks with eavesdroppers

44th Annual Allerton Conference on Communication, Control, and Computing 2006

Volumn 2, Issue , 2006, Pages 824-830

  Venkitasubramaniam, Parvathinathan ^a   He, Ting ^a   Tong, Lang ^a  

^a Cornell University   (United States)

Author keywords

Network security; Packet coding; Scheduling; Traffic mix

Indexed keywords

NETWORK PROTOCOLS; SCHEDULING; WIRELESS NETWORKS;

ACHIEVABLE RATE REGION; DATA FLOW; MATHEMATICAL FORMULATION; PACKET CODING; SCHEDULING TECHNIQUES; SPREAD-SPECTRUM SIGNALING; TRAFFIC MIX;

NETWORK SECURITY;

EID: 84940658470     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. D. Chaum,.Untraceable electronic mail, return addresses and digital pseudonyms,. Communications of the ACM, vol. 24, pp. 84.88, February 1981.
2. Q. Sun, D. R. Simon, Y. Wang, W. Russell, V. N. Padmanabhan, and L. Qiu,.Statistical identification of encrypted web browsing traffic,. in Proceedings of the 2002 IEEE Symposium on Security and Privacy, (Berkeley, California), p. 19, May 2002.
3. C. Gulcu and G. Tsudik,.Mixing e-mail with babel,. in Proceedings of the Symposium on Network and Distributed System Security, pp. 2. 19, February 1996.
4. G. Danezis, R. Dingledine, and N. Mathewson,.Mixminion: Design of a type iii anonymous remailer protocol,. in Proceedings of 2003 Symposium on Security and Privacy, pp. 2.15, May 2003.
5. M. K. Reiter and A. D. Rubin,.Crowds: Anonymity for Web transactions,. ACM Transactions on Information and System Security, vol. 1, no. 1, pp. 66.92, 1998.
6. D. Kesdogan, J. Egner, and R. Buschkes,.Stop-And-go MIXes providing probabilistic security in an open system,. in Second International Workshop on Information Hiding (IH'98), Lecture Notes in Computer Science, vol. 1525, (Portland, Oregon), pp. 83.98, April 1998.
7. X. Hong, P. Wang, J. Kong, Q. Zheng, and J. Liu,.Effective Probabilistic Approach Protecting Sensor Traffic,. in Military Communications Conference, 2005, (Atlantic City, NJ), pp. 1.7, Oct. 2005.
8. Y. Zhu, X. Fu, B. Graham, R.Bettati, and W. Zhao,.On flow correlation attacks and countermeasures in mix networks,. in Proceedings of Privacy Enhancing Technologies workshop, May 26-28 2004.
9. B.Radosavljevic and B. Hajek,.Hiding traffic flow in communication networks,. in Military Communications Conference, 1992.
10. S. Jiang, N. H. Vaidya, and W. Zhao,.A mix route algorithm for mix-net in wireless mobile ad hoc networks,. in Proceedings of IEEE Mobile Sensor and Ad-hoc and Sensor Systems, pp. 406.415, October 2004.
11. J. Kong and X. Hong,.Anodr: Anonymous on demand routing with untraceable routes for mobile ad-hoc networks,. in ACM lntemational Symposium on Mobile Ad Hoc Nefworking and Computing, (Annapolis, MD), June 2003.
12. C. E. Shannon,.Communication theory of secrecy systems,. Bell System Technical Journal, 1949.
13. A. Wyner,.The wiretap channel,. Bell Syst. Tech. J., vol. 54, pp. 1355. 1387, 1975.
14. A. Blum, D. Song, and S. Venkataraman,.Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds,. in Conference of Recent Advance in Intrusion Detection (RAID), (Sophia Antipolis, French Riviera, France), September 2004.
15. T. He and L. Tong,.Detecting Traffic Flows in Chaff: Fundamental Limits and Robust Algorithms. submitted to IEEE Trans. on Information Theory, 2006.
16. N. Shacham and P. McKenney,.Pakcet Recovery in High-Speed Networks using Coding and Buffer Management,. in Proc. IEEE INFOCOM, pp. 124.131, 1990.
17. L. Rizzo,.Effective Erasure Codes for Reliable Computer Communication Protocols,. in Proc. ACM SIGCOMM Computer Communication Review, vol. 27, pp. 24.36, 1997.
18. S. Boucheron and M. R. Salamatian,.About Priority Encoding Transmission,. IEEE Trans. Inform. Theory, vol. IT-46, March 2000.
19. P. Venkitasubramaniam, T. He, and L. Tong,.Networking with Secrecy Constraints. Accepted to 2006 IEEE Military Communications Conference, October 2006.
20. T. He and L. Tong,.Detecting Stepping-Stone Traffic in Chaff: Fundamental Limits and Robust Algorithms,. Tech. Rep. ACSP-TR-06-06-01, Cornell University, June 2006. http://acsp.ece.cornell.edu/pubR.html.
21. D. Cox and H. Miller, The Theory of Stochastic Processes. New York: John Wiley & Sons Inc., 1965.