Folgen
Dakshita Khurana
Dakshita Khurana
University of Illinois Urbana-Champaign
Bestätigte E-Mail-Adresse bei illinois.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
692018
Distinguisher-dependent simulation in two rounds and its applications
A Jain, YT Kalai, D Khurana, R Rothblum
Annual International Cryptology Conference, 158-189, 2017
692017
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
67*2017
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
602021
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
602016
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
572021
Indistinguishability obfuscation without multilinear maps: iO from LWE, bilinear maps, and weak pseudorandomness
P Ananth, A Jain, A Sahai
Cryptology ePrint Archive, 2018
542018
Statistical ZAP arguments
S Badrinarayanan, R Fernando, A Jain, D Khurana, A Sahai
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
442020
Non-interactive delegation for low-space non-deterministic computation
S Badrinarayanan, YT Kalai, D Khurana, A Sahai, D Wichs
Cryptology ePrint Archive, 2017
44*2017
Round optimal concurrent non-malleability from polynomial hardness
D Khurana
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
402017
Statistical witness indistinguishability (and more) in two messages
YT Kalai, D Khurana, A Sahai
Annual International Conference on the Theory and Applications of …, 2018
392018
Round optimal concurrent MPC via strong simulation
S Badrinarayanan, V Goyal, A Jain, D Khurana, A Sahai
Theory of Cryptography Conference, 743-775, 2017
392017
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
372019
SNARGs for P from sub-exponential DDH and QR
J Hulett, R Jawale, D Khurana, A Srinivasan
Annual International Conference on the Theory and Applications of …, 2022
322022
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
322021
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
312021
Cryptography with certified deletion
J Bartusek, D Khurana
Annual International Cryptology Conference, 192-223, 2023
242023
Secure computation from elastic noisy channels
D Khurana, HK Maji, A Sahai
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
232016
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
222016
Round optimal black-box “commit-and-prove”
D Khurana, R Ostrovsky, A Srinivasan
Theory of Cryptography Conference, 286-313, 2018
212018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20