PREPRINTS
  1. SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE
    with Ruta Jawale, Yael Kalai and Rachel Zhang
    (merge of [JK20] and [KZ20])
  2. Post-Quantum MPC in Constant Rounds
    with Amit Agarwal, James Bartusek, Vipul Goyal and Giulio Malavolta
    ​
PUBLICATIONS (Authors arranged alphabetically):
  1. Computational Extractors with Negligible Error in the CRS Model
    EUROCRYPT 2020 
  2. Statistical ZAP Arguments
    EUROCRYPT 2020
  3. On Statistical Security in Two Party Computation
    TCC 2020
  4. Non-interactive non-malleability from Quantum Supremacy
    CRYPTO 2019
  5. Weak Zero-Knowledge Beyond the Black-Box Barrier
    STOC 2019, Invited to the SICOMP Special Issue for STOC 2019
  6. Non-interactive Delegation for Low Space Non-Deterministic Computation
    S    TOC 2018
  7. Statistical WI (and More) in Two Messages
    Eurocrypt 2018
  8. Promise Zero Knowledge and Applications to Round Optimal MPC
    CRYPTO 2018
  9. Round Optimal Black-Box ``Commit-and-Prove''
    TCC 2018
  10. Upgrading to Functional Encryption
    TCC 2018 
  11. How to Achieve Non-Malleability in One or Two Rounds
    FOCS 2017, Invited to the SICOMP Special Issue for FOCS 2017
  12. Distinguisher-Dependent Simulation in 2 Rounds and Applications
    CRYPTO 2017
  13. New Feasibility Results in Unconditional UC-Secure Computation with (Malicious) PUFs
    Eurocrypt 2017
  14. Round Optimal Concurrent Non-Malleability from Polynomial Hardness
    TCC 2017
  15. Round Optimal Concurrent MPC via Strong Simulation
    TCC 2017 
  16. Breaking the 3 Round Barrier for Non-Malleable Commitments
    FOCS 2016
  17. All Complete Functionalities are Reversible
    EUROCRYPT 2016
  18. Secure Computation from Elastic Noisy Channels
    EUROCRYPT 2016
  19. How to Generate and Use Universal Samplers
    ASIACRYPT 2016
  20. Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
    ICALP 2016 (Track A)
  21. Multi-Party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
    ASIACRYPT 2015
  22. Statistical Randomized Encodings: A Complexity Theoretic View
    ICALP 2015 (Track A) 
  23. Non-Malleable Multi-Prover Interactive Proofs and Witness Signatures
    Cryptology ePrint Archive 2015
  24. Black-Box Separations for Differentially Private Protocols
    ASIACRYPT 2014