Dakshita Khurana
Dakshita Khurana
Geverifieerd e-mailadres voor illinois.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
472016
Distinguisher-dependent simulation in two rounds and its applications
A Jain, YT Kalai, D Khurana, R Rothblum
Annual International Cryptology Conference, 158-189, 2017
452017
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
36*2017
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.
P Ananth, A Jain, D Khurana, A Sahai
IACR Cryptol. ePrint Arch. 2018, 615, 2018
332018
Promise zero knowledge and its applications to round optimal MPC
S Badrinarayanan, V Goyal, A Jain, YT Kalai, D Khurana, A Sahai
Annual International Cryptology Conference, 459-487, 2018
322018
Statistical witness indistinguishability (and more) in two messages
YT Kalai, D Khurana, A Sahai
Annual International Conference on the Theory and Applications of …, 2018
252018
Round optimal concurrent non-malleability from polynomial hardness
D Khurana
Theory of Cryptography Conference, 139-171, 2017
212017
Round optimal concurrent MPC via strong simulation
S Badrinarayanan, V Goyal, A Jain, D Khurana, A Sahai
Theory of Cryptography Conference, 743-775, 2017
202017
Non-Interactive Delegation for Low-Space Non-Deterministic Computation.
S Badrinarayanan, YT Kalai, D Khurana, A Sahai, D Wichs
Electronic Colloquium on Computational Complexity (ECCC) 25, 9, 2018
19*2018
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
182016
Statistical ZAP arguments
S Badrinarayanan, R Fernando, A Jain, D Khurana, A Sahai
Annual International Conference on the Theory and Applications of …, 2020
172020
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
172019
Do distributed differentially-private protocols require oblivious transfer?
V Goyal, D Khurana, I Mironov, O Pandey, A Sahai
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
142016
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
102017
Statistical Randomized Encodings: A Complexity Theoretic View
S Agrawal, Y Ishai, D Khurana, A Paskin-Cherniavsky
92015
Secure computation from elastic noisy channels
D Khurana, HK Maji, A Sahai
Annual International Conference on the Theory and Applications of …, 2016
82016
Multi-party key exchange for unbounded parties from indistinguishability obfuscation
D Khurana, V Rao, A Sahai
International Conference on the Theory and Application of Cryptology and …, 2015
82015
Black-box separations for differentially private protocols
D Khurana, HK Maji, A Sahai
International Conference on the Theory and Application of Cryptology and …, 2014
82014
Non-interactive non-malleability from quantum supremacy
YT Kalai, D Khurana
Annual International Cryptology Conference, 552-582, 2019
62019
Round optimal black-box “commit-and-prove”
D Khurana, R Ostrovsky, A Srinivasan
Theory of Cryptography Conference, 286-313, 2018
62018
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20