Jelle van den Hooff

dblp:153/5808 · DBLP profile ↗
← Back
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

Software engineering, systems software and programming languages · 2 · 1 first-authorSecurity and privacy · 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 · 39% Cryptographic protocols and secure computation · 36% Privacy and data protection · 20%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security
anonymity networks
0.212015
Vuvuzela: scalable private messaging resistant to traffic analysis · SOSP 2015
Privacy and data protection › communication privacy › network privacy
metadata privacy
0.212015
Vuvuzela: scalable private messaging resistant to traffic analysis · SOSP 2015
Cryptographic protocols and secure computation
secure messaging
0.212015
Vuvuzela: scalable private messaging resistant to traffic analysis · SOSP 2015
Network security › anonymity networks
traffic analysis resistance
0.212015
Vuvuzela: scalable private messaging resistant to traffic analysis · SOSP 2015
Cryptographic protocols and secure computation
verifiable computation
0.212014
VerSum: Verifiable Computations over Large Public Logs · CCS 2014
Distributed systems › distributed coordination
conflict resolution
0.212014
VerSum: Verifiable Computations over Large Public Logs · CCS 2014
Distributed systems
distributed coordination and fault tolerance
0.212014
VerSum: Verifiable Computations over Large Public Logs · CCS 2014
Blockchain and cryptocurrency security › blockchain data management
blockchain-based data integrity
0.112014
VerSum: Verifiable Computations over Large Public Logs · CCS 2014

Methods — techniques the papers use, named apart from their topics

multi-server replication · 0.4cryptographic protocol design · 0.2conflict-resolution protocol · 0.2conflict resolution protocol · 0.2
YearPublicationVenuePosition
2015 Amber: Decoupling User Data from Web Applications
Tej Chajed, Jon Gjengset, Jelle van den Hooff, M. Frans Kaashoek, James W. Mickens, Robert Morris 0005, Nickolai Zeldovich
HotOS3
2015 Vuvuzela: scalable private messaging resistant to traffic analysis
abstract
Private messaging over the Internet has proven challenging to implement, because even if message data is encrypted, it is difficult to hide metadata about who is communicating in the face of traffic analysis. Systems that offer strong privacy guarantees, such as Dissent [36], scale to only several thousand clients, because they use techniques with superlinear cost in the number of clients (e.g., each client broadcasts their message to all other clients). On the other hand, scalable systems, such as Tor, do not protect against traffic analysis, making them ineffective in an era of pervasive network monitoring.
Jelle van den Hooff, David Lazar, Matei Zaharia, Nickolai Zeldovich
SOSP1
2014 VerSum: Verifiable Computations over Large Public Logs
abstract
VerSum allows lightweight clients to outsource expensive computations over large and frequently changing data structures, such as the Bitcoin or Namecoin blockchains, or a Certificate Transparency log. VerSum clients ensure that the output is correct by comparing the outputs from multiple servers. VerSum assumes that at least one server is honest, and crucially, when servers disagree, VerSum uses an efficient conflict resolution protocol to determine which server(s) made a mistake and thus obtain the correct output.
Jelle van den Hooff, M. Frans Kaashoek, Nickolai Zeldovich
CCS1