Demo Data from SIGIR 2026 / reviewers in the wild / expert
Masoud Akhoondi
dblp:58/4664
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-authorComputer networks · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
2 papers |
Network security · 100% | |
| Computer networks
2 papers |
Routing and switching · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network security
anonymity networks |
0.3 | 2 | 2014 | LASTor: A Low-Latency AS-Aware Tor Client · IEEE/ACM Trans. Netw. 2014 LASTor: A Low-Latency AS-Aware Tor Client · IEEE Symposium on Security and Privacy 2012 |
Network security › anonymity networks
latency-anonymity tradeoff |
0.3 | 2 | 2014 | LASTor: A Low-Latency AS-Aware Tor Client · IEEE/ACM Trans. Netw. 2014 LASTor: A Low-Latency AS-Aware Tor Client · IEEE Symposium on Security and Privacy 2012 |
Network security › anonymity networks
tor |
0.2 | 1 | 2014 | LASTor: A Low-Latency AS-Aware Tor Client · IEEE/ACM Trans. Netw. 2014 |
Network security › anonymity networks
tor path selection |
0.1 | 1 | 2012 | LASTor: A Low-Latency AS-Aware Tor Client · IEEE Symposium on Security and Privacy 2012 |
Routing and switching
path selection |
0.1 | 1 | 2014 | LASTor: A Low-Latency AS-Aware Tor Client · IEEE/ACM Trans. Netw. 2014 |
Routing and switching › inter-domain routing
AS path inference |
0.0 | 1 | 2012 | LASTor: A Low-Latency AS-Aware Tor Client · IEEE Symposium on Security and Privacy 2012 |
Methods — techniques the papers use, named apart from their topics
path selection algorithm · 0.7traffic correlation analysis · 0.4measurement · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Resource Efficient Privacy Preservation of Online Social Media Conversations
Indrajeet Singh, Masoud Akhoondi, Mustafa Y. Arslan, Harsha V. Madhyastha, Srikanth V. Krishnamurthy |
SecureComm | 2 |
| 2014 | LASTor: A Low-Latency AS-Aware Tor ClientabstractThough the widely used Tor anonymity network is designed to enable low-latency anonymous communication, interactive communications on Tor incur latencies over 5 × greater than on the direct Internet path, and in many cases, autonomous systems (ASs) can compromise anonymity via correlations of network traffic. In this paper, we develop LASTor, a new Tor client that addresses these shortcomings in Tor with only client-side modifications. First, LASTor improves communication latencies by accounting for the inferred locations of Tor relays while choosing paths. Since the preference for shorter paths reduces the entropy of path selection, we design LASTor so that a user can choose an appropriate tradeoff between latency and anonymity. Second, we develop an efficient and accurate algorithm to identify paths on which an AS can compromise anonymity by traffic correlation. LASTor avoids such paths to improve a user's anonymity, and the low runtime of the algorithm ensures that the impact on end-to-end communication latencies is low. Our results show that, in comparison to the default Tor client, LASTor reduces median latencies by 25% while also reducing the false negative rate of not detecting a potential snooping AS from 57% to 11%. Masoud Akhoondi, Curtis Yu, Harsha V. Madhyastha |
IEEE/ACM Trans. Netw. | 1 |
| 2012 | LASTor: A Low-Latency AS-Aware Tor ClientabstractThe widely used Tor anonymity network is designed to enable low-latency anonymous communication. However, in practice, interactive communication on Tor-which accounts for over 90% of connections in the Tor network [1]-incurs latencies over 5x greater than on the direct Internet path. In addition, since path selection to establish a circuit in Tor is oblivious to Internet routing, anonymity guarantees can breakdown in cases where an autonomous system (AS) can correlate traffic across the entry and exit segments of a circuit. In this paper, we show that both of these shortcomings in Tor can be addressed with only client-side modifications, i.e., without requiring a revamp of the entire Tor architecture. To this end, we design and implement a new Tor client, LASTor. First, we show that LASTor can deliver significant latency gains over the default Tor client by simply accounting for the inferred locations of Tor relays while choosing paths. Second, since the preference for low latency paths reduces the entropy of path selection, we design LASTor's path selection algorithm to be tunable. A user can choose an appropriate tradeoff between latency and anonymity by specifying a value between 0 (lowest latency) and 1 (highest anonymity) for a single parameter. Lastly, we develop an efficient and accurate algorithm to identify paths on which an AS can correlate traffic between the entry and exit segments. This algorithm enables LASTor to avoid such paths and improve a user's anonymity, while the low runtime of the algorithm ensures that the impact on end-to-end latency of communication is low. By applying our techniques to measurements of real Internet paths and by using LASTor to visit the top 200 websites from several geographically-distributed end-hosts, we show that, in comparison to the default Tor client, LASTor reduces median latencies by 25% while also reducing the false negative rate of not detecting a potential snooping AS from 57% to 11%. Masoud Akhoondi, Curtis Yu, Harsha V. Madhyastha |
IEEE Symposium on Security and Privacy | 1 |