Delay optimal policies offer very little privacy

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 2454-2462

  Kadloor, Sachin ^a,c   Kiyavash, Negar ^b,c  

^a University of Illinois at Urbana Champaign   (United States)

^b ISE Department and Coordinated Science Lab   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY-OPTIMAL; ESTIMATION ERRORS; EVENT SCHEDULER; FIRST-COME-FIRST-SERVED; PRIVACY METRIC; ROUND-ROBIN SCHEDULING; SCHEDULING POLICIES; USAGE PATTERNS;

OPTIMIZATION; SCHEDULING;

SCHEDULING ALGORITHMS;

EID: 84883069703     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6567051     Document Type: Conference Paper

References (15)

1. S. Kadloor, N. Kiyavash, and P. Venkitasubramaniam, "Mitigating timing based information leakage in shared schedulers," in INFOCOM, 2012 Proceedings IEEE, pp. 1044 -1052, March 2012.
2. S. J. Murdoch and G. Danezis, "Low-cost traffic analysis of tor," in Proceedings of the 2005 IEEE Symposium on Security and Privacy, SP '05, pp. 183-195, IEEE Computer Society, 2005.
3. N. S. Evans, R. Dingledine, and C. Grothoff, "A practical congestion attack on tor using long paths," in Proceedings of the 18th conference on USENIX security symposium, SSYM'09, (Berkeley, CA, USA), pp. 33-50, USENIX Association, 2009.
4. X. Gong, N. Borisov, N. Kiyavash, and N. Schear, "Website detection using remote traffic analysis," in Privacy Enhancing Technologies, 2012.
5. T. Ristenpart, E. Tromer, H. Shacham, and S. Savage, "Hey, you, get off of my cloud: exploring information leakage in third-party compute clouds," in Proceedings of the 16th ACM conference on Computer and communications security, CCS '09, pp. 199-212, ACM, 2009.
6. K. Zhang and X. Wang, "Peeping Tom in the Neighborhood: Keystroke Eavesdropping on Multi-User Systems," in USENIX Security, 2009.
7. C. V. Wright, L. Ballard, S. E. Coull, F. Monrose, and G. M. Masson, "Spot me if you can: Uncovering spoken phrases in encrypted voip conversations," in SP '08: Proceedings of the 2008 IEEE Symposium on Security and Privacy, pp. 35-49, IEEE Computer Society, 2008.
8. D. Brumley and D. Boneh, "Remote timing attacks are practical," Computer Networks, vol. 48, no. 5, pp. 701-716, 2005.
9. S. Kadloor, N. Kiyavash, and P. Venkitasubramaniam, "Scheduling with privacy constraints," in 2012 IEEE Information Theory Workshop (IEEE ITW 2012), an extended version is available at http://www.ifp.illinois.edu/ ~kadloor1/kadloor-itw-extended.pdf , (Lausanne, Switzerland), Sept. 2012.
10. E. Hahne, "Round-robin scheduling for max-min fairness in data networks," Selected Areas in Communications, IEEE Journal on, vol. 9, pp. 1024 -1039, sep 1991.
11. R. G. Gallager, Poisson Processes, class notes, available online at http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/ 6-262-discrete-stochastic-processes-spring-2011/course-notes/MIT6-262S11-chap02. pdf .
12. T. Narayana, Lattice path combinatorics, with statistical applications. Mathematical expositions, University of Toronto Press, 1979.
13. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, "A view of cloud computing," Commun. ACM, vol. 53, pp. 50-58, Apr. 2010.
14. S. Kadloor, X. Gong, N. Kiyavash, T. Tezcan, and N. Borisov, "A lowcost side channel traffic analysis attack in packet networks," in IEEE ICC 2010, 2010.
15. S. Kadloor, X. Gong, N. Kiyavash, and P. Venkitasubramaniam, "Designing router scheduling policies: A privacy perspective," Signal Processing, IEEE Transactions on, vol. 60, pp. 2001 -2012, April 2012.