Demo Data from SIGIR 2026 / reviewers in the wild / expert
Yu Long Chen
dblp:206/7442
· DBLP profile ↗
14ranked-venue papers
9as first author
12since 2021 · last 2026
0000-0002-6281-6430ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 13 · 8 first-author · 11 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
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
11 papers |
Cryptographic primitives and cryptanalysis · 97% Cryptographic protocols and secure computation · 3% |
Topics — the 19 heaviest of 19, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
provable security |
3.1 | 6 | 2023 | Improved Multi-user Security Using the Squared-Ratio Method · CRYPTO (2) 2023 Provably Secure Reflection Ciphers · CRYPTO (4) 2022 A Modular Approach to the Security Analysis of Two-Permutation Constructions · ASIACRYPT (1) 2022 |
Cryptographic primitives and cryptanalysis › provable security
multi-user security |
1.2 | 2 | 2023 | Improved Multi-user Security Using the Squared-Ratio Method · CRYPTO (2) 2023 Systematic Security Analysis of Stream Encryption With Key Erasure · IEEE Trans. Inf. Theory 2021 |
Cryptographic primitives and cryptanalysis
block cipher |
1.1 | 2 | 2022 | Provably Secure Reflection Ciphers · CRYPTO (4) 2022 A Modular Approach to the Security Analysis of Two-Permutation Constructions · ASIACRYPT (1) 2022 |
Cryptographic primitives and cryptanalysis
authenticated encryption |
0.9 | 1 | 2025 | Towards Optimally Secure Deterministic Authenticated Encryption Schemes · EUROCRYPT (1) 2025 |
Cryptographic primitives and cryptanalysis › block cipher
block cipher modes |
0.9 | 1 | 2025 | Beyond-Birthday-Bound Security with HCTR2: Cascaded Construction and Tweak-Based Key Derivation · ASIACRYPT (1) 2025 |
Cryptographic primitives and cryptanalysis › key generation
key derivation |
0.9 | 1 | 2025 | Beyond-Birthday-Bound Security with HCTR2: Cascaded Construction and Tweak-Based Key Derivation · ASIACRYPT (1) 2025 |
Cryptographic primitives and cryptanalysis › block cipher
tweakable block cipher |
0.9 | 1 | 2025 | Beyond-Birthday-Bound Security with HCTR2: Cascaded Construction and Tweak-Based Key Derivation · ASIACRYPT (1) 2025 |
Cryptographic primitives and cryptanalysis
information-theoretic security |
0.8 | 1 | 2024 | Information-Theoretic Security with Asymmetries · CRYPTO (4) 2024 |
Cryptographic primitives and cryptanalysis
security analysis |
0.6 | 1 | 2022 | A Modular Approach to the Security Analysis of Two-Permutation Constructions · ASIACRYPT (1) 2022 |
Cryptographic primitives and cryptanalysis
message authentication codes |
0.5 | 1 | 2021 | Categorization of Faulty Nonce Misuse Resistant Message Authentication · ASIACRYPT (3) 2021 |
Cryptographic primitives and cryptanalysis › authenticated encryption
nonce-misuse resistance |
0.5 | 1 | 2021 | Categorization of Faulty Nonce Misuse Resistant Message Authentication · ASIACRYPT (3) 2021 |
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation |
0.5 | 1 | 2021 | Better Security-Efficiency Trade-Offs in Permutation-Based Two-Party Computation · ASIACRYPT (2) 2021 |
Cryptographic primitives and cryptanalysis › provable security
security notions |
0.5 | 1 | 2021 | Categorization of Faulty Nonce Misuse Resistant Message Authentication · ASIACRYPT (3) 2021 |
Cryptographic primitives and cryptanalysis
stream cipher |
0.5 | 1 | 2021 | Systematic Security Analysis of Stream Encryption With Key Erasure · IEEE Trans. Inf. Theory 2021 |
Cryptographic primitives and cryptanalysis
pseudorandom functions |
0.4 | 1 | 2019 | How to Build Pseudorandom Functions from Public Random Permutations · CRYPTO (1) 2019 |
Cryptographic primitives and cryptanalysis
pseudorandom generators |
0.4 | 1 | 2019 | How to Build Pseudorandom Functions from Public Random Permutations · CRYPTO (1) 2019 |
Cryptographic primitives and cryptanalysis › provable security
beyond-birthday-bound security |
0.3 | 1 | 2018 | Short Variable Length Domain Extenders with Beyond Birthday Bound Security · ASIACRYPT (1) 2018 |
Cryptographic primitives and cryptanalysis › hash functions › hash function constructions
domain extender |
0.3 | 1 | 2018 | Short Variable Length Domain Extenders with Beyond Birthday Bound Security · ASIACRYPT (1) 2018 |
Cryptographic primitives and cryptanalysis
hash functions |
0.3 | 1 | 2018 | Short Variable Length Domain Extenders with Beyond Birthday Bound Security · ASIACRYPT (1) 2018 |
Methods — techniques the papers use, named apart from their topics
cascaded construction · 0.9beyond-birthday-bound security · 0.9information theory · 0.8squared-ratio method · 0.7provable security · 0.6modular proof · 0.6indistinguishability · 0.6sum of permutations · 0.5pseudorandom function · 0.5block cipher · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | A Robust Variant of ChaCha20-Poly1305
Tim Beyne, Yu Long Chen, Michiel Verbauwhede |
CRYPTO (6) | 2 |
| 2026 | Key Committing Security of HCTR2, Revisited
Donghoon Chang, Yu Long Chen, Yukihito Hiraga, Kazuhiko Minematsu, Nicky Mouha, Yusuke Naito 0001, Yu Sasaki 0001, Takeshi Sugawara 0001 |
CRYPTO (6) | 2 |
| 2025 | Beyond-Birthday-Bound Security with HCTR2: Cascaded Construction and Tweak-Based Key Derivation
Yu Long Chen, Yukihito Hiraga, Nicky Mouha, Yusuke Naito 0001, Yu Sasaki 0001, Takeshi Sugawara 0001 |
ASIACRYPT (1) | 1 |
| 2025 | Towards Optimally Secure Deterministic Authenticated Encryption Schemes
Yu Long Chen, Avijit Dutta, Ashwin Jha 0001, Mridul Nandi |
EUROCRYPT (1) | 1 |
| 2024 | Information-Theoretic Security with Asymmetries
Tim Beyne, Yu Long Chen |
CRYPTO (4) | 2 |
| 2023 | Improved Multi-user Security Using the Squared-Ratio Method
Yu Long Chen, Wonseok Choi 0002, Changmin Lee 0001 |
CRYPTO (2) | 1 |
| 2022 | A Modular Approach to the Security Analysis of Two-Permutation Constructions
Yu Long Chen |
ASIACRYPT (1) | 1 |
| 2022 | Provably Secure Reflection Ciphers
Tim Beyne, Yu Long Chen |
CRYPTO (4) | 2 |
| 2021 | Categorization of Faulty Nonce Misuse Resistant Message Authentication
Yu Long Chen, Bart Mennink, Bart Preneel |
ASIACRYPT (3) | 1 |
| 2021 | Better Security-Efficiency Trade-Offs in Permutation-Based Two-Party Computation
Yu Long Chen, Stefano Tessaro |
ASIACRYPT (2) | 1 |
| 2021 | Multi-user Security of the Elephant v2 Authenticated Encryption Mode
Tim Beyne, Yu Long Chen, Christoph Dobraunig, Bart Mennink |
SAC | 2 |
| 2021 | Systematic Security Analysis of Stream Encryption With Key ErasureabstractWe consider a generalized construction of stream ciphers with forward security. The design framework is modular: it is built from a so-called layer function that updates the key and (optionally) the nonce and generates a new pseudorandom output stream. We analyze the generalized construction for four different instantiations: two possible layer functions that are in turn instantiated with either a block cipher or a pseudorandom function. We prove that each of these instantiations gives a stream cipher that is pseudorandom and forward secure in the multi-user setting with a very tight bound. A comprehensive analysis shows that the two block cipher based instantiations achieve very similar bounds. For the pseudorandom function based instantiations there is no clear winner: either layer can be beneficial over the other one, depending on the choice of parameters. By instantiating the pseudorandom function with a generic construction such as the sum of permutations, we obtain a highly efficient and competitive stream cipher based on an n-bit block cipher that is secure beyond the$2^{\text {n}/2}$birthday bound. Yu Long Chen, Atul Luykx, Bart Mennink, Bart Preneel |
IEEE Trans. Inf. Theory | 1 |
| 2019 | How to Build Pseudorandom Functions from Public Random Permutations
Yu Long Chen, Eran Lambooij, Bart Mennink |
CRYPTO (1) | 1 |
| 2018 | Short Variable Length Domain Extenders with Beyond Birthday Bound Security
Yu Long Chen, Bart Mennink, Mridul Nandi |
ASIACRYPT (1) | 1 |