Research Output per year
Fingerprint Fingerprint is based on mining the text of the expert's scholarly documents to create an index of weighted terms, which defines the key subjects of each individual researcher.
- 1 Similar Profiles
Polynomials
Engineering & Materials Science
Cryptography
Engineering & Materials Science
Hardness
Engineering & Materials Science
Non-malleability
Mathematics
Secure Computation
Mathematics
Obfuscation
Mathematics
Black Box
Mathematics
Zero-knowledge
Mathematics
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Research Output 2011 2019
Non-interactive Non-malleability from Quantum Supremacy
Kalai, Y. T. & Khurana, D., Jan 1 2019, Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings. Micciancio, D. & Boldyreva, A. (eds.). Springer-Verlag, p. 552-582 31 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11694 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Non-malleability
Hardness
Amplification
Cryptography
Polynomials
Weak zero-knowledge beyond the black-box barrier
Bitansky, N., Khurana, D. & Paneth, O., Jun 23 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 1091-1102 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Cryptography
Polynomials
Simulators
Hardness
Promise zero knowledge and its applications to round optimal MPC
Badrinarayanan, S., Goyal, V., Jain, A., Kalai, Y. T., Khurana, D. & Sahai, A., Jan 1 2018, Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Boldyreva, A. & Shacham, H. (eds.). Springer-Verlag, p. 459-487 29 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10992 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Zero-knowledge
Polynomials
Coin tossing
Polynomial time
Non-malleability
Round Optimal Black-Box “Commit-and-Prove”
Khurana, D., Ostrovsky, R. & Srinivasan, A., Jan 1 2018, Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings. Dziembowski, S. & Beimel, A. (eds.). Springer-Verlag, p. 286-313 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11239 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Black Box
Cryptography
Secure Computation
One-way Function
Zero-knowledge
Statistical witness indistinguishability (and more) in two messages
Kalai, Y. T., Khurana, D. & Sahai, A., Jan 1 2018, Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2018 Proceedings. Nielsen, J. B. & Rijmen, V. (eds.). Springer-Verlag, p. 34-65 32 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10822 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Polynomials
Oblivious Transfer
Zero-knowledge
Hardness
Polynomial