I am a PhD student in the Department of Computer Science at University of California, Los Angeles. I work with Prof. Amit Sahai and Prof. Rafail Ostrovsky.

Prior to this, I completed my Bachelors in Technology from the Indian Institute of Technology, Delhi in 2012. I received a Masters Degree in Computer Science from UCLA in 2014.

I am supported by the 2017-18 Dissertation Year Fellowship. I received the 2016-17 Outstanding Graduate Student Researcher Award at UCLA, sponsored by CISCO.

I spent the summer of 2014 as a research intern with Vipul Goyal at Microsoft Research, India and the summers of 2016 and 2017 as a research intern with Yael Tauman Kalai at Microsoft Research, New England.

I am interested in Theoretical Computer Science, specifically, Cryptography. My email id is: dakshita AT cs DOT ucla DOT edu

My picture

Publications:

- How to Achieve Non-Malleability in One or Two Rounds
  FOCS 2017, Invited to SIAM Journal of Computing (SICOMP) Special Issue
  with Amit Sahai
- Round Optimal Concurrent Non-Malleability from Polynomial Hardness
  To Appear in TCC 2017
- Round Optimal Concurrent MPC via Strong Simulation
  To Appear in TCC 2017
  with Saikrishna Badrinarayanan and Vipul Goyal and Abhishek Jain and Amit Sahai
- Distinguisher-Dependent Simulation in Two Rounds and its Applications
  CRYPTO 2017
  with Abhishek Jain and Yael Kalai and Ron Rothblum
- New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs
  EUROCRYPT 2017
  with Saikrishna Badrinarayanan and Rafail Ostrovsky and Ivan Visconti
- Breaking the Three Round Barrier for Non-Malleable Commitments
  FOCS 2016
  with Vipul Goyal and Amit Sahai
- All Complete Functionalities are Reversible
  EUROCRYPT 2016
  with Daniel Kraschewski, Hemanta K Maji, Manoj Prabhakaran and Amit Sahai
- Secure Computation from Elastic Noisy Channels
  EUROCRYPT 2016
  with Hemanta K Maji and Amit Sahai
- How to Generate and Use Universal Samplers
  ASIACRYPT 2016
  with Dennis Hofheinz, Tibor Jager, Amit Sahai, Brent Waters and Mark Zhandry
- Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
  ICALP 2016 (Track A)
  with Vipul Goyal, Ilya Mironov, Omkant Pandey and Amit Sahai
- Multi-Party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
  ASIACRYPT 2015
  with Vanishree Rao and Amit Sahai
- Statistical Randomized Encodings: A Complexity Theoretic View
  ICALP 2015 (Track A)
  with Shweta Agrawal, Anat Paskin-Cherniavsky and Yuval Ishai
- Black-Box Separations for Differentially Private Protocols
  ASIACRYPT 2014
  with Hemanta K Maji and Amit Sahai

Manuscripts:

- Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures
  Cryptology ePrint Archive 2015
  with Vipul Goyal and Aayush Jain

Undergraduate Research:

- A Grammar-Based GUI for Single View Reconstruction
  ICVGIP 2012
  with Surabhi Sankhla, Abhinav Shukla, Richa Varshney, Prem Kalra, Subhashis Banerjee
- Ensuring Tight Computational Security Against Higher-Order DPA Attacks
  PST 2011
  with Aditya Gaurav