Page 140 - My FlipBook
P. 140
大
實室 Computation Theory and Algorithms
驗
Research Laboratories Laboratory
Research Faculty
Churn-Jung Liau / Chair The principle research goals of our group are to understand the power and limitations of
computation and to help establish solid foundations for other areas of computer science.
Research Fellow Below, we brie y describe the research topics that we are currently focusing on.
Da-Wei Wang I. Quantum and Post-Quantum Cryptography
Research Fellow We aim to understand the role of quantum power in cryptography, representing a double-
edged sword. On the one hand, large-scale quantum computers can break most public-key
Chi-Jen Lu cryptosystems in use by means of Shor’s algorithm, which is being tackled by post-quantum
cryptography (PQC). We are developing post-quantum cryptosystems (usually public-key
Research Fellow cryptosystems) that are secure against quantum adversaries. On the other hand, quantum
computing also enhances the abilities of honest parties, and quantum cryptography
Der-Tsai Lee broadly explores the rich possibilities of stronger functionality or security that can be
achieved. We are interested in both research directions, from both theoretical and practical
Distinguished Visiting aspects. We have actively participated in the post-quantum cryptography standardization
Chair process by the U.S. National Institute of Standards and Technology (NIST), with one of our
submissions undergoing round 2 of that process. On the theoretical side, we have broad
Tsan-sheng Hsu interests in various topics such as device-independent cryptography, classical delegation
of quantum computation, secure multiparty quantum computation, and security in the
Research Fellow quantum random oracle model.
Ming-Tat Ko II. Geometric Computing
Research Fellow Geometric computing considers algorithm development for problems that can be stated
in terms of geometrical objects. The most common distance metric used in this field is
Bo-Yin Yang Euclidean distance, but for many practical applications other distance metrics are needed
to t real scenarios. For example, Manhattan distance represents the walking distance in a
Research Fellow grid-like city, and time distance describes travel time in a transportation network consisting
of vehicles of various speeds. By introducing these metrics into classical geometry
Jing-Sin Liu problems―such as Voronoi diagrams, convex hulls, route planning, facility location,
amongst others―we are investigating problems of theoretical importance that also have
Associate Research practical applications in diverse areas, including transportation networks, wireless sensor
Fellow networks, VLSI design, and many others. We are interested in how the problem properties
would change with respect to each metric and how we can make use of these properties to
Kai-Min Chung design e cient algorithms.
Research Fellow III. Combinatorial Optimization and Approximation Algorithms
Combinatorial optimization is concerned with the search for a best possible solution in
a nite but large solution space. In most cases, exhaustive searching is not tractable, and
138
實室 Computation Theory and Algorithms
驗
Research Laboratories Laboratory
Research Faculty
Churn-Jung Liau / Chair The principle research goals of our group are to understand the power and limitations of
computation and to help establish solid foundations for other areas of computer science.
Research Fellow Below, we brie y describe the research topics that we are currently focusing on.
Da-Wei Wang I. Quantum and Post-Quantum Cryptography
Research Fellow We aim to understand the role of quantum power in cryptography, representing a double-
edged sword. On the one hand, large-scale quantum computers can break most public-key
Chi-Jen Lu cryptosystems in use by means of Shor’s algorithm, which is being tackled by post-quantum
cryptography (PQC). We are developing post-quantum cryptosystems (usually public-key
Research Fellow cryptosystems) that are secure against quantum adversaries. On the other hand, quantum
computing also enhances the abilities of honest parties, and quantum cryptography
Der-Tsai Lee broadly explores the rich possibilities of stronger functionality or security that can be
achieved. We are interested in both research directions, from both theoretical and practical
Distinguished Visiting aspects. We have actively participated in the post-quantum cryptography standardization
Chair process by the U.S. National Institute of Standards and Technology (NIST), with one of our
submissions undergoing round 2 of that process. On the theoretical side, we have broad
Tsan-sheng Hsu interests in various topics such as device-independent cryptography, classical delegation
of quantum computation, secure multiparty quantum computation, and security in the
Research Fellow quantum random oracle model.
Ming-Tat Ko II. Geometric Computing
Research Fellow Geometric computing considers algorithm development for problems that can be stated
in terms of geometrical objects. The most common distance metric used in this field is
Bo-Yin Yang Euclidean distance, but for many practical applications other distance metrics are needed
to t real scenarios. For example, Manhattan distance represents the walking distance in a
Research Fellow grid-like city, and time distance describes travel time in a transportation network consisting
of vehicles of various speeds. By introducing these metrics into classical geometry
Jing-Sin Liu problems―such as Voronoi diagrams, convex hulls, route planning, facility location,
amongst others―we are investigating problems of theoretical importance that also have
Associate Research practical applications in diverse areas, including transportation networks, wireless sensor
Fellow networks, VLSI design, and many others. We are interested in how the problem properties
would change with respect to each metric and how we can make use of these properties to
Kai-Min Chung design e cient algorithms.
Research Fellow III. Combinatorial Optimization and Approximation Algorithms
Combinatorial optimization is concerned with the search for a best possible solution in
a nite but large solution space. In most cases, exhaustive searching is not tractable, and
138
