Robust Secure Computation
Hemanta Maji - Purdue University
Feb 03, 2016Size: 123.7MB
Download: MP4 Video
Watch in your Browser Watch on YouTube
AbstractModern Cryptography provides algorithmic solutions to securely compute over the private data of mutually distrustful parties. These solutions require algorithmic or physical building blocks such as computational hardness assumptions, trusted hardware, correlated private randomness and noisy channels. A fundamental limitation of these solutions is that their security necessarily hinges on the assumption that these underlying building blocks are free of any imperfection. Over the last decade, however, this assumption has been repeatedly proven false in the real world, often rendering these solutions completely insecure.
This raises the following important question: “Can secure computation be based on imperfect building blocks?”
My research provides algorithmic solutions that resolve this question in the affirmative.
About the SpeakerHemanta K. Maji joined the Department of Computer Science at Purdue University as Assistant Professor in Fall 2015. Earlier, he was a post-doctoral researcher and a Center Fellow at the Center of Encrypted Functionalities in University of California, Los Angeles. He was a Computing Innovations Fellow sponsored by Computing Research Association from 2011 to 2013.
He obtained his Ph.D. in computer science from University of Illinois, Urbana-Champaign and his undergraduate B.Tech. from Indian Institute of Technology, Kanpur. His research interest is cryptography, in general, and secure computation, in particular. He has over 25 original peer reviewed publications at venues like FOCS, CRYPTO, EUROCRYPT and Innovations in Computer Science. His current research focuses on developing highly resilient protocols with strong mathematical security guarantees which are practically deployable.
Recently, his research has been recommended for the NSF CISE Research Initiation Initiative (CRII) Award.
The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.