时间：2013年12月7日(星期六)上午10:30-11:30
地点：仓山校区成功楼603室
主讲：武汉理工大学 夏喆博士
主办：数学与计算机科学学院、福建省网络安全与密码技术重点实验室
专家简介：Zhe Xia received the BSc degree in 2004 from Wuhan University, China. He received the MSc degree in 2005 and the PhD degree in 2009, both from the University of Surrey, U.K. He held a postdoctoral position in the Trustworthy Voting Systems group, University of Surrey, from 2009 to 2013, before joining Wuhan University of Technology (WHUT), as an Associate Professor in 2013. His research interest includes cryptography and information security, particularly design and analysis of secure voting systems. He has published around 20 papers in this field, including some top journals and conferences such as IEEE Transactions of Information Forensics and Security (TIFS) and USENIX Security. Dr. Xia has served as Program Committee for several international conferences and he is currently an associate Editor of Journal of Information Security and Application (JISA).
报告摘要：Designing verifiable voting system is one of the most challenging tasks in information security. In one hand, the system needs to be transparent: the entire voting phase and tallying phase should be verifiable, and the verification should not rely on the hardware used in the system or the authority who operates the system. In the other hand, voters need be protected from coercion so that they dare to express their wishes. This requires that not only the voter's choice is protected from adversaries, but also the voter is unable to prove to adversaries how she has voted. In this talk, we first explore how verifiable voting systems can be designed in theory, using the Pret a Voter system as an example. Then we discuss a few problems that we met when Pret a Voter is implemented for a real world election, and we introduce how one of the problems has been solved.