情報科学研究科セミナーのお知らせ

For the information in English, please see the bottom of this message.
　　　　　　　　　　　　　
　　　　　　　　　　　　　　　　　　　　　　　　　　　平成19年11月15日

　関係者各位

　　　　　　　　　　　　　　　　　　　　　　　　　　総　務　課　長
　　　　
情報科学研究科セミナー（第１２回）の開催について

　来る11月16日（金）に、下記のとおり情報研究科セミナーを開催します。
　つきましては、多数の皆様にご参加いただきたく、セミナーの案内を申し
上げます。本セミナーに関しましては、参加申し込み・予約などは必要ござ
いませんので、直接、会場にお越しくださいますようお願いいたします。

　　　　　　　　　　　　　　 記

１．日 時　　　平成19年11月16日（金）15：45〜17：45

２．場 所　　　情報科学研究科講義棟　大講義室

３．講演題目　　 「Applying Recreational Mathematics to Secure　　　　　
　　　　　　　　　Multiparty Computation」
　　　　　　　
４．講 演 者　　　ロンドン大学　教授
　　　　　　　　　Yvo Desmedt 氏
　
５．講演要旨

　　The problem of a mice traveling through a maze is well known. The
maze can be represented using a planar graph. We present a variant of
the maze. We consider a grid vertex colored planar graph in which an
adversary can choose up to colors and remove all vertices that have
these colors and their adjacent edges. We call the grid in which these
vertices and adjacent edges are removed a reduced grid. The problem is
that a mice must be able to move in the reduced grid from the first row
to the last row, and from the first column to the last column, and this
for all possible reductions. We present three types of solutions to
construct such grids. The efficiency of these solutions is discussed.
The problem finds its origin in the problem of secure multiparty
computation. Imagine going to a medical doctor in Iraq who needs to
prescribe some medication, which might be counterindicated. The typical
solution is to disclose all medical records to the doctor. If secure
multiparty computation would be used, the medical doctor in Iraq only
learns from the distributed medical databases whether the medication is,
or is not, counterindicated. We consider the problem of parties each
having a secret belonging to a non-abelian group. The parties want to
compute the product of these secrets without leaking anything that does
not follow trivially from the product. Our solution is black box, i.e.,
independent of the non-abelian group. This has applications to
threshold block ciphers and post-quantum cryptography.


６．講演者略歴　　　

Yvo Desmedt received his Ph.D. (Summa cum Laude) from the University
of Leuven, Belgium (1984). He is presently the BT Chair of Information
Security at University College London, UK. He is also a courtesy
professor at Florida State University. His interests include
cryptography, network security and computer security. He was program
chair of ICITS 2007, co-program chair of CANS 2005, program chair of PKC
2003, the 2002 ACM Workshop on Scientific Aspects of Cyber Terrorism and
Crypto '94. He is editor-in-chief of the IEE Proceedings of Information
Security, editor of the Journal of Computer Security, of Information
Processing Letters and of Advances in Mathematics of Communications. He
has given invited lectures at several conferences and workshop in 5
different continents. He has authored over 150 refereed papers, of which
114 listed on DBLP.

７．担当教員　情報科学研究科　
　　　　　　　教授　宮地　充子（内線：1286）

８．問合せ先　総務課共通事務室共通事務係　米山（内線：1157）

−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−
We would like to inform you about the 12th IS-Seminar as follows.

DATE: November 16, 2007 15:45-17:45
PLACE: IS Lecture Room
SUBJECT: “Applying Recreational Mathematics to Secure　　　　　　　　　
　　　　　Multiparty Computation"
SPEAKER: Professor Yvo Desmedt
University College London
SPEECH: English
REFERENCE: Administrative Services Office (E-mail: is-secr)