Demo Data from EDBT 2026 / reviewers in the wild / expert
Charles Herder
dblp:149/7950
· DBLP profile ↗
2ranked-venue papers
2as 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 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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 primitives and cryptanalysis · 60% Hardware security and side channels · 40% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware security and side channels › hardware security primitives
physical unclonable function |
0.5 | 2 | 2017 | Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2017 Physical Unclonable Functions and Applications: A Tutorial · Proc. IEEE 2014 |
Cryptographic primitives and cryptanalysis › fuzzy extractor
computational fuzzy extractors |
0.3 | 1 | 2017 | Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2017 |
Cryptographic primitives and cryptanalysis
fuzzy extractor |
0.3 | 1 | 2017 | Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2017 |
Cryptographic primitives and cryptanalysis › coding theory
error-correcting codes |
0.1 | 1 | 2017 | Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable Functions · IEEE Trans. Dependable Secur. Comput. 2017 |
Cryptographic primitives and cryptanalysis
key generation |
0.1 | 1 | 2014 | Physical Unclonable Functions and Applications: A Tutorial · Proc. IEEE 2014 |
Methods — techniques the papers use, named apart from their topics
random oracle model · 0.3learning parity with noise · 0.3pattern matching · 0.2index-based coding · 0.2error correction · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Trapdoor Computational Fuzzy Extractors and Stateless Cryptographically-Secure Physical Unclonable FunctionsabstractWe present a fuzzy extractor whose security can be reduced to the hardness of Learning Parity with Noise (LPN) and can efficiently correct a constant fraction of errors in a biometric source with a “noise-avoiding trapdoor.” Using this computational fuzzy extractor, we present a stateless construction of a cryptographically-secure Physical Unclonable Function. Our construct requires no non-volatile (permanent) storage, secure or otherwise, and its computational security can be reduced to the hardness of an LPN variant under the random oracle model. The construction is “stateless,” because there is no information stored between subsequent queries, which mitigates attacks against the PUF via tampering. Moreover, our stateless construction corresponds to a PUF whose outputs are free of noise because of internal error-correcting capability, which enables a host of applications beyond authentication. We describe the construction, provide a proof of computational security, analysis of the security parameter for system parameter choices, and present experimental evidence that the construction is practical and reliable under a wide environmental range. Charles Herder, Ling Ren 0001, Marten van Dijk, Meng-Day (Mandel) Yu, Srini Devadas |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2014 | Physical Unclonable Functions and Applications: A TutorialabstractThis paper describes the use of physical unclonable functions (PUFs) in low-cost authentication and key generation applications. First, it motivates the use of PUFs versus conventional secure nonvolatile memories and defines the two primary PUF types: “strong PUFs” and “weak PUFs.” It describes strong PUF implementations and their use for low-cost authentication. After this description, the paper covers both attacks and protocols to address errors. Next, the paper covers weak PUF implementations and their use in key generation applications. It covers error-correction schemes such as pattern matching and index-based coding. Finally, this paper reviews several emerging concepts in PUF technologies such as public model PUFs and new PUF implementation technologies. Charles Herder, Meng-Day (Mandel) Yu, Farinaz Koushanfar, Srini Devadas |
Proc. IEEE | 1 |