报 告 人:
报告题目:Verifiable Voting Systems: Theory and Practice
时 间: 2013年12月7日(周六)上午10:30-11:30
地 点: 成功楼603教室
主办单位:数学与计算机科学学院、福建省网络安全与密码技术重点实验室
报告摘要:
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.
专家介绍:
Zhe Xia received the BSc degree in 2004 from