Demo Data from EDBT 2026 / reviewers in the wild / expert
Naphat Sanguansin
dblp:205/2966
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2017
—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 |
Cryptographic primitives and cryptanalysis · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
pseudorandom generators |
0.3 | 1 | 2017 | Verified Correctness and Security of mbedTLS HMAC-DRBG · CCS 2017 |
Compilers and program optimization › compiler correctness
compositional compiler correctness |
0.3 | 1 | 2017 | Verified Correctness and Security of mbedTLS HMAC-DRBG · CCS 2017 |
Cryptographic primitives and cryptanalysis › cryptographic implementation
cryptographic implementation correctness |
0.1 | 1 | 2017 | Verified Correctness and Security of mbedTLS HMAC-DRBG · CCS 2017 |
Methods — techniques the papers use, named apart from their topics
hybrid game-based proof · 0.6coq proof assistant · 0.6c program verification · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Verified Correctness and Security of mbedTLS HMAC-DRBGabstractWe have formalized the functional specification of HMAC-DRBG (NIST 800-90A), and we have proved its cryptographic security-that its output is pseudorandom--using a hybrid game-based proof. We have also proved that the mbedTLS implementation (C program) correctly implements this functional specification. That proof composes with an existing C compiler correctness proof to guarantee, end-to-end, that the machine language program gives strong pseudorandomness. All proofs (hybrid games, C program verification, compiler, and their composition) are machine-checked in the Coq proof assistant. Our proofs are modular: the hybrid game proof holds on any implementation of HMAC-DRBG that satisfies our functional specification. Therefore, our functional specification can serve as a high-assurance reference. Katherine Q. Ye, Matthew Green 0001, Naphat Sanguansin, Lennart Beringer, Adam Petcher, Andrew W. Appel |
CCS | 3 |