EDBT 2026 Demo / reviewers in the wild / expert
Chun-Yuan Hsiao
dblp:81/4347
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 3 · 2 first-authorArtificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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
3 papers |
Cryptographic primitives and cryptanalysis · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › cryptographic randomness
computational entropy |
0.1 | 1 | 2007 | Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility · EUROCRYPT 2007 |
Cryptographic primitives and cryptanalysis › one-way functions
one-way permutations |
0.1 | 1 | 2006 | The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives · J. Cryptol. 2006 |
Cryptographic primitives and cryptanalysis › hash functions
collision-resistant hash functions |
0.0 | 1 | 2004 | Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? · CRYPTO 2004 |
Cryptographic primitives and cryptanalysis
hash function cryptanalysis |
0.0 | 1 | 2004 | Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? · CRYPTO 2004 |
Cryptographic primitives and cryptanalysis › hash functions
hash function design |
0.0 | 1 | 2004 | Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? · CRYPTO 2004 |
Computational complexity › cryptographic complexity
cryptographic hardness |
0.0 | 1 | 2006 | The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives · J. Cryptol. 2006 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Simple and robust watermarking scheme based on square-root-modulus technique
Chun-Yuan Hsiao, Ming-Feng Tsai, Ching-Yu Yang |
Multim. Tools Appl. | 1 |
| 2014 | A parallel and scalable CAST-based clustering algorithm on GPU
Kawuu W. Lin, Chun-Hung Lin, Chun-Yuan Hsiao |
Soft Comput. | 3 |
| 2007 | Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
Chun-Yuan Hsiao, Chi-Jen Lu, Leonid Reyzin |
EUROCRYPT | 1 |
| 2006 | The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu |
J. Cryptol. | 2 |
| 2004 | Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?
Chun-Yuan Hsiao, Leonid Reyzin |
CRYPTO | 1 |