动态新闻
当前位置: 首页 > 动态新闻 > 正文

时 间: 2011年7月11日(周一)上午9:00

地 点: 清华大学高等研究院 科学馆322报告厅

题 目: Algorithmic Aspects of Secure Computation (Part 2)

报 告 人: Prof. Matt Franklin (U.C. Davis)

报告摘要: We survey some recent progress in the design of efficient protocols for secure computation and communication, in a variety of

cryptographic settings. The common thread is the usefulness of interesting algorithmic methods originally developed for non-cryptographic

applications. This is an expanded version of the second half of an invited talk given at ISAAC 2010.

上一篇:On the Computation of Weil Pairing and Tate Pairing

下一篇:Lower bounds of shortest vector lengths in random NTRU lattices