VLDB 2026 Research / reviewers in the wild / expert
Yuanxi Dai
dblp:142/1685
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 3 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
3 papers |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
provable security |
0.7 | 3 | 2017 | Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient · CRYPTO (3) 2017 Indifferentiability of 8-Round Feistel Networks · CRYPTO (1) 2016 The Security of Multiple Encryption in the Ideal Cipher Model · CRYPTO (1) 2014 |
Cryptographic primitives and cryptanalysis › symmetric cryptography
symmetric-key cryptosystem |
0.7 | 3 | 2017 | Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient · CRYPTO (3) 2017 Indifferentiability of 8-Round Feistel Networks · CRYPTO (1) 2016 The Security of Multiple Encryption in the Ideal Cipher Model · CRYPTO (1) 2014 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models
indifferentiability |
0.5 | 2 | 2017 | Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient · CRYPTO (3) 2017 Indifferentiability of 8-Round Feistel Networks · CRYPTO (1) 2016 |
Cryptographic primitives and cryptanalysis › block cipher › key-alternating ciphers
even-mansour cipher |
0.3 | 1 | 2017 | Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient · CRYPTO (3) 2017 |
Cryptographic primitives and cryptanalysis
block cipher |
0.2 | 1 | 2016 | Indifferentiability of 8-Round Feistel Networks · CRYPTO (1) 2016 |
Cryptographic primitives and cryptanalysis › block cipher
feistel network |
0.2 | 1 | 2016 | Indifferentiability of 8-Round Feistel Networks · CRYPTO (1) 2016 |
Cryptographic primitives and cryptanalysis › cryptographic foundations › cryptographic models
ideal cipher model |
0.2 | 1 | 2014 | The Security of Multiple Encryption in the Ideal Cipher Model · CRYPTO (1) 2014 |
Methods — techniques the papers use, named apart from their topics
indifferentiability analysis · 0.5ideal cipher model analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient
Yuanxi Dai, Yannick Seurin, John P. Steinberger, Aishwarya Thiruvengadam |
CRYPTO (3) | 1 |
| 2016 | Indifferentiability of 8-Round Feistel Networks
Yuanxi Dai, John P. Steinberger |
CRYPTO (1) | 1 |
| 2014 | The Security of Multiple Encryption in the Ideal Cipher Model
Yuanxi Dai, Jooyoung Lee 0001, Bart Mennink, John P. Steinberger |
CRYPTO (1) | 1 |