| Simultaneous hardcore bits and cryptography against memory attacks A Akavia, S Goldwasser, V Vaikuntanathan Theory of cryptography conference, 474-495, 2009 | 445 | 2009 |
| Proving hard-core predicates using list decoding A Akavia, S Goldwasser, S Safra FOCS 44, 146-159, 2003 | 118 | 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 | 61 | 2006 |
| Low dimensional spectral concentration codes and direct list decoding R Venkatesan, A Akavia US Patent 7,941,726, 2011 | 47 | 2011 |
| Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions. A Akavia COLT, 381-393, 2010 | 45 | 2010 |
| Candidate weak pseudorandom functions in AC0○ MOD2. A Akavia, A Bogdanov, S Guo, A Kamath, A Rosen Electronic Colloquium on Computational Complexity (ECCC) 21, 33, 2014 | 21 | 2014 |
| Solving hidden number problem with one bit oracle and advice A Akavia Annual International Cryptology Conference, 337-354, 2009 | 21 | 2009 |
| 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 | 19 | 2012 |
| Deterministic sparse Fourier approximation via approximating arithmetic progressions A Akavia IEEE Transactions on Information Theory 60 (3), 1733-1741, 2014 | 16 | 2014 |
| Learning noisy characters, multiplication codes, and cryptographic hardcore predicates A Akavia Massachusetts Institute of Technology, 2008 | 15 | 2008 |
| Topology-hiding computation beyond logarithmic diameter A Akavia, T Moran Annual International Conference on the Theory and Applications of …, 2017 | 8 | 2017 |
| Topology-hiding computation on all graphs A Akavia, R LaVigne, T Moran Annual International Cryptology Conference, 447-467, 2017 | 6 | 2017 |
| 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 | 4 | 2010 |
| Finding significant fourier transform coefficients deterministically and locally A Akavia Electronic Colloquium on Computational Complexity (ECCC) 15 (102), 2008 | 3 | 2008 |
| Perturbation codes A Akavia, R Venkatesan 2008 46th Annual Allerton Conference on Communication, Control, and …, 2008 | 3 | 2008 |
| Secure search on the cloud via coresets and sketches A Akavia, D Feldman, H Shaul arXiv preprint arXiv:1708.05811, 2017 | 2 | 2017 |
| Learning heavy fourier coefficients S Goldwasser, A Akavia, S Safra US Patent App. 11/119,888, 2005 | 2 | 2005 |
| Secure Search via Multi-Ring Fully Homomorphic Encryption. A Akavia, D Feldman, H Shaul IACR Cryptology ePrint Archive 2018, 245, 2018 | 1 | 2018 |
| Explicit small sets with ε-discrepancy on Bohr sets A Akavia Information Processing Letters 114 (10), 564-567, 2014 | 1 | 2014 |
| Setup-Free Secure Search on Encrypted Data: Faster and Post-Processing Free A Akavia, C Gentry, S Halevi, M Leibovich Cryptology ePrint Archive, Report 2018/1235, 2018. https://eprint. iacr. org …, 0 | 1 | |
Vinod VaikuntanathanAssociate Professor of Computer Science, Massachusetts Institute of TechnologyVerified email at csail.mit.edu
