by
Wang Shuhong
Post-Doctoral Fellow,
School of Information Systems,
Singapore Management University

Synopsis

The millionaire problem refers to the problem that two millionaires attempt to compare their richness while keeping their wealth secret. Since it was first introducted by Andrew Yao, the millionaire problem has been extensively studied. The problem was later generalized by Goldreich and many others, as secure multi-party computation (SMC) problem, where the computation can be any function than comparison. In theory, the SMC problem is solvable but the generic solutions are impractical. Thus special solutions should be developed for special cases for effieciency reasons.

In this talk, the speaker will introduce a series of specific SMC problems in specific computation domains, such as data query, data mining, intrusion detection, scientific computation, geometric computation, and satistical analysis. Some of the problems are new, and some have already been studied in the past. For the known problems, brief survey on the related work will be given; for the new problems, potential real-life applications will be described.

All are encouraged to attend, but attendance of SIS Post-Doctoral Fellows and SIS Research Fellows are required.

Please reply  here before 24th August 2005
if you are interested to attend this seminar so as to facilitate in lunch provision.