Demo Data from VLDB 2026 / reviewers in the wild / expert
Hao-Chi Wong
dblp:15/1980
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1
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
1 paper |
Authentication and access control · 54% Cryptographic primitives and cryptanalysis · 46% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Authentication and access control › authentication
authentication protocols |
0.0 | 1 | 2003 | Secret Handshakes from Pairing-Based Key Agreements · S&P 2003 |
Cryptographic primitives and cryptanalysis › pairing-based cryptography
bilinear diffie-hellman |
0.0 | 1 | 2003 | Secret Handshakes from Pairing-Based Key Agreements · S&P 2003 |
Cryptographic primitives and cryptanalysis
pairing-based cryptography |
0.0 | 1 | 2003 | Secret Handshakes from Pairing-Based Key Agreements · S&P 2003 |
Authentication and access control › authentication
secret handshake |
0.0 | 1 | 2003 | Secret Handshakes from Pairing-Based Key Agreements · S&P 2003 |
Methods — techniques the papers use, named apart from their topics
pairing-based key agreement · 0.0TLS cipher suite · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Secret Handshakes from Pairing-Based Key AgreementsabstractConsider a CIA agent who wants to authenticate herself to a server but does not want to reveal her CIA credentials unless the server is a genuine CIA outlet. Consider also that the CIA server does not want to reveal its CIA credentials to anyone but CIA agents - not even to other CIA servers. We first show how pairing-based cryptography can be used to implement such secret handshakes. We then propose a formal definition for secure secret handshakes, and prove that our pairing-based schemes are secure under the Bilinear Diffie-Hellman assumption. Our protocols support role-based group membership authentication, traceability, indistinguishability to eavesdroppers, unbounded collusion resistance, and forward repudiability. Our secret-handshake scheme can be implemented as a TLS cipher suite. We report on the performance of our preliminary Java implementation. Dirk Balfanz, Glenn Durfee, Narendar Shankar, Diana K. Smetters, Jessica Staddon, Hao-Chi Wong |
S&P | 6 |