原News
Current position: Home > 原News > 正文

Date:2011-7-11, 9:00am

Venue:Conference Hall 322,Science Building

Title: Algorithmic Aspects of Secure Computation (Part 2)

Speaker: Prof. Matt Franklin (U.C. Davis)

Abstract: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.

Previous:On the Computation of Weil Pairing and Tate Pairing

Next:Lower bounds of shortest vector lengths in random NTRU lattices