| Simultaneous hardcore bits and cryptography against memory attacks A Akavia, S Goldwasser, V Vaikuntanathan Theory of cryptography conference, 474-495, 2009 | 557 | 2009 |
| Proving hard-core predicates using list decoding A Akavia, S Goldwasser, S Safra FOCS 44, 146-159, 2003 | 144 | 2003 |
| On basing one-way functions on NP-hardness A Akavia, O Goldreich, S Goldwasser, D Moshkovitz Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 97 | 2006 |
| Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions. A Akavia COLT, 381-393, 2010 | 63 | 2010 |
| Perturbation codes A Akavia, R Venkatesan 2008 46th Annual Allerton Conference on Communication, Control, and …, 2008 | 54* | 2008 |
| Candidate weak pseudorandom functions in AC0 ○ MOD2 A Akavia, A Bogdanov, S Guo, A Kamath, A Rosen Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 49 | 2014 |
| Solving hidden number problem with one bit oracle and advice A Akavia Annual International Cryptology Conference, 337-354, 2009 | 27 | 2009 |
| Secure search on encrypted data via multi-ring sketch A Akavia, D Feldman, H Shaul Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 25* | 2018 |
| Distributed public key schemes secure against continual leakage A Akavia, S Goldwasser, C Hazay Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 25 | 2012 |
| Deterministic sparse Fourier approximation via approximating arithmetic progressions A Akavia IEEE Transactions on Information Theory 60 (3), 1733-1741, 2013 | 22 | 2013 |
| Topology-hiding computation on all graphs A Akavia, R LaVigne, T Moran Journal of Cryptology 33 (1), 176-227, 2020 | 20 | 2020 |
| Topology-hiding computation beyond logarithmic diameter A Akavia, T Moran Annual International Conference on the Theory and Applications of …, 2017 | 18 | 2017 |
| Setup-free secure search on encrypted data: Faster and post-processing free A Akavia, C Gentry, S Halevi, M Leibovich Cryptology ePrint Archive, 2018 | 17 | 2018 |
| Privacy-preserving decision trees training and prediction A Akavia, M Leibovich, YS Resheff, R Ron, M Shahar, M Vald Joint European Conference on Machine Learning and Knowledge Discovery in …, 2020 | 16* | 2020 |
| Learning noisy characters, multiplication codes, and cryptographic hardcore predicates A Akavia Massachusetts Institute of Technology, 2008 | 16 | 2008 |
| Linear-regression on packed encrypted data in the two-server model A Akavia, H Shaul, M Weiss, Z Yakhini Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied …, 2019 | 14 | 2019 |
| Erratum for: On basing one-way functions on NP-hardness A Akavia, O Goldreich, S Goldwasser, D Moshkovitz Proceedings of the forty-second ACM symposium on Theory of computing, 795-796, 2010 | 10 | 2010 |
| Secure data retrieval on the cloud: Homomorphic encryption meets coresets A Akavia, D Feldman, H Shaul IACR Transactions on Cryptographic Hardware and Embedded Systems, 80-106, 2019 | 6 | 2019 |
| Finding significant Fourier transform coefficients deterministically and locally A Akavia Electronic Colloquium on Computational Complexity (ECCC) 15, 102, 2008 | 4 | 2008 |
| On the Privacy of Protocols based on CPA-Secure Homomorphic Encryption A Akavia, M Vald Cryptology ePrint Archive, 2021 | 3 | 2021 |
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of TechnologyVerified email at csail.mit.edu
