| Multiparty computation with low communication, computation and interaction via threshold FHE G Asharov, A Jain, A López-Alt, E Tromer, V Vaikuntanathan, D Wichs Annual International Conference on the Theory and Applications of …, 2012 | 714 | 2012 |
| Separating succinct non-interactive arguments from all falsifiable assumptions C Gentry, D Wichs Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 660 | 2011 |
| Proofs of retrievability via hardness amplification Y Dodis, S Vadhan, D Wichs Theory of Cryptography Conference, 109-127, 2009 | 545 | 2009 |
| Two round multiparty computation via multi-key FHE P Mukherjee, D Wichs Annual International Conference on the Theory and Applications of …, 2016 | 506 | 2016 |
| Leakage-resilient public-key cryptography in the bounded-retrieval model J Alwen, Y Dodis, D Wichs Annual International Cryptology Conference, 36-54, 2009 | 401 | 2009 |
| Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors R Cramer, Y Dodis, S Fehr, C Padró, D Wichs Annual International Conference on the Theory and Applications of …, 2008 | 373 | 2008 |
| Dynamic proofs of retrievability via oblivious RAM D Cash, A Küpçü, D Wichs Journal of Cryptology 30 (1), 22-57, 2017 | 336 | 2017 |
| Leveled fully homomorphic signatures from standard lattices S Gorbunov, V Vaikuntanathan, D Wichs Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 331 | 2015 |
| Cryptography against continuous memory attacks Y Dodis, K Haralambiev, A López-Alt, D Wichs 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 511-520, 2010 | 311 | 2010 |
| Non-malleable codes S Dziembowski, K Pietrzak, D Wichs Journal of the ACM (JACM) 65 (4), 1-32, 2018 | 310 | 2018 |
| Fiat-Shamir: from practice to theory R Canetti, Y Chen, J Holmgren, A Lombardi, GN Rothblum, RD Rothblum, ... Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 291* | 2019 |
| Learning with rounding, revisited: New reduction, properties and applications J Alwen, S Krenn, K Pietrzak, D Wichs Annual cryptology conference, 57-74, 2013 | 290 | 2013 |
| Optimizing ORAM and using it efficiently for secure computation C Gentry, KA Goldman, S Halevi, C Julta, M Raykova, D Wichs International Symposium on Privacy Enhancing Technologies Symposium, 1-18, 2013 | 278 | 2013 |
| Public-key encryption in the bounded-retrieval model J Alwen, Y Dodis, M Naor, G Segev, S Walfish, D Wichs Annual International Conference on the Theory and Applications of …, 2010 | 271 | 2010 |
| Fully homomorphic message authenticators R Gennaro, D Wichs International Conference on the Theory and Application of Cryptology and …, 2013 | 243 | 2013 |
| Efficient public-key cryptography in the presence of key leakage Y Dodis, K Haralambiev, A López-Alt, D Wichs International Conference on the Theory and Application of Cryptology and …, 2010 | 235 | 2010 |
| Onion ORAM: A constant bandwidth blowup oblivious RAM S Devadas, M Van Dijk, CW Fletcher, L Ren, E Shi, D Wichs Theory of Cryptography Conference, 145-174, 2015 | 230 | 2015 |
| Obfuscating compute-and-compare programs under LWE D Wichs, G Zirdelis 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 212 | 2017 |
| Security analysis of pseudo-random number generators with input: /dev/random is not robust Y Dodis, D Pointcheval, S Ruhault, D Vergniaud, D Wichs Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013 | 197 | 2013 |
| Non-malleable extractors and symmetric key cryptography from weak secrets Y Dodis, D Wichs Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 194 | 2009 |
Yevgeniy DodisProfessor, New York UniversityVerified email at cs.nyu.edu
