Hiding identities of communicating parties in a networked system is essential to protect individuals form release of sensitive and private information. In this regard encryption alone is insufficient to guarantee protection and new paradigms of scheduling, routing and transmission of packets are necessary to prevent leakage of such information. These paradigm changes impact the performance of networked system under different criteria including delay, memory use, fairness to name a few. Our research has characterized the fundamental limits of achievable anonymity and quantified the impact on many of these performance measures, and through the process developed new algorithms for networked communication.
Some publications that delineate our work:
Javidbakht, Omid, and Parv Venkitasubramaniam. “Delay Anonymity Tradeoff in Mix Networks: Optimal Routing.” IEEE/ACM Transactions on Networking (TON) 25.2 (2017): 1162-1175. pdf
Javidbakht, Omid, and Parv Venkitasubramaniam. “Differential privacy in networked data collection.” 2016 Annual Conference on Information Science and Systems (CISS). IEEE, 2016. pdf
Javidbakht, Omid, and Parv Venkitasubramaniam. “Relay selection in wireless networks for optimal delay anonymity tradeoff.” 2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). IEEE, 2015. pdf
Javidbakht, Omid, and Parv Venkitasubramaniam. “Relay Selection and Operation Control for Optimal Delay Anonymity Tradeoff in Anonymous Networks.” IEEE Transactions on Control of Network Systems 5.1 (2016): 607-617. pdf
Javidbakht, Omid, and Parv Venkitasubramaniam. “Relay selection for optimal delay anonymity tradeoff in anonymous networks.” MILCOM 2015-2015 IEEE Military Communications Conference. IEEE, 2015. pdf
Mishra, Abhishek, and Parv Venkitasubramaniam. “Anonymity and fairness in packet scheduling: A quantitative tradeoff.” IEEE/ACM Transactions on Networking 24.2 (2015): 688-702. pdf
Javidbakht, Omid, and Parv Venkitasubramaniam. “Rate allocation for Multihop routing in anonymous networking.” 2014 48th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2014. pdf
Mishra, Abhishek, and Parv Venkitasubramaniam. “Admissible length study in anonymous networking: A detection theoretic perspective.” IEEE Journal on Selected Areas in Communications 31.9 (2013): 1957-1969. pdf
Pradhan, Parth, and Parv Venkitasubramaniam. “Stealthy attacks in dynamical systems: Tradeoffs between utility and detectability with application in anonymous systems.” IEEE Transactions on Information Forensics and Security 12.4 (2016): 779-792. pdf
Mishra, Abhishek, and Parv Venkitasubramaniam. “Anonymity of a buffer constrained chaum mix: Optimal strategy and asymptotics.” 2013 IEEE International Symposium on Information Theory. IEEE, 2013. pdf
Mishra, Abhishek, and Parv Venkitasubramaniam. “Anonymity in wireless networks under capture or selective jamming: An admissible length study.” 2013 16th International Symposium on Wireless Personal Multimedia Communications (WPMC). IEEE, 2013. pdf
Javidbakht, Omid, and Parv Venkitasubramaniam. “Rate allocation for Multihop routing in anonymous networking.” 2014 48th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2014. pdf
Venkitasubramaniam, Parv, and Abhishek Mishra. “Anonymity of memory-limited Chaum mixes under timing analysis: An information theoretic perspective.” IEEE Transactions on Information Theory 61.2 (2014): 996-1009. pdf
Mishra, Abhishek, and Parv Venkitasubramaniam. “Anonymity in packet scheduling under the max-min fairness criterion.” 2012 46th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2012. pdf
Venkitasubramaniam, Parv, and Lang Tong. “A game-theoretic approach to anonymous networking.” IEEE/ACM Transactions on Networking (TON) 20.3 (2012): 892-905 pdf
Mishra, Abhishek, and Parv Venkitasubramaniam. “The anonymity of an almost fair chaum mix.” 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE, 2011. pdf
Mishra, Abhishek, and Parv Venkitasubramaniam. “Source anonymity in fair scheduling: A case for the proportional method.” 2012 IEEE International Conference on Communications (ICC). IEEE, 2012. pdf
Venkitasubramaniam, Parv. “Anonymity under flow insertion: A game theoretic approach.” 2010-MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE. IEEE. pdf
Venkitasubramaniam, Parv. “Anonymous networking under memory constraints.” 2010 IEEE International Conference on Communications. IEEE, 2010. pdf
Venkitasubramaniam, Parv, and Lang Tong. “Anonymous networking with localized eavesdroppers: A game-theoretic approach.” 2009 43rd Annual Conference on Information Sciences and Systems. IEEE, 2009. pdf
Venkitasubramaniam, Parvathinathan, and Lang Tong. “Throughput anonymity trade-off in wireless networks under latency constraints.” IEEE INFOCOM 2008-The 27th Conference on Computer Communications. IEEE, 2008. pdf
Venkitasubramaniam, Parv, and Venkat Anantharam. “Anonymity under light traffic conditions using a network of mixes.” 2008 46th Annual Allerton Conference on Communication, Control, and Computing. IEEE, 2008 pdf
Venkitasubramaniam, P., He, T., Tong, L., & Wicker, S. B. (2008). Toward an analytical approach to anonymous wireless networking. IEEE Communications Magazine, 46(2), 140-146. pdf
Venkitasubramaniam, Parvathinathan, and Venkat Anantharam. “On the anonymity of chaum mixes.” 2008 IEEE International Symposium on Information Theory. IEEE, 2008. pdf
Venkitasubramaniam, Parvathinathan, and Lang Tong. “Anonymous networking with minimum latency in multihop networks.” 2008 IEEE Symposium on Security and Privacy (sp 2008). IEEE, 2008. pdf
Venkitasubramaniam, Parvathinathan, Ting He, and Lang Tong. “Anonymous networking amidst eavesdroppers.” IEEE Transactions on Information Theory 54.6 (2008): 2770-2784 pdf
Venkitasubramaniam, Parvathinathan, and Lang Tong. “A rate-distortion approach to anonymous networking.” Proc. 2007 Allerton Conf. Commun., Control and Comp. 2007. pdf