The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Chiu-Yuen Koo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jonathan Katz, Chiu-Yuen Koo
    On Expected Constant-Round Protocols for Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2006, pp:445-462 [Conf]
  2. Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel
    Reducing Complexity Assumptions for Statistically-Hiding Commitment. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2005, pp:58-77 [Conf]
  3. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    On-Line Scheduling with Tight Deadlines. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:464-473 [Conf]
  4. Chiu-Yuen Koo
    Broadcast in radio networks tolerating byzantine adversarial behavior. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:275-282 [Conf]
  5. Chiu-Yuen Koo, Vartika Bhandari, Jonathan Katz, Nitin H. Vaidya
    Reliable broadcast in radio networks: the bounded collision case. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:258-264 [Conf]
  6. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Extra processors versus future information in optimal deadline scheduling. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:133-142 [Conf]
  7. Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda Lindell
    Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions. [Citation Graph (0, 0)][DBLP]
    TCC, 2007, pp:323-341 [Conf]
  8. Chiu-Yuen Koo
    Secure Computation with Partial Message Loss. [Citation Graph (0, 0)][DBLP]
    TCC, 2006, pp:502-521 [Conf]
  9. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Extra Processors versus Future Information in Optimal Deadline Scheduling. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2004, v:37, n:3, pp:323-341 [Journal]
  10. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kar-Keung To
    Competitive Deadline Scheduling via Additional or Faster Processors. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:2, pp:213-223 [Journal]
  11. Chiu-Yuen Koo, Tak Wah Lam, Tsuen-Wan Ngan, Kunihiko Sadakane, Kar-Keung To
    On-line scheduling with tight deadlines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:251-261 [Journal]
  12. Jonathan Katz, Chiu-Yuen Koo
    Round-Efficient Secure Computation in Point-to-Point Networks. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2007, pp:311-328 [Conf]

  13. Round Complexity of Authenticated Broadcast with a Dishonest Majority. [Citation Graph (, )][DBLP]


  14. Improving the Round Complexity of VSS in Point-to-Point Networks. [Citation Graph (, )][DBLP]


  15. On Expected Constant-Round Protocols for Byzantine Agreement. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002