| Promise zero knowledge and its applications to round optimal MPC S Badrinarayanan, V Goyal, A Jain, YT Kalai, D Khurana, A Sahai Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 62 | 2018 |
| How to achieve non-malleability in one or two rounds D Khurana, A Sahai 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 60* | 2017 |
| Distinguisher-dependent simulation in two rounds and its applications A Jain, YT Kalai, D Khurana, R Rothblum Annual International Cryptology Conference, 158-189, 2017 | 60 | 2017 |
| How to generate and use universal samplers D Hofheinz, T Jager, D Khurana, A Sahai, B Waters, M Zhandry International Conference on the Theory and Application of Cryptology and …, 2016 | 54 | 2016 |
| Indistinguishability obfuscation without multilinear maps: iO from LWE, bilinear maps, and weak pseudorandomness P Ananth, A Jain, A Sahai Cryptology ePrint Archive, 2018 | 49 | 2018 |
| SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE R Jawale, YT Kalai, D Khurana, R Zhang Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 39 | 2021 |
| Statistical witness indistinguishability (and more) in two messages YT Kalai, D Khurana, A Sahai Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 39 | 2018 |
| Statistical ZAP arguments S Badrinarayanan, R Fernando, A Jain, D Khurana, A Sahai Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020 | 38* | 2020 |
| Round optimal concurrent MPC via strong simulation S Badrinarayanan, V Goyal, A Jain, D Khurana, A Sahai Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017 | 38 | 2017 |
| Round optimal concurrent non-malleability from polynomial hardness D Khurana Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017 | 38 | 2017 |
| Non-interactive delegation for low-space non-deterministic computation S Badrinarayanan, YT Kalai, D Khurana, A Sahai, D Wichs Cryptology ePrint Archive, 2017 | 35* | 2017 |
| Weak zero-knowledge beyond the black-box barrier N Bitansky, D Khurana, O Paneth Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 34 | 2019 |
| One-way functions imply secure computation in a quantum world J Bartusek, A Coladangelo, D Khurana, F Ma Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 33 | 2021 |
| Post-quantum multi-party computation A Agarwal, J Bartusek, V Goyal, D Khurana, G Malavolta Advances in Cryptology–EUROCRYPT 2021: 40th Annual International Conference …, 2021 | 24 | 2021 |
| Breaking the three round barrier for non-malleable commitments V Goyal, D Khurana, A Sahai 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), 21-30, 2016 | 22 | 2016 |
| Secure computation from elastic noisy channels D Khurana, HK Maji, A Sahai Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 20 | 2016 |
| Unconditional UC-secure computation with (stronger-malicious) PUFs S Badrinarayanan, D Khurana, R Ostrovsky, I Visconti Annual International Conference on the Theory and Applications of …, 2017 | 19* | 2017 |
| On the round complexity of secure quantum computation J Bartusek, A Coladangelo, D Khurana, F Ma Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021 | 18 | 2021 |
| Non-interactive non-malleability from quantum supremacy YT Kalai, D Khurana Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology …, 2019 | 17 | 2019 |
| Do distributed differentially-private protocols require oblivious transfer? V Goyal, D Khurana, I Mironov, O Pandey, A Sahai Cryptology ePrint Archive, 2015 | 17 | 2015 |
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAVerified email at cs.ucla.edu
