VLDB 2026 Research / reviewers in the wild / expert
Sam Scott
dblp:85/3326
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2Artificial intelligence and machine learning · 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 |
Cryptographic protocols and secure computation · 100% | |
| Artificial intelligence
1 paper |
Information extraction and text analysis · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › internet security protocols
TLS 1.3 |
0.5 | 2 | 2017 | A Comprehensive Symbolic Analysis of TLS 1.3 · CCS 2017 Automated Analysis and Verification of TLS 1.3: 0-RTT, Resumption and Delayed Authentication · IEEE Symposium on Security and Privacy 2016 |
Cryptographic protocols and secure computation
security protocol analysis |
0.3 | 1 | 2017 | A Comprehensive Symbolic Analysis of TLS 1.3 · CCS 2017 |
Cryptographic protocols and secure computation › security protocol analysis
symbolic verification |
0.3 | 1 | 2017 | A Comprehensive Symbolic Analysis of TLS 1.3 · CCS 2017 |
Cryptographic protocols and secure computation › key exchange
authenticated key exchange |
0.2 | 1 | 2016 | Automated Analysis and Verification of TLS 1.3: 0-RTT, Resumption and Delayed Authentication · IEEE Symposium on Security and Privacy 2016 |
Cryptographic protocols and secure computation
protocol verification |
0.2 | 1 | 2016 | Automated Analysis and Verification of TLS 1.3: 0-RTT, Resumption and Delayed Authentication · IEEE Symposium on Security and Privacy 2016 |
Natural language and speech › Information extraction and text analysis
feature engineering |
0.0 | 1 | 1999 | Feature Engineering for Text Classification · ICML 1999 |
Natural language and speech › Information extraction and text analysis
text classification |
0.0 | 1 | 1999 | Feature Engineering for Text Classification · ICML 1999 |
Methods — techniques the papers use, named apart from their topics
tamarin prover · 0.2feature engineering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | A Comprehensive Symbolic Analysis of TLS 1.3abstractThe TLS protocol is intended to enable secure end-to-end communication over insecure networks, including the Internet. Unfortunately, this goal has been thwarted a number of times throughout the protocol's tumultuous lifetime, resulting in the need for a new version of the protocol, namely TLS 1.3. Over the past three years, in an unprecedented joint design effort with the academic community, the TLS Working Group has been working tirelessly to enhance the security of TLS. Cas Cremers, Marko Horvat 0002, Jonathan Hoyland, Sam Scott, Thyla van der Merwe |
CCS | 4 |
| 2016 | Automated Analysis and Verification of TLS 1.3: 0-RTT, Resumption and Delayed AuthenticationabstractAfter a development process of many months, the TLS 1.3 specification is nearly complete. To prevent past mistakes, this crucial security protocol must be thoroughly scrutinised prior to deployment. In this work we model and analyse revision 10 of the TLS 1.3 specification using the Tamarin prover, a tool for the automated analysis of security protocols. We specify and analyse the interaction of various handshake modes for an unbounded number of concurrent TLS sessions. We show that revision 10 meets the goals of authenticated key exchange in both the unilateral and mutual authentication cases. We extend our model to incorporate the desired delayed client authentication mechanism, a feature that is likely to be included in the next revision of the specification, and uncover a potential attack in which an adversary is able to successfully impersonate a client during a PSK-resumption handshake. This observation was reported to, and confirmed by, the IETF TLS Working Group. Our work not only provides the first supporting evidence for the security of several complex protocol mode interactions in TLS 1.3, but also shows the strict necessity of recent suggestions to include more information in the protocol's signature contents. Cas Cremers, Marko Horvat 0002, Sam Scott, Thyla van der Merwe |
IEEE Symposium on Security and Privacy | 3 |
| 1999 | Feature Engineering for Text Classification
Sam Scott, Stan Matwin |
ICML | 1 |