 | 2009 |
|---|
| 10 |       | Jiann-Liang Chen,
Ming-Chiao Chen,
Yan-Cheng Chang:
Enhancing WLAN/UMTS dual-mode services using a novel distributed multi-agent scheduling scheme.
Computers & Electrical Engineering 35(5): 609-621 (2009) |
| 2006 |
|---|
| 9 | | Jiann-Liang Chen,
Yan-Cheng Chang,
Ming-Chiao Chen:
Enhancing WLAN/UMTS Dual-Mode Services Using a Novel Distributed Multi-Agent Scheduling Scheme.
ISCC 2006: 851-856 |
| 8 | | Yan-Cheng Chang,
Chun-Yuan Hsiao,
Chi-Jen Lu:
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives.
J. Cryptology 19(1): 97-114 (2006) |
| 2005 |
|---|
| 7 | | Yan-Cheng Chang,
Michael Mitzenmacher:
Privacy Preserving Keyword Searches on Remote Encrypted Data.
ACNS 2005: 442-455 |
| 6 | | Yan-Cheng Chang,
Chi-Jen Lu:
Oblivious polynomial evaluation and oblivious neural learning.
Theor. Comput. Sci. 341(1-3): 39-54 (2005) |
| 2004 |
|---|
| 5 | | Yan-Cheng Chang:
Single Database Private Information Retrieval with Logarithmic Communication.
ACISP 2004: 50-61 |
| 4 | | Yan-Cheng Chang:
Single Database Private Information Retrieval with Logarithmic Communication.
IACR Cryptology ePrint Archive 2004: 36 (2004) |
| 3 | | Yan-Cheng Chang,
Michael Mitzenmacher:
Privacy Preserving Keyword Searches on Remote Encrypted Data.
IACR Cryptology ePrint Archive 2004: 51 (2004) |
| 2002 |
|---|
| 2 | | Yan-Cheng Chang,
Chun-Yun Hsiao,
Chi-Jen Lu:
On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives.
ASIACRYPT 2002: 110-124 |
| 2001 |
|---|
| 1 | | Yan-Cheng Chang,
Chi-Jen Lu:
Oblivious Polynomial Evaluation and Oblivious Neural Learning.
ASIACRYPT 2001: 369-384 |
Data released under the ODC-BY 1.0 license — See also our legal information page