Page 46 - 2017 Brochure
P. 46
聘研究員
Distinguished Research Fellows
李德財 Der-Tsai Lee
Distinguished Research Fellow
Ph.D., Computer Science, University of Illinois at Urbana-Champaign
Tel: +886-2-2788-3799 ext. 2209 Fax: +886-2-2782-4814
Email: dtlee@iis.sinica.edu.tw
http://www.iis.sinica.edu.tw/pages/dtlee
Research Description In the area of information security, our focus is on secure
message delivery. We propose a secure email delivery
Our research is concerned with algorithm design and scheme, which aims to extend and improve granular control
analysis, geometric computing, combinatorial optimization for delivering sensitive messages. In particular, we adopt
and information security. In geometric computing, we a scheme that replaces the traditional push-by-default
consider route planning and facility location in a metric model with one wherein emails are pulled on demand,
space. These issues are central in diverse areas, including with the recipient’s consent. We would like to provide
transportation networks, communication networks, wireless a more fine-grained mechanism to better control the
sensor networks, VLSI design, etc. By introducing different delivery of data or sensitive emails in the hope to mitigate
real-world concepts for performance evaluation, such the hazards of data leakage and infectious propagation of
as the time-distances of routes and various competition user data. For delivery of messages containing sensitive
models among facilities, we obtain more realistic problems personal information in a mobile environment, we propose
from these research topics. Some such problems include an enhanced secure instant messaging (IM) architecture,
the time-based route planning problem, the competitive equipped with a self- destructing message feature. We
facility location problem for homogeneous facilities, and designed Pandora Message Encryption and Exchange
the cooperative facility location problem for heterogeneous Scheme and a format of a self-destructible message atop
facilities, and others. These problems are both theoretically an existing IM service architecture e.g., XMPP, EXtensible
and practically important. In graph algorithms we consider Messaging and Presence Protocol. The Pandora system
a series of combinatorial optimization problems and enables senders to set time, frequency and location
the corresponding approximation algorithms that are constraints, as well as other conditions for accessing
related to minimum dominating set and energy-efficient and managing the transmitted messages. A simple
scheduling. The former includes a generalization, called the messenger application on the Android platform has been
capacitated dominating set problem, that takes capacity implemented and its performance was evaluated, showing
and demand constraints of the vertices into consideration, that the Pandora Messaging architecture is practical
and the capacitated facility location problem, which further and feasible for communicating sensitive information on
considers that the assignment cost in the objective to be mobile devices. Beyond Pandora, we look to push secure
optimized. Both problems are central issues in the study messaging toward media agnosticism, not limiting the
of approximation algorithms. The latter aims at providing user to a specific communication vendor (such as LINE or
energy-efficiency for modern systems from the perspective WhatsApp). We designed and developed a ‘middle layer’
of algorithm design and analysis. By utilizing mechanisms App, between the user’s key-in data (usually sensitive data)
at the hardware level, such as low-power standby modes and the transmission channel (social media, messenger,
and dynamic voltage frequency scaling, we seek to provide SMS, or email). The App provides an easy to use end-to-
algorithms with provable energy-efficiency guarantees. end encryption with specially-designed key management
From the algorithmic point of view, we are exploring the transparent to the user. Both the Android and iOS Apps
underlying structures and properties of these problems have been implemented and in trial runs. Our goal is not
and seek to develop efficient algorithms and suitable only to provide secure delivery but also to mitigate the
approximation solutions. Through our algorithmic research, extent to which IM service providers might collect sensitive
we aim not only to solve contemporary problems but also to data or even eavesdrop on their users.
develop fundamental techniques and tools that can be used
for a wide range of related problems.
44 特聘講座 / 特聘研究群 Distinguished Chair and Distinguished Research Fellows
Distinguished Research Fellows
李德財 Der-Tsai Lee
Distinguished Research Fellow
Ph.D., Computer Science, University of Illinois at Urbana-Champaign
Tel: +886-2-2788-3799 ext. 2209 Fax: +886-2-2782-4814
Email: dtlee@iis.sinica.edu.tw
http://www.iis.sinica.edu.tw/pages/dtlee
Research Description In the area of information security, our focus is on secure
message delivery. We propose a secure email delivery
Our research is concerned with algorithm design and scheme, which aims to extend and improve granular control
analysis, geometric computing, combinatorial optimization for delivering sensitive messages. In particular, we adopt
and information security. In geometric computing, we a scheme that replaces the traditional push-by-default
consider route planning and facility location in a metric model with one wherein emails are pulled on demand,
space. These issues are central in diverse areas, including with the recipient’s consent. We would like to provide
transportation networks, communication networks, wireless a more fine-grained mechanism to better control the
sensor networks, VLSI design, etc. By introducing different delivery of data or sensitive emails in the hope to mitigate
real-world concepts for performance evaluation, such the hazards of data leakage and infectious propagation of
as the time-distances of routes and various competition user data. For delivery of messages containing sensitive
models among facilities, we obtain more realistic problems personal information in a mobile environment, we propose
from these research topics. Some such problems include an enhanced secure instant messaging (IM) architecture,
the time-based route planning problem, the competitive equipped with a self- destructing message feature. We
facility location problem for homogeneous facilities, and designed Pandora Message Encryption and Exchange
the cooperative facility location problem for heterogeneous Scheme and a format of a self-destructible message atop
facilities, and others. These problems are both theoretically an existing IM service architecture e.g., XMPP, EXtensible
and practically important. In graph algorithms we consider Messaging and Presence Protocol. The Pandora system
a series of combinatorial optimization problems and enables senders to set time, frequency and location
the corresponding approximation algorithms that are constraints, as well as other conditions for accessing
related to minimum dominating set and energy-efficient and managing the transmitted messages. A simple
scheduling. The former includes a generalization, called the messenger application on the Android platform has been
capacitated dominating set problem, that takes capacity implemented and its performance was evaluated, showing
and demand constraints of the vertices into consideration, that the Pandora Messaging architecture is practical
and the capacitated facility location problem, which further and feasible for communicating sensitive information on
considers that the assignment cost in the objective to be mobile devices. Beyond Pandora, we look to push secure
optimized. Both problems are central issues in the study messaging toward media agnosticism, not limiting the
of approximation algorithms. The latter aims at providing user to a specific communication vendor (such as LINE or
energy-efficiency for modern systems from the perspective WhatsApp). We designed and developed a ‘middle layer’
of algorithm design and analysis. By utilizing mechanisms App, between the user’s key-in data (usually sensitive data)
at the hardware level, such as low-power standby modes and the transmission channel (social media, messenger,
and dynamic voltage frequency scaling, we seek to provide SMS, or email). The App provides an easy to use end-to-
algorithms with provable energy-efficiency guarantees. end encryption with specially-designed key management
From the algorithmic point of view, we are exploring the transparent to the user. Both the Android and iOS Apps
underlying structures and properties of these problems have been implemented and in trial runs. Our goal is not
and seek to develop efficient algorithms and suitable only to provide secure delivery but also to mitigate the
approximation solutions. Through our algorithmic research, extent to which IM service providers might collect sensitive
we aim not only to solve contemporary problems but also to data or even eavesdrop on their users.
develop fundamental techniques and tools that can be used
for a wide range of related problems.
44 特聘講座 / 特聘研究群 Distinguished Chair and Distinguished Research Fellows
