Chiu-Yuen Koo
I graduated from
the University
of Maryland, College Park with a Ph.D.
in Computer Science.
My Ph.D. advisor is Dr.
Jonathan Katz. I now works as a software engineer in Google.
Email: cykoo at cs DOT umd (DOT) edu / cykoo1 AT gmail (DOT) com
My CV.
Education
Research Interests:
Cryptography, Distributed Computing and Algorithms.
Publications:
-
Round Complexity of Authenticated Broadcast with a Dishonest Majority.
With Juan Garay,
Jonathan Katz and
Rafail Ostrovsky.
IEEE Symposium on Foundations of Computer Science (FOCS) 2007, to appear.
The proceedings version is available.
-
Round-Efficient Secure Computation in Point-to-Point Networks.
With Jonathan Katz.
In Advances in Cryptology -
EUROCRYPT 2007, pages 311-328.
-
Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions.
With Carmit Hazay,
Jonathan Katz and
Yehuda Lindell.
In the 4th Theory of Cryptography Conference (TCC 2007) ,
pages 323-341.
-
On Expected Constant-Round Protocols for Byzantine Agreement.
With Jonathan Katz.
In Advances in Cryptology - CRYPTO 2006, pages 445-462. A preliminary full version is available
here.
-
Reliable Broadcast in Radio Networks: The Bounded Collision Case.
With Vartika Bhandari, Jonathan Katz and
Nitin Vaidya.
In Proceedings of the 25th
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC),
pages 258-264, 2006.
The proceedings version is available.
-
Secure Computation with Partial Message Loss.
In the
3rd Theory of Cryptography Conference (TCC 2006), pages 502-521.
An updated version of the paper: this version contains some proofs
omitted from the proceedings
version.
-
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
With Iftach Haitner,
Omer Horvitz, Jonathan
Katz, Ruggero Morselli
and Ronen Shaltiel.
Preliminary version appeared in Advances in Cryptology -
EUROCRYPT 2005, pages 58-77.
Journal version accepted to Journal of Cryptology
(pending revisions). A preliminary full version is available
here.
-
Broadcast in Radio
Networks Tolerating Byzantine Adversarial Behavior.
In Proceedings of the 23rd
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC),
pages 275-282, 2004.
-
Competitive Deadline Scheduling via Additional or Faster Processors.
With Tak-Wah Lam, Tsuen-Wan
"Johnny" Ngan and Kar-Keung To.
Journal
of Scheduling, 6(2), pages
213-223, March 2003 (special issue on on-line scheduling).
- Extra Processors versus Future Information in Optimal Deadline Scheduling.
With Tak-Wah Lam, Tsuen-Wan
"Johnny" Ngan and Kar-Keung To.
Preliminary version appeared in Proceedings of the 14th
ACM Symposium on Parallel Algorithms and Architectures (SPAA),
pages 133-142, 2002. Journal version appeared in
Theory of
Computing Systems, 37(3), pages 323-341, May 2004 (special issue for SPAA 2002).
-
On-line Scheduling with Tight Deadlines.
With Tak-Wah Lam, Tsuen-Wan
"Johnny" Ngan, Kunihiko
Sadakane, and Kar-Keung To.
Preliminary version appeared in Proceedings of the 26th
International Symposium on Mathematical Foundations of Computer Science
(MFCS), pages 464-473, August 2001. Journal version appeared in
Theoretical Computer
Science (TCS), 295(1-3), pages 251-261, February 2003 (speical issue for MFCS 2001).
Manuscript: