BIT-TRAPS: Building information-theoretic traffic privacy into packet streams

IEEE Transactions on Information Forensics and Security

Volumn 6, Issue 3 PART 1, 2011, Pages 752-762

  Mathur, Suhas ^a   Trappe, Wade ^b  

^a ATandT Security Research Center   (United States)

^b Piscataway   (United States)

Author keywords

Computer networks; data privacy; information security; mutual information

Indexed keywords

AVERAGE COST; BUFFERING DELAY; COMMUNICATIONS PROTOCOLS; CONSTRAINED OPTIMIZATION PROBLEMS; DISCRETE CHANNEL; ENCRYPTED DATA; MUTUAL INFORMATIONS; NON-LINEAR RELATIONSHIPS; ORTHOGONAL METHOD; PACKET STREAMS; PREVENT INFORMATION LEAKAGE; RANDOMIZED ALGORITHMS; SIDE-CHANNEL; VARIABLE PACKET SIZE;

COMPUTER PRIVACY; CONSTRAINED OPTIMIZATION; DATA PRIVACY; INFORMATION THEORY;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 80051753305     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2011.2138696     Document Type: Article

References (17)

1. C. Wright, L. Ballard, S. Coulls, F. Monrose, and G. Masson, "Spot me if you can: Recovering spoken phrases in encrypted voip conversations", in Proc. IEEE Symp. Security and Privacy, 2008.
2. C. Wright, L. Ballard, F. Monrose, and G. Masson, "Language identification of encrypted voip traffic: Alejandra y roberto or alice and bob?", in Proc. 16th USENIX Security Symp., Boston, MA, 2007.
3. T. S. Saponas, J. Lester, C. Hartung, S. Agarwal, and T. Kohno, "Devices that tell on you: Privacy trends in consumer ubiquitous computing", in Proc. 16th USENIX Security Symp. USENIX Security Symp. (SS'07), Berkeley, CA, 2007, pp. 1-16, USENIX Association.
4. Y. Sun and K. Liu, "Analysis and protection of dynamic membership information for group key distribution schemes", IEEE Trans. Inf. Forensics Security, vol. 2, no. 2, pp. 213-226, Jun. 2007. (Pubitemid 46808689)
5. P. Kamat, W. Xu, W. Trappe, and Y. Zhang, "Temporal privacy in wireless sensor networks", in Proc. 27th IEEE Int. Conf. Distributed Computing Systems (ICDCS'07), 2007, pp. 23-31.
6. D. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms", Commun. ACM, vol. 24, pp. 84-88, 1981. (Pubitemid 11480996)
7. C. Diaz and B. Preneel, "Taxonomy of mixes and dummy traffic", in Proc. 3rd Working Conf. Privacy and Anonymity in Networked and Distributed Systems, Toulouse, France, 2004.
8. M. Reed, P. Syverson, and D. Goldschlag, "Anonymous connections and onion routing", IEEE J. Sel. Areas Commun., vol. 16, no. 4, pp. 482-494, May 1998.
9. T. Cover and J. Thomas, Elements of Information Theory. Hoboken, NJ: Wiley, 1991.
10. D. Kesdogan, J. Egner, and R. Buschkes, "Stop-and-go-mixes providing probabilistic anonymity in an open system", in Proc. Second Int. Workshop on Information Hiding, London, U. K., 1998, pp. 83-98, Springer-Verlag.
11. G. Danezis, "The traffic analysis of continuous-time mixes", in Proc. Privacy Enhancing Technologies (PET 2004), D. Martin and A. Serjantov, Eds., May 2004.
12. D. X. Song, D. Wagner, and X. Tian, "Timing analysis of keystrokes and timing attacks on ssh", in Proc. 10th Conf. USENIX Security Symp. (SSYM'01), Berkeley, CA, 2001, pp. 25-25, USENIX Association.
13. V. Anantharam and S. Verdu, "Bits through queues", IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 4-18, Jan. 1996. (Pubitemid 126775652)
14. R. M. A. Dionisioa and D. A. Mendesb, "Mutual information: A measure of dependency for nonlinear time series", Physica A, Statist. Mechanics and Its Applicat., Applicat. Phys. Financial Anal. 4 (APFA4), vol. 344, pp. 326-329, 2004.
15. R. Ash, Information Theory. New York: Dover, 1965.
16. C. Chang and J. Thomas, "Rate distortion functions and effective bandwidth of queueing processes", in Proc. 1995 IEEE Int. Symp. Information Theory, Piscataway, NJ, 1995, pp. 103-103.
17. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U. K.: Cambridge Univ. Press, Mar. 2004.