Breaking Cryptographic Barriers
Cryptography, originally the art of facilitating secret communication, has now evolved to enable a variety of secure tasks. Some core challenges that modern cryptography addresses are: Can we prevent adversaries from tampering with encrypted communication? Can we verify that computation is performed correctly while preserving the privacy of data on which computation occurs? Can we enable mutually distrusting participants to jointly compute on distributed private data?
In this talk, I will discuss my work that builds non-interactive secure protocols to accomplish these tasks, based on widely believed cryptographic hardness assumptions. I will also describe new techniques that overcome known barriers and enable secure protocols that were previously believed to be impossible.
Dakshita Khurana is a Ph.D. candidate in the Computer Science Department at UCLA, where she is co-advised by Amit Sahai and Rafail Ostrovsky. She is currently supported by a Dissertation Year Fellowship and is a recipient of the Cisco Outstanding Graduate Student Research Award. She obtained her Masters from UCLA in 2014, and Bachelors from IIT Delhi in 2012. She is interested in all aspects of cryptography, with a special emphasis on the design of secure protocols. In this area, she has primarily focused on non-malleable protocols that prevent man-in-the-middle attacks, on zero-knowledge proof systems, and on their applications to secure computation. Homepage: http://web.cs.ucla.edu/~dakshita/