Earlier Research Programs
Secure Cloud Storage—PANCAKE
Designing efficient cloud storage systems that remain secure against powerful adversaries.
2017–2024
- Length leakage [Security'24a] in oblivious data access under passive persistent adversaries.
- Attacks against password managers [Security'24b].
- Attacks against encrypted cloud backups [Oakland'24].
- ShortStack [OSDI'22] for distributed, fault-tolerant, proxy design in oblivious data access.
- Pancake [Security'20] for efficient oblivious data access under passive persistent adversaries.
- Obladi [OSDI'18] for transactions on ORAM.
Recognition: Usenix Security ’20 distinguished paper award · Deployed in the real world
Queries on Compressed Data—Succinct
Storage systems that answer queries directly on compressed data, without ever decompressing it.
2014–2017
- Succinct [NSDI'15] for random access, substring search, and even regular expression matches directly on semi-structured data.
- BlowFish [NSDI'16b] that enables a smooth performance-storage tradeoff.
- ZipG [SIGMOD'17] for graph queries directly on compressed graphs.
Recognition: Deployed in the real world
Network Explicability—Anteater and PathDump
Making datacenter networks observable and debuggable from the data plane.
2011–2019
- Anteater [SIGCOMM'11], one of the first systems that proposed network debugging at the data plane.
- PathDump [OSDI'16b] for end-host based monitoring and debugging.
- SwitchPointer [NSDI'18] for enabling in-network visibility.
- Confluo [NSDI'19b] for efficient end-host stacks for low-overhead monitoring and debugging.
Recognition: Laid the foundation for research on network monitoring and debugging at the data plane · Deployed at scale
Graph Algorithms—Approximate Distance Oracles
New data structures and algorithms for fast approximate distance queries on graphs.
2010–2014
Recognition: First improvement over several classical decade-old theory results