EDBT 2026 Demo / reviewers in the wild / expert
Daniel V. Bailey
dblp:70/4808
· DBLP profile ↗
10ranked-venue papers
5as first author
1since 2021 · last 2021
0009-0002-4749-6448ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 9 · 5 first-author · 1 since 2021Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 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
5 papers |
Authentication and access control · 54% Network security · 29% Cryptographic primitives and cryptanalysis · 11% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network security
blacklists |
0.4 | 1 | 2020 | This PIN Can Be Easily Guessed: Analyzing the Security of Smartphone Unlock PINs · SP 2020 |
Authentication and access control
knowledge-based authentication |
0.4 | 1 | 2020 | This PIN Can Be Easily Guessed: Analyzing the Security of Smartphone Unlock PINs · SP 2020 |
Authentication and access control
password guessing |
0.4 | 1 | 2020 | This PIN Can Be Easily Guessed: Analyzing the Security of Smartphone Unlock PINs · SP 2020 |
Privacy and data protection
anonymity |
0.1 | 1 | 2007 | Covert channels in privacy-preserving identification systems · CCS 2007 |
Network security
covert channel |
0.1 | 1 | 2007 | Covert channels in privacy-preserving identification systems · CCS 2007 |
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography |
0.1 | 2 | 2001 | Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography · J. Cryptol. 2001 Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms · CRYPTO 1998 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.1 | 2 | 2001 | NTRU in Constrained Devices · CHES 2001 Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms · CRYPTO 1998 |
Cryptographic primitives and cryptanalysis
finite field arithmetic |
0.0 | 1 | 2001 | Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography · J. Cryptol. 2001 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography |
0.0 | 1 | 2001 | NTRU in Constrained Devices · CHES 2001 |
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
NTRU |
0.0 | 1 | 2001 | NTRU in Constrained Devices · CHES 2001 |
Privacy and data protection › privacy-preserving computation › privacy-preserving identity management
privacy-preserving identification |
0.0 | 1 | 2007 | Covert channels in privacy-preserving identification systems · CCS 2007 |
Embedded and real-time systems › resource-constrained systems
resource-constrained devices |
0.0 | 1 | 2001 | NTRU in Constrained Devices · CHES 2001 |
Methods — techniques the papers use, named apart from their topics
user study · 0.4guessing attack · 0.4covert-channel-free checkability · 0.1optimal extension fields · 0.0finite field arithmetic · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | On the Security of Smartphone Unlock PINsabstractIn this article, we provide the first comprehensive study of user-chosen four- and six-digit PINs ( n =1705) collected on smartphones with participants being explicitly primed for device unlocking. We find that against a throttled attacker (with 10, 30, or 100 guesses, matching the smartphone unlock setting), using six-digit PINs instead of four-digit PINs provides little to no increase in security and surprisingly may even decrease security. We also study the effects of blocklists, where a set of “easy to guess” PINs is disallowed during selection. Two such blocklists are in use today by iOS, for four digits (274 PINs) as well as six digits (2,910 PINs). We extracted both blocklists and compared them with six other blocklists, three for each PIN length. In each case, we had a small (four-digit: 27 PINs; six-digit: 29 PINs), a large (four-digit: 2,740 PINs; six-digit: 291,000 PINs), and a placebo blocklist that always excluded the first-choice PIN. For four-digit PINs, we find that the relatively small blocklist in use today by iOS offers little to no benefit against a throttled guessing attack. Security gains are only observed when the blocklist is much larger. In the six-digit case, we were able to reach a similar security level with a smaller blocklist. As the user frustration increases with the blocklists size, developers should employ a blocklist that is as small as possible while ensuring the desired security. Based on our analysis, we recommend that for four-digit PINs a blocklist should contain the 1,000 most popular PINs to provide the best balance between usability and security and for six-digit PINs the 2,000 most popular PINs should be blocked. Philipp Markert, Daniel V. Bailey, Maximilian Golla, Markus Dürmuth, Adam J. Aviv |
ACM Trans. Priv. Secur. | 2 |
| 2020 | This PIN Can Be Easily Guessed: Analyzing the Security of Smartphone Unlock PINsabstractWe provide the first comprehensive study of user-chosen 4- and 6-digit PINs (n = 1220) collected on smartphones with participants being explicitly primed for device unlocking. We find that against a throttled attacker (with 10, 30, or 100 guesses, matching the smartphone unlock setting), using 6-digit PINs instead of 4-digit PINs provides little to no increase in security, and surprisingly may even decrease security. We also study the effects of blacklists, where a set of "easy to guess" PINs is disallowed during selection. Two such blacklists are in use today by iOS, for 4-digits (274 PINs) as well as 6-digits (2910 PINs). We extracted both blacklists compared them with four other blacklists, including a small 4-digit (27 PINs), a large 4-digit (2740 PINs), and two placebo blacklists for 4- and 6-digit PINs that always excluded the first-choice PIN. We find that relatively small blacklists in use today by iOS offer little or no benefit against a throttled guessing attack. Security gains are only observed when the blacklists are much larger, which in turn comes at the cost of increased user frustration. Our analysis suggests that a blacklist at about 10 % of the PIN space may provide the best balance between usability and security. Philipp Markert, Daniel V. Bailey, Maximilian Golla, Markus Dürmuth, Adam J. Aviv |
SP | 2 |
| 2017 | "I want my money back!" Limiting Online Password-Guessing Financially
Maximilian Golla, Daniel V. Bailey, Markus Dürmuth |
SOUPS | 2 |
| 2010 | Breaking Elliptic Curve Cryptosystems Using Reconfigurable HardwareabstractThis paper reports a new speed record for FPGAs in cracking Elliptic Curve Cryptosystems. We conduct a detailed analysis of different F2(m)multiplication approaches in this application. A novel architecture using optimized normal basis multipliers is proposed to solve the Certicom challenge ECC2K-130. We compare the FPGA performance against CPUs, GPUs, and the Sony PlayStation 3. Our implementations show low-cost FPGAs outperform even multicore desktop processors and graphics cards by a factor of 2. Junfeng Fan, Daniel V. Bailey, Lejla Batina, Tim Güneysu, Christof Paar, Ingrid Verbauwhede |
FPL | 2 |
| 2009 | One-touch Financial Transaction Authentication
Daniel V. Bailey, John G. Brainard, Sebastian Rohde, Christof Paar |
SECRYPT | 1 |
| 2007 | Covert channels in privacy-preserving identification systemsabstractWe examine covert channels in privacy-enhanced mobile identification devices where the devices uniquely identify themselves to an authorized verifier. Such devices (e.g. RFID tags) are increasingly commonplace in hospitals and many other environments. For privacy, the device outputs used for identification should "appear random" to any entity other than the verifier, and should not allow physical tracking of device bearers. Worryingly, there already exist privacy breaches for some devices [28] that allow adversaries to physically track users. Ideally, such devices should allow anyone to publicly determine that the device outputs are covert-channel free (CCF); we say that such devices are CCF-checkable. Daniel V. Bailey, Dan Boneh, Eu-Jin Goh, Ari Juels |
CCS | 1 |
| 2001 | NTRU in Constrained Devices
Daniel V. Bailey, Daniel Coffin, Adam J. Elbirt, Joseph H. Silverman, Adam D. Woodbury |
CHES | 1 |
| 2001 | Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography
Daniel V. Bailey, Christof Paar |
J. Cryptol. | 1 |
| 2000 | Elliptic Curve Cryptography on Smart Cards without Coprocessors
Adam D. Woodbury, Daniel V. Bailey, Christof Paar |
CARDIS | 2 |
| 1998 | Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms
Daniel V. Bailey, Christof Paar |
CRYPTO | 1 |