Main navigation | Section navigation | Content

LAS Events « News « College of Liberal Arts & Sciences « University of Illinois

LAS Events

College of LAS Events

skip to events

calendar tabs

  •  All 
  • Grid
  • Month
  • Week
  • Day
  • (Selected tab) Detail

Event Detail Information

Event Detail Information

"Some Complexity Aspects of Secure Multiparty Computation"


Professor Manoj Prabhakaran, Computer Science;  University of Illinois

Date Oct 28, 2013
Time 4:00 pm - 5:00 pm  

141 Coordinated Science Laboratory


Coordinated Science Laboratory


Peggy Wells

Phone 217-244-2646
Views 1049


Secure multiparty computation (MPC) is a well-studied problem in modern cryptography. In this talk, I will survey a collection of results that study qualitative and quantitative complexity of (multi-party) functions, with respect to how "easy" or "hard" they are for MPC.

In particular, we formulate a quantitative notion of "cryptographic complexity" of a (multi-party) function, as the number of "crypto gates" needed to securely evaluate the function (amortized over several evaluations). Due to recent results, we can show that up to constants, this quantity does not depend on the specific choice of crypto gate, as long as it is "complete."

I shall discuss some connections of cryptographic complexity with other notions of complexity of functions, like circuit complexity and communication complexity.


Manoj Prabhakaran is an Associate Professor in the Department of Computer Science at the University of Illinois, Urbana-Champaign. Manoj received a Ph.D. in Computer Science from Princeton University in 2005, and a B.Tech in Computer Science and Engineering from the Indian Institute of Technology, Mumbai, in 2000.

link for robots only
Bookmark and Share