research interests lie in the intersections of game theory, stochastic
optimization, and anonymity in networking. Specifically, I develop
optimal scheduling policies to maximize user anonymity (secrecy of
source-destination pairs) in data networks under QoS requirements, with
particular emphasis on buffer and fairness constraints. More recently,
I have been working on studying anonymity in the context of signalling
games with the long term objective of quantifying the tension between
user privacy and tangible economic rewards.
"Anonymity of Mix Networks under Memory Limitations: An Information Theoretic Perspective, "abstract,pdf P. Venkitasubramaniam and A. Mishra submitted to IEEE Transactions on Information Theory, Sep. 2013.
"Anonymity and Fairness in Packet Scheduling: AQuantitative Tradeoff"abstract,pdf A. Mishra and P. Venkitasubramaniam submitted to IEEE Transactions on Networking, Nov. 2012 (revised Jan 2014)
"Admissible Length in Anonymous Networking: A Detection:Theoretic Perspective"abstract,pdf A. Mishra and P. Venkitasubramaniam IEEE Journal on Selected Areas in Communications, Vol. 31, No 9, pp. 1957-1969, Sep. 2013
"Encompassing Anonymity in Signalling Games"abstract,pdf A. Mishra and P. Venkitasubramaniam Accepted in Proc. 2014 Conference on Information Systems and Sciences (CISS), Princeton, NJ, Mar. 2014.