31 March 2020 in IEEE Transactions on Vehicular Technology
The aim of this article is to improve vehicular traffic in terms of both travel time and load balance. To achieve this goal, we propose an optimization model that minimizes the sum of the total travel time in the road network and a time representation of the traffic imbalance effects in the network. This paper presents an analytic formulation of the optimization problem, and an algorithm, Dynamic Interior Point Method (DIPM), that solves this optimization through driver rerouting. Unlike user-optimum traffic optimizations, DIPM leads to better fairness for drivers and works well in case of congestion. Unlike other system-wide traffic optimizations, DIPM considers the effects of the driver behavior on traffic load. Together, these features allow our system to work well in a potential real-world deployment. DIPM benefits from a central server that computes driver routes, which is reachable via cellular networks or vehicular ad hoc networks. Theoretical analysis and simulation results demonstrate that DIPM is fast and can work in real-time. The results of extensive simulations with realistic urban maps and traffic scenarios show that DIPM outperforms other dynamic rerouting algorithms in terms of travel time. DIPM also improves fairness when compared with a user-optimum approach.
22 February 2022 in Foundations and Trends® in Privacy and Security
Cloud services have revolutionized modern computing. The benefits of outsourcing data and computation come with security and privacy concerns. This monograph explores the advances in cloud security research across both industry and academia, with a special focus on secure infrastructure, services and storage. Besides overviewing the state of the art, the monograph highlights open problems, and possible future research directions.
14 May 2021 in IEEE Transactions on Mobile Computing
Cruising for vacant curbside parking spaces causes waste of time, frustration, waste of fuel, and pollution. This problem has been addressed by centralized solutions that perform parking assignments and communicate them to drivers’ smart phones. These solutions suffer, however, from two intrinsic problems: scalability, as the server has to perform intensive computation and communication with the drivers; and privacy, as the drivers have to disclose their destinations to the server. This article proposes DFPS, a distributed mobile system for free parking assignment. DFPS solves the scalability problem by using the drivers’ smart phones to cooperatively compute the parking assignments, and a centralized dispatcher to receive and distribute parking requests to the network of smart phones. The phones of the parked drivers in DFPS are structured in a K-D tree to serve parking requests in a distributed fashion. DFPS removes the computation from the dispatcher and substantially reduces its communication load. DFPS solves the privacy problem through an entropy-based cloaking technique that runs on drivers’ smart phones and conceals drivers’ destinations from the dispatcher. The evaluation demonstrates that DFPS is scalable and obtains better travel time than a centralized system, while protecting the privacy of drivers’ destinations.
4 February 2025 in IEEE Transactions on Dependable and Secure Computing
Web browsers are implicitly trusted to handle a large amount of private user information. One such piece of private information, a user's browsing history, is maintained by browsers and is used to provide a popular usability feature: Web links are rendered using different styles depending on whether the URLs they point to have been visited or not. Unfortunately, this feature can be abused by malicious webpages in order to extract users' browsing history. We present new browsing history sniffing attacks through two contention-based side channels which are new in this context: Last-level CPU cache contention, and GPU execution unit contention. The attacks are robust and can be executed successfully against the popular Chrome browser. Compared to prior work which uses the rendering performance as a side channel, our work achieves an attack rate increase of up to 30x. The new attacks are stealthier, because the side channels we use do not slow down the browser's rendering rate. In addition, we revisit the existing sniffing attacks based on the rendering performance side channel, and show how their attack rate can also be increased by a significant amount. Finally, we discuss the root cause of history sniffing attacks and point out solutions.