Adi Akavia	Contacts: first name dot last name at weizmann.ac.il The Weizmann Institute of Science Rehovot Israel +972-8-9344312
I am currently a post-doctoral researcher at the Weizmann Institute of Science (2009-2011), hosted by Prof. Irit Dinur. Previously, I was a post-doctoral researcher at IAS-DIMACS (2007-2009), hosted by Prof. Avi Wigderson and Prof. Steve Miller. Before that, I did my PhD at MIT (2003-2007) under the supervision of Prof. Shafi Goldwasser. I'm interested in cryptography, complexity, error-correcting codes and sub-linear time algorithms.

---

Research Papers

A. Akavia, S. Goldwasser, C. Hazay
Distributed Public Key Cryptography Resilient to Continual Leakage
Submitted, Sept 2010

A. Akavia
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
23^rd Conference on Learning Theory, June 2010 (COLT10) pdf

A. Akavia
Solving Hidden Number Problem with One Bit Oracle and Advice
Proceedings of the 29^th Annual International Cryptology Conference, pages 337-354, August 2009 (Crypto09) pdf

A. Akavia, S. Goldwasser and V. Vaikuntanathan
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
Proceedings of the 6^th Theory of Cryptography Conference, January 2009 (TCC09) pdf

A. Akavia
Very Local Self Correcting of Homomorphism and Multiplication Codes
DIMACS Workshop on Property Testing, Rutgers, NJ, March 30 - April 2, 2009

A. Akavia and R. Venkatesan
Perturbation Codes
Proceedings of the 46^th Annual Allerton Conference, Sept 2008 (Allerton08) pdf

A. Akavia, O. Goldreich, S. Goldwasser and D. Moshkovitz
On Basing One-Way Functions on NP-Hardness
Proceedings of the 38^th annual ACM symposium on Theory of Computing, pages 701-710, May 2006 (STOC06)
pdf. errata.

A. Akavia, S. Goldwasser and S. Safra
Proving Hard-Core Predicates Using List Decoding,
Proceedings of the 44^th Annual IEEE Symposium on Foundations of Computer Science, pages 146-157, October 2003 (FOCS03) pdf

A. Akavia, H. Senderowitz, A. Lerner and R. Shamir
Designing Multi-Route Synthesis in Combinatorial Chemistry,
Journal of Combinatorial Chemistry Vol. 6 No. 4 pp 540-548, 2004 pdf

Surveys and Dissertations

A. Akavia
Approximating Significant Fourier Coefficients
The Encyclopedia of Algorithms, Springer-Verlag, 2008. pdf

My Ph.D. thesis:
Learning Noisy Characters, Multiplication Codes and Hardcore Predicates.
MIT, February 2008 pdf

My M.Sc. thesis:
Designing Multi-Route Synthesis in Combinatorial Chemistry-Complexity and Algorithms
Tel Aviv University, January 2003

Manuscripts

A. Akavia, T. Malkin and A. Wan
On the Hardness of Hardness of Learning

A. Akavia and S. Safra
On the Complexity of Flexible Approximation Problems
Manuscript, 2002

Teaching

Topics in Error Correcting Codes, Rutgers University, Spring 2009