Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nick Mathewson

dblp:21/993 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 5

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
5 papers
Network security · 87% Systems and software security · 7% Cryptographic protocols and secure computation · 7%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Computer networks
2 papers
Internet architecture and protocols · 56% Routing and switching · 44%

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

TopicWeightPapersLastEvidence papers
Network security
anonymity networks
0.642020
Walking Onions: Scaling Anonymity Networks while Protecting Users · USENIX Security Symposium 2020
Trust-based anonymous communication: adversary models and routing algorithms · CCS 2011
Tor: The Second-Generation Onion Router · USENIX Security Symposium 2004
Network security › anonymity networks
onion routing
0.632020
Walking Onions: Scaling Anonymity Networks while Protecting Users · USENIX Security Symposium 2020
Trust-based anonymous communication: adversary models and routing algorithms · CCS 2011
Tor: The Second-Generation Onion Router · USENIX Security Symposium 2004
Network security › routing security
trust-based routing
0.112011
Trust-based anonymous communication: adversary models and routing algorithms · CCS 2011
Systems and software security › software supply chain security
software update security
0.112010
Survivable key compromise in software update systems · CCS 2010
Internet architecture and protocols
overlay networks
0.012004
Tor: The Second-Generation Onion Router · USENIX Security Symposium 2004
Network security › anonymity networks
mix networks
0.012003
Mixminion: Design of a Type III Anonymous Remailer Protocol · S&P 2003
Routing and switching › routing
secure routing
0.012011
Trust-based anonymous communication: adversary models and routing algorithms · CCS 2011

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

routing algorithm design · 0.2adversary modeling · 0.2onion routing · 0.1nymservers · 0.0link encryption · 0.0directory servers · 0.0
YearPublicationVenuePosition
2020 Walking Onions: Scaling Anonymity Networks while Protecting Users
Chelsea Komlo, Nick Mathewson, Ian Goldberg 0001
USENIX Security Symposium2
2011 Trust-based anonymous communication: adversary models and routing algorithms
abstract
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on anonymous communication, and in particular onion routing, although we expect the approach to apply more broadly.
Aaron Johnson 0001, Paul F. Syverson, Roger Dingledine, Nick Mathewson
CCS4
2010 Survivable key compromise in software update systems
abstract
Today's software update systems have little or no defense against key compromise. As a result, key compromises have put millions of software update clients at risk. Here we identify three classes of information whose authenticity and integrity are critical for secure software updates. Analyzing existing software update systems with our framework, we find their ability to communicate this information securely in the event of a key compromise to be weak or nonexistent. We also find that the security problems in current software update systems are compounded by inadequate trust revocation mechanisms. We identify core security principles that allow software update systems to survive key compromise. Using these ideas, we design and implement TUF, a software update framework that increases resilience to key compromise.
Justin Samuel, Nick Mathewson, Justin Cappos, Roger Dingledine
CCS2
2004 Tor: The Second-Generation Onion Router
Roger Dingledine, Nick Mathewson, Paul F. Syverson
USENIX Security Symposium2
2003 Mixminion: Design of a Type III Anonymous Remailer Protocol
abstract
We present Mixminion, a message-based anonymous remailer protocol with secure single-use reply blocks. Mix nodes cannot distinguish Mixminion forward messages from reply messages, so forward and reply messages share the same anonymity set. We add directory servers that allow users to learn public keys and performance statistics of participating remailers, and we describe nymservers that provide long-term pseudonyms using single-use reply blocks as a primitive. Our design integrates link encryption between remailers to provide forward anonymity. Mixminion works in a real-world Internet environment, requires little synchronization or coordination between nodes, and protects against known anonymity-breaking attacks as well as or better than other systems with similar design parameters.
George Danezis, Roger Dingledine, Nick Mathewson
S&P3