Demo Data from VLDB 2026 / reviewers in the wild / expert
Victoria Lai
dblp:22/10817
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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.
| Computer networks
1 paper |
Routing and switching · 100% | |
| Network and information security
1 paper |
Network security · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching › routing
packet routing |
0.2 | 1 | 2015 | Alibi Routing · SIGCOMM 2015 |
Network security
traffic analysis |
0.1 | 1 | 2015 | Alibi Routing · SIGCOMM 2015 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Alibi RoutingabstractThere are several mechanisms by which users can gain insight into where their packets have gone, but no mechanisms allow users undeniable proof that their packets did not traverse certain parts of the world while on their way to or from another host. This paper introduces the problem of finding "proofs of avoidance": evidence that the paths taken by a packet and its response avoided a user-specified set of "forbidden" geographic regions. Proving that something did not happen is often intractable, but we demonstrate a low-overhead proof structure built around the idea of what we call "alibis": relays with particular timing constraints that, when upheld, would make it impossible to traverse both the relay and the forbidden regions. Dave Levin, Youndo Lee, Luke Valenta, Victoria Lai, Cristian Lumezanu, Neil Spring, Bobby Bhattacharjee |
SIGCOMM | 5 |