EDBT 2026 Demo / reviewers in the wild / expert
Andrea Bittau
dblp:70/1811
· DBLP profile ↗
8ranked-venue papers
5as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 4 · 3 first-authorSoftware engineering, systems software and programming languages · 3 · 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
6 papers |
Systems and software security · 56% Network security · 16% Privacy and data protection · 16% | |
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Storage systems · 74% Distributed systems · 20% Cloud and datacenter computing · 6% | |
| Software engineering, system software, and programming languages
2 papers |
Operating systems · 100% |
Topics — the 18 heaviest of 22, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
privacy-preserving data analysis |
0.3 | 1 | 2017 | Prochlo: Strong Privacy for Analytics in the Crowd · SOSP 2017 |
Systems and software security › memory safety
control-flow integrity |
0.2 | 1 | 2015 | CCFI: Cryptographically Enforced Control Flow Integrity · CCS 2015 |
Authentication and access control › access control › access control mechanisms
cryptographic enforcement |
0.2 | 1 | 2015 | CCFI: Cryptographically Enforced Control Flow Integrity · CCS 2015 |
Systems and software security › memory safety
buffer overflow |
0.2 | 1 | 2014 | Hacking Blind · IEEE Symposium on Security and Privacy 2014 |
Systems and software security
exploitation |
0.2 | 1 | 2014 | Hacking Blind · IEEE Symposium on Security and Privacy 2014 |
Systems and software security › exploitation › code reuse attack
return-oriented programming |
0.2 | 1 | 2014 | Hacking Blind · IEEE Symposium on Security and Privacy 2014 |
Storage systems › file systems
distributed file system |
0.2 | 1 | 2013 | Replication, history, and grafting in the Ori file system · SOSP 2013 |
Storage systems › file systems › distributed file system
file replication |
0.2 | 1 | 2013 | Replication, history, and grafting in the Ori file system · SOSP 2013 |
Storage systems
file systems |
0.2 | 1 | 2013 | Replication, history, and grafting in the Ori file system · SOSP 2013 |
Systems and software security
operating system security |
0.1 | 1 | 2008 | Wedge: Splitting Applications into Reduced-Privilege Compartments · NSDI 2008 |
Systems and software security › operating system security
privilege separation |
0.1 | 1 | 2008 | Wedge: Splitting Applications into Reduced-Privilege Compartments · NSDI 2008 |
Network security › wireless network security
WEP |
0.1 | 1 | 2006 | The Final Nail in WEP's Coffin · S&P 2006 |
Network security
wireless network security |
0.1 | 1 | 2006 | The Final Nail in WEP's Coffin · S&P 2006 |
Systems and software security › memory safety
address space layout randomization |
0.1 | 1 | 2014 | Hacking Blind · IEEE Symposium on Security and Privacy 2014 |
Distributed systems
peer-to-peer systems |
0.0 | 1 | 2013 | Replication, history, and grafting in the Ori file system · SOSP 2013 |
Cloud and datacenter computing
virtualization |
0.0 | 1 | 2012 | Dune: Safe User-level Access to Privileged CPU Features · OSDI 2012 |
Operating systems › system security › operating system security › protection mechanism › isolation
process isolation |
0.0 | 1 | 2008 | Wedge: Splitting Applications into Reduced-Privilege Compartments · NSDI 2008 |
Wireless networking › WLAN
IEEE 802.11 |
0.0 | 1 | 2006 | The Final Nail in WEP's Coffin · S&P 2006 |
Methods — techniques the papers use, named apart from their topics
shuffling · 0.6encoding · 0.6ubiquitous encryption · 0.2message authentication code · 0.2blind ROP · 0.2opportunistic synchronization · 0.2grafting · 0.2application compartmentalization · 0.2real-time decryption · 0.1cryptanalysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Prochlo: Strong Privacy for Analytics in the CrowdabstractThe large-scale monitoring of computer users' software activities has become commonplace, e.g., for application telemetry, error reporting, or demographic profiling. This paper describes a principled systems architecture---Encode, Shuffle, Analyze (ESA)---for performing such monitoring with high utility while also protecting user privacy. The ESA design, and its Prochlo implementation, are informed by our practical experiences with an existing, large deployment of privacy-preserving software monitoring. Andrea Bittau, Úlfar Erlingsson, Petros Maniatis, Ilya Mironov, Ananth Raghunathan, David Lie, Mitch Rudominer, Ushasree Kode, Julien Tinnés, Bernhard Seefeld |
SOSP | 1 |
| 2015 | CCFI: Cryptographically Enforced Control Flow IntegrityabstractControl flow integrity (CFI) restricts jumps and branches within a program to prevent attackers from executing arbitrary code in vulnerable programs. However, traditional CFI still offers attackers too much freedom to chose between valid jump targets, as seen in recent attacks. Ali José Mashtizadeh, Andrea Bittau, Dan Boneh, David Mazières |
CCS | 2 |
| 2014 | Hacking BlindabstractWe show that it is possible to write remote stack buffer overflow exploits without possessing a copy of the target binary or source code, against services that restart after a crash. This makes it possible to hack proprietary closed-binary services, or open-source servers manually compiled and installed from source where the binary remains unknown to the attacker. Traditional techniques are usually paired against a particular binary and distribution where the hacker knows the location of useful gadgets for Return Oriented Programming (ROP). Our Blind ROP (BROP) attack instead remotely finds enough ROP gadgets to perform a write system call and transfers the vulnerable binary over the network, after which an exploit can be completed using known techniques. This is accomplished by leaking a single bit of information based on whether a process crashed or not when given a particular input string. BROP requires a stack vulnerability and a service that restarts after a crash. We implemented Braille, a fully automated exploit that yielded a shell in under 4,000 requests (20 minutes) against a contemporary nginx vulnerability, yaSSL + MySQL, and a toy proprietary server written by a colleague. The attack works against modern 64-bit Linux with address space layout randomization (ASLR), no-execute page protection (NX) and stack canaries. Andrea Bittau, Adam Belay, Ali José Mashtizadeh, David Mazières, Dan Boneh |
IEEE Symposium on Security and Privacy | 1 |
| 2013 | Replication, history, and grafting in the Ori file systemabstractOri is a file system that manages user data in a modern setting where users have multiple devices and wish to access files everywhere, synchronize data, recover from disk failure, access old versions, and share data. The key to satisfying these needs is keeping and replicating file system history across devices, which is now practical as storage space has outpaced both wide-area network (WAN) bandwidth and the size of managed data. Replication provides access to files from multiple devices. History provides synchronization and offline access. Replication and history together subsume backup by providing snapshots and avoiding any single point of failure. In fact, Ori is fully peer-to-peer, offering opportunistic synchronization between user devices in close proximity and ensuring that the file system is usable so long as a single replica remains. Cross-file system data sharing with history is provided by a new mechanism called grafting. An evaluation shows that as a local file system, Ori has low overhead compared to a File system in User Space (FUSE) loopback driver; as a network file system, Ori over a WAN outperforms NFS over a LAN. Ali José Mashtizadeh, Andrea Bittau, Yifeng Frank Huang, David Mazières |
SOSP | 2 |
| 2012 | Dune: Safe User-level Access to Privileged CPU Features
Adam Belay, Andrea Bittau, Ali José Mashtizadeh, David Terei, David Mazières, Christoforos E. Kozyrakis |
OSDI | 2 |
| 2010 | The Case for Ubiquitous Transport-Level Encryption
Andrea Bittau, Michael Hamburg, Mark Handley, David Mazières, Dan Boneh |
USENIX Security Symposium | 1 |
| 2008 | Wedge: Splitting Applications into Reduced-Privilege Compartments
Andrea Bittau, Petr Marchenko, Mark Handley, Brad Karp |
NSDI | 1 |
| 2006 | The Final Nail in WEP's CoffinabstractThe 802.11 encryption standard Wired Equivalent Privacy (WEP) is still widely used today despite the numerous discussions on its insecurity. In this paper, we present a novel vulnerability which allows an attacker to send arbitrary data on a WEP network after having eavesdropped a single data packet. Furthermore, we present techniques for real-time decryption of data packets, which may be used under common circumstances. Vendor produced mitigation techniques which cause frequent WEP re-keying prevent traditional attacks, whereas our attack remains effective even in such scenarios. We implemented a fully automatic version of this attack which demonstrates its practicality and feasibility in real networks. As even rapidly re-keyed networks can be quickly compromised, we believe WEP must now be abandoned rather than patched yet again. Andrea Bittau, Mark Handley, Joshua Lackey |
S&P | 1 |