Dave Choffnes visit

Next Thursday, we’re lucky to have Dave Choffnes visiting the lab. David Choffnes is an assistant professor in the College of Computer and Information Science at Northeastern University. His research is primarily in the areas of distributed systems and networking, with a recent focus on mobile systems and privacy. Much of his work entails crowdsourcing measurement and performance evaluation of Internet systems by deploying software to users at the scale of tens or hundreds of thousands of users. He earned his PhD from Northwestern (not in the northwest), and completed a postdoc at the University of Washington (in the northwest) prior to joining Northeastern (both in the northeast and northwest). He sees no reason why this should at all be confusing. He is a co-author of three textbooks, and his research has been supported by the NSF, Google, the Data Transparency Lab, VidScale, M-Lab, and a Computing Innovations Fellowship.

  • Time: Thursday May 19th, 11am
  • Location: DTU, Building 321, 1st floor lab space

Title: ReCon: Identifying and Controlling Privacy Leaks from Mobile Devices

Abstract: Mobile systems have become increasingly popular for providing ubiquitous Internet access; however, recent studies demonstrate that software running on these systems extensively tracks and leaks users’ personally identifiable information (PII). I argue that these privacy leaks persist in large part because mobile users have little visibility into PII leaked through the network traffic generated by their devices, and have poor control over how, when and where that traffic is sent and handled by third parties.


In this talk, I describe ReCon, a cross-platform system that reveals PII leaks and gives users control over them without requiring any special privileges or custom OSes. Specifically, our key observation is that PII leaks must occur over the network, so we implement our system in the network using a software middlebox. We then use a machine learning approach to to efficiently and accurately detect users’ PII without knowing a priori the content that is PII. Further, we develop techniques to block, obfuscate, or ignore the PII leak, by displaying leaks via a visualization tool and letting the user decide how the system should act on transmitted PII. I discuss the design and implementation of the system and evaluate its methodology with measurements from controlled experiments and flows from a user study with more than 100 participants. In addition to revealing and controlling PII leaks, we are using our machine-learning-based techniques to automatically identify and block malware based on network behaviors.

Dynamic and Multiplex Networks

Network science buffs are in for a treat this Monday (September 1st, 2014), when we have a great set of visitors in my Group at DTU.  I’m excited to present talks on the cutting edge on what we know about networks from János Kertész and Janos Török. The talks will be back to back and detailed info can be found below

The talks are open to the public, so hope to see you there!

  • Time: Monday September 1st, 10am – noon
  • Place: DTU Building 321, room 134 (1st floor lab area).
  • Speakers:
    • János Török (10am-11pm). Associate professor at Budapest University of Technology, Department of Theoretical Physics.
    • János Kertész (11am-12pm). Professor & Director of the Institute of Physics, Budapest University of Technology and Economics

Multi-level, multi-channel, multi-agent modeling of social interactions (János Török)

Abstract: We present a model of society. Human relations are strengthened by communication and eroded by time. Communication is, in general, related to some social activity (work, friendship, hobby) or social context. Therefore we postulate that individuals having different social needs participate in a number of social contexts (family, workplace etc.) – which may also evolve in time – and communicate with other members of the contexts using different communication channels (face to face, phone, email, etc.) for different purposes and with different impact on their relationship. We show that using realistic input data from surveys and statistical data one can reproduce important features of real society like Dunbar’s numbers and their meaning.

Spreading on temporal networks: Results from empirical analysis, model calculations and simulation (János Kertész)

Abstract: Spreading phenomena typically take place on temporal networks, where connections between the nodes are only occasionally and for limited time present. Such events can be, e.g., encounters of people, which are important for contagion or opening a communication channel needed for information transmission. We studied a mobile call network from this point of view: Having the time stamped records of the calls we played a ‘susceptible-infected’ game by infecting one node at random and assuming transmission at every possible event. We introduced different reference systems by appropriate shuffling of the data and identified this way the contributions of the different types of correlations to the speed of spreading. We concluded that there is a considerable slowing down as compared to the random models, mainly due to the correlations between the link weights and the topology and the inhomogeneous, bursty character of the events. We have also shown that the temporal inhomogeneity cannot be characterized by the inter-event time distribution (IETD) alone as there are strong dependencies between the events. In order to understand better the role of the different components we investigated models of temporal networks. In the analytically solvable infinite complete graph we showed that burstiness, i.e., power law IETD distribution always accelerates the process provided the clocks are positioned on the nodes. For the complementary case of link related burstiness we considered a number of models, like the analytically tractable Cayley tree, BA trees and networks. We show that if the stationary bursty process is governed by power-law IETD, the spreading can be slowed down or accelerated as compared to a Poisson process; the speed is determined by the short time behavior, which in our model is controlled by the exponent. We demonstrate that finite, so called “locally tree-like” networks, like the Barabási-Albert networks behave very differently from real tree graphs if the IETD is strongly fat-tailed, as the lack or presence of rare alternative paths modifies the spreading. A further important result is that the non-stationarity of the dynamics has a significant effect on the spreading speed for strongly fat-tailed power-law IETDs, thus bursty processes characterized by small power-law exponents can cause slow spreading in the stationary state but also very rapid spreading heavily depending on the age of the processes.

References:

1. M. Karsai, M. Kivelä, R. K. Pan, K. Kaski, J. Kertész, A.-L. Barabási, J. Saramäki: Small But Slow World: How Network Topology and Burstiness Slow Down Spreading, Phys. Rev. E 83, 025102 (2011)

2. Márton Karsai, Kimmo Kaski, Albert-László Barabási, János Kertész: Universal features of correlated bursty behavior, Scientific Reports 2, Article number 397 (2012)

3. Márton Karsai, Kimmo Kaski, János Kertész: Correlated dynamics in egocentric communication networks, PLoS ONE 7(7) e40612 (2012)

4. Hang-Hyun Jo, Márton Karsai, János Kertész, Kimmo Kaski: Circadian pattern and burstiness in human communication activity, New J. Phys. 14 013055 (2012)

5. Szabolcs Vajna, Bálint Tóth, János Kertész: Modelling power-law distributed interevent times, New J. Phys.15, article 103023 (2013)

6. Hang-Hyun Jo, Juan I. Perotti, Kimmo Kaski, János Kertész: Enhanced Spreading Dynamics by Non-Poissonian Processes, Physical Review X 4, 011041 (2014)

7. Dávid X. Horváth, János Kertész: Spreading dynamics on networks: the role of burstiness, topology and non-stationarity, New Journal of Physics 16 (7), 073037