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

Katherine Q. Ye

dblp:167/0489 · DBLP profile ↗
← Back
2ranked-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 · 2 · 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 primitives and cryptanalysis · 100%
Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 82% Program verification · 18%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
pseudorandom generators
0.312017
Verified Correctness and Security of mbedTLS HMAC-DRBG · CCS 2017
Compilers and program optimization › compiler correctness
compositional compiler correctness
0.312017
Verified Correctness and Security of mbedTLS HMAC-DRBG · CCS 2017
Cryptographic primitives and cryptanalysis › message authentication codes
HMAC
0.212015
Verified Correctness and Security of OpenSSL HMAC · USENIX Security Symposium 2015
Cryptographic primitives and cryptanalysis › cryptographic implementation
cryptographic implementation correctness
0.112017
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.6proof assistant · 0.4formal verification · 0.4
YearPublicationVenuePosition
2017 Verified Correctness and Security of mbedTLS HMAC-DRBG
abstract
We 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
CCS1
2015 Verified Correctness and Security of OpenSSL HMAC
Lennart Beringer, Adam Petcher, Katherine Q. Ye, Andrew W. Appel
USENIX Security Symposium3