Demo Data from EDBT 2026 / reviewers in the wild / expert
Yan-Cheng Chang
dblp:28/4722
· DBLP profile ↗
8ranked-venue papers
6as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 5 · 5 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1Theory of computation · 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 · 76% Cryptographic protocols and secure computation · 24% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › one-way functions
one-way permutations |
0.1 | 2 | 2006 | The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives · J. Cryptol. 2006 On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives · ASIACRYPT 2002 |
Cryptographic protocols and secure computation › secure multiparty computation › oblivious computation
oblivious polynomial evaluation |
0.0 | 1 | 2001 | Oblivious Polynomial Evaluation and Oblivious Neural Learning · ASIACRYPT 2001 |
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 |
|---|---|---|---|
| 2024 | How does escapism foster game experience and game use?
Tzu-Ling Huang, Jin-Rong Yeh, Gen-Yih Liao, T. C. E. Cheng, Yan-Cheng Chang, Ching-I Teng |
Decis. Support Syst. | 5 |
| 2006 | Enhancing WLAN/UMTS Dual-Mode Services Using a Novel Distributed Multi-Agent Scheduling SchemeabstractAlthough Wireless Local Area Network (WLAN) services are inexpensive and have a high bandwidth, UMTS services provide a larger covered area and high mobility. Based on intelligent deduction, this study presents a novel service scheduling scheme for WLAN/UMTS dual-mode networks. The developed system, Distributed Multi-Agent System (DMAS), consists of a set of problem-solving agents that autonomously process their own tasks and interoperate with each other by a shared database to reach a suitable schedule for dual-mode network services. A two-level control mechanism composed of local-control and meta-control is proposed to achieve a high degree of goodness in service scheduling. Simulation results indicate that the quality of service (QoS) of the proposed discipline in terms of average delay and jitter is better than that of the pure UMTS network by 25% and 10%, respectively. The scheduling discipline can improve the service quality in multiple-mode networks. Jiann-Liang Chen, Yan-Cheng Chang, Ming-Chiao Chen |
ISCC | 2 |
| 2006 | The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives
Yan-Cheng Chang, Chun-Yuan Hsiao, Chi-Jen Lu |
J. Cryptol. | 1 |
| 2005 | Privacy Preserving Keyword Searches on Remote Encrypted Data
Yan-Cheng Chang, Michael Mitzenmacher |
ACNS | 1 |
| 2005 | Oblivious polynomial evaluation and oblivious neural learning
Yan-Cheng Chang, Chi-Jen Lu |
Theor. Comput. Sci. | 1 |
| 2004 | Single Database Private Information Retrieval with Logarithmic Communication
Yan-Cheng Chang |
ACISP | 1 |
| 2002 | On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives
Yan-Cheng Chang, Chun-Yun Hsiao, Chi-Jen Lu |
ASIACRYPT | 1 |
| 2001 | Oblivious Polynomial Evaluation and Oblivious Neural Learning
Yan-Cheng Chang, Chi-Jen Lu |
ASIACRYPT | 1 |