时间：2014年1月9日（星期四）下午14:30
地点：仓山校区成功楼603室
主讲：新加坡南洋理工大学 王华雄教授
主办：数学与计算机科学学院 数学研究中心
专家简介：Wang Huaxiong graduated from Fujian Normal University with a BSc in 1984 and a Master in 1989, both in Mathematics. He then received a PhD in Mathematics from University of Haifa, Israel in 1996 and a PhD in Computer Science from University of Wollongong, Australia in 2001. He joined Nanyang Technological University in 2006 and is currently an associate professor in the Division of Mathematical Sciences. Prior to that, he held positions in several universities, including Macquarie University, Australia; City University, Hong Kong; University of Wollongong, Australia; National University of Singapore; Kobe University, Japan; Fujian Normal University, China.
His research interests include cryptography, information security, coding theory, combinatorics and theoretical computer science. He was on the editorial boards of Designs, Codes and Cryptography (2006 -2011), and is currently on the editorial boards of International Journal of Foundations of Computer Science, Journal of Communications (JCM) and Journal of Communications and Networks. He was the Program Co-Chair of 9th Australasian Conference on Information Security and Privacy (ACISP'04), Sydney, Australia, 2004 and 4th International Conference on Cryptology and Network Security (CANS05), Xiamen, China, 2005. He received the inaugural Award of Best Research Contribution awarded by the Computer Science Association of Australasia in 2004.
报告摘要：A secret sharing scheme typically requires secure communications in each of two distribution phases:
(1) a dealer distributes shares to participants (share distribution phase); and later
(2) the participants in some authorised subset send their share information to a combiner (secret reconstruction phase).
While problems on storage required for participants, for example, the size of shares, have been well studied, problems regarding the communication complexity of the two distribution phases seem to have been mostly neglected in the literature so far.
In this talk, we deal with several communication related problems in the secret reconstruction phase. We show that there is a trade-off between the communication costs and the number of participants involved in the secret reconstruction, and that the point-to-point secure communication channels for participants to send share information to the combiner can be replaced with partial broadcast channels.