Vinod Vaikuntanathan
Curriculum Vitae
IBM T.J. Watson Research Center ******@****.***.***
** ******* *****, **-***, Cell Phone: 617-***-****
Hawthorne, NY 10532, USA. O ce Phone: 914-***-****
Citizenship: Indian (H1-B Visa)
http://people.csail.mit.edu/vinodv/
Research Interests
Cryptography, Computer and Network Security, Theory of Distributed Systems.
Education
Massachusetts Institute of Technology
Ph.D. in Computer Science (with a minor in Mathematics), February 2009.
Advisor: Sha Goldwasser
Thesis: Randomized Algorithms for Reliable Broadcast
Massachusetts Institute of Technology
S.M. in Computer Science, September 2005.
Advisor: Sha Goldwasser
Thesis: Distributed Computing with Imperfect Randomness
Indian Institute of Technology, Madras
B.Tech. in Computer Science (with a minor in Physics), July 2003.
Advisor: Pandurangan Chandrasekaran
Thesis: On a Computational Notion of Secret-Sharing
Awards and Honors
George M. Sprowls Award for the best Ph.D. thesis in Computer Science, MIT, 2009.
(Nominated by the MIT EECS department for the ACM Doctoral Dissertation Competition)
IBM Joseph Raviv Postdoctoral Fellowship, 2008 2010.
MIT Akamai Presidential Fellowship, 2003 2004.
Rajiv Gandhi Research Fellowship, 2002.
JNCASR Summer Research Fellowship, Jawaharlal Nehru Center for Advanced Scien-
ti c Research (JNCASR), Bangalore, India, 2001.
1
Ranked Second in the Graduating Class of 2003 from the Indian Institute of Technology,
Madras, India.
Papers Invited to Special Issues
1. S. Hohenberger, G. Rothblum, A. Shelat and V. Vaikuntanathan, Securely Obfuscating
Re-Encryption. Invited to the Journal of Cryptology, special issue on selected papers
from the Theory of Cryptography Conference (TCC) 2007.
2. S. Goldwasser, M. Sudan and V. Vaikuntanathan, Distributed Computing with Imperfect
Randomness. Invited to the Distributed Computing Journal, special issue on selected
papers from the International Conference on Distributed Computing (DISC) 2005.
Work Experience
IBM Research, Hawthorne, NY, USA.
Position: Postdoctoral Researcher (September 2008 present)
Manager: Tal Rabin.
Stanford Research International (SRI), Menlo Park, CA, USA.
Position: Summer Intern (June 2007 September 2007)
Manager: Chris Peikert.
Teaching Assistantships
Automata, Computability and Complexity: MIT Undergraduate Course, Spring 05.
Cryptography and Computer Security: Summer Course for Professionals, Summer 05.
Cryptography and Cryptanalysis: MIT Graduate Course, Spring 06.
Randomness and Computation (Invited Lectures): MIT Graduate Course, Spring 06.
Computer and Network Security (Invited Lectures): MIT Graduate Course, Spring 08.
Scienti c Papers
In Submission
[1] Jonathan Katz and Vinod Vaikuntanathan. Round-optimal Password-based Authenti-
cated Key-Exchange. Submitted, 2009.
Refereed Conference Publications
[1] Marten van Dijk, Craig Gentry, Shai Halevi and Vinod Vaikuntanathan. Fully Homomorphic
Encryption from the Integers. To appear in the Proceedings of EuroCrypt 10. Available
at the Cryptology Eprint Archive http://eprint.iacr.org/2009/616.
2
[2] Craig Gentry, Shai Halevi and Vinod Vaikuntanathan. A Simple Lattice-based Scheme
that Supports Limited Homomorphisms. To appear in the Proceedings of EuroCrypt
10.
[3] Sebastian Faust, Tal Rabin, Leonid Reyzin, Eran Tromer and Vinod Vaikuntanathan. Pro-
tecting from Computationally Bounded and Noisy Leakage. To appear in the Pro-
ceedings of EuroCrypt 10.
[4] Sha Goldwasser, Yael Kalai, Chris Peikert and Vinod Vaikuntanathan. Robustness of the
Learning with Errors Assumption. In Proceedings of ICS 10 (Innovations in Computer
Science), 2010.
[5] Yevgeniy Dodis, Sha Goldwasser, Yael Kalai, Chris Peikert and Vinod Vaikuntanathan.
Public-key Encryption with Auxiliary Input. In Proceedings of TCC 10 (Theory of
Cryptography Conference), 2010.
[6] Jonathan Katz and Vinod Vaikuntanathan. Signatures Schemes with Bounded Leakage
Resilience. In Proceedings of AsiaCrypt 09, pages 703 720, 2009.
[7] Jonathan Katz and Vinod Vaikuntanathan. Universal Hash Proof Systems from Lattices
and Applications. In Proceedings of AsiaCrypt 09, pages 636 652, 2009.
[8] Adi Akavia, Sha Goldwasser and Vinod Vaikuntanathan. Simultaneous Hardcore Bits
and Cryptography against Memory Attacks. In Proceedings of TCC 09 (Theory of
Cryptography Conference), pages 474 495, 2009.
[9] Cynthia Dwork, Moni Naor, Guy Rothblum and Vinod Vaikuntanathan. How E cient can
Memory-Checking be? In Proceedings of TCC 09 (Theory of Cryptography Conference),
pages 503-520, 2009.
[10] Zvika Brakerski, Sha Goldwasser, Guy Rothblum and Vinod Vaikuntanathan. Weak Veri -
able Random Functions. In Proceedings of TCC 09 (Theory of Cryptography Conference),
pages 558-576, 2009.
[11] Craig Gentry, Chris Peikert and Vinod Vaikuntanathan. Trapdoors for Hard Lattices
and New Cryptographic Constructions. In STOC 08 (ACM Symposium on Theory of
Computing), pages 197 206, 2008.
[12] Chris Peikert, Vinod Vaikuntanathan and Brent Waters. A Framework for E cient and
Composable Oblivious Transfer. In Proceedings of CRYPTO 08, pages 554 571, 2008.
[13] Omkant Pandey, Rafael Pass and Vinod Vaikuntanathan. Adaptive One-way Functions
and Applications. In Proceedings of CRYPTO 08, pages 57 74, 2008.
[14] Chris Peikert and Vinod Vaikuntanathan. Non-Interactive Statistical Zero-knowledge
for Lattice Problems. In Proceedings of CRYPTO 08, pages 536 553, 2008.
[15] Hao Chen, Ronald Cramer, Sha Goldwasser, Robbert de Haan and Vinod Vaikuntanathan.
Secure Computation from Random Error-Correcting Codes. In Proceedings of Eu-
roCrypt 07, pages 291 310, 2007.
3
[16] Susan Hohenberger, Guy Rothblum, Abhi Shelat and Vinod Vaikuntanathan. Securely Ob-
fuscating Re-encryption. In Proceedings of TCC 07 (Theory of Cryptography Conference),
pages 233 252, 2007.
[17] Rafael Pass, Abhi Shelat and Vinod Vaikuntanathan. Relations among Notions of Non-
malleability for Encryption. In Proceedings of AsiaCrypt 07, pages 519 535, 2007.
[18] Ronald Cramer, Goichiro Hanaoka, Dennis Hofheinz, Hideki Imai, Eike Kiltz, Rafael Pass,
Abhi Shelat and Vinod Vaikuntanathan. Bounded CCA2-Secure Encryption. In Pro-
ceedings of AsiaCrypt 07, pages 502 518, 2007.
[19] Sha Goldwasser, Elan Pavlov and Vinod Vaikuntanathan. Fault-tolerant Distributed
Computing in the Full-information Model. In Proceedings of FOCS 06 (IEEE Sympo-
sium on Foundations of Computer Science), pages 15 26, 2006.
[20] Rafael Pass, Abhi Shelat and Vinod Vaikuntanathan. Construction of a Non-Malleable
Encryption Scheme from any Semantically Secure One. In Proceedings of CRYPTO
06, pages 271 289, 2006.
[21] Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan. Byzantine Agreement in the Full-
Information Model in O(log n) Rounds. In Proceedings of STOC 06 (ACM Symposium
on Theory of Computing), pages 179 186, 2006.
[22] Sha Goldwasser, Madhu Sudan and Vinod Vaikuntanathan. Distributed Computing
With Imperfect Randomness. In Proceedings of DISC 05 (International Symposium on
Distributed Computing), pages 288 302, 2005.
[23] Vinod Vaikuntanathan. Broadcast in Radio Networks tolerating Byzantine Faults. In
Proceedings of PODC 05 (ACM Symposium on Principles of Distributed Computing), pages
167, 2005.
[24] Charles O Donnell and Vinod Vaikuntanathan. Information Leak in the Chord Lookup
Protocol. In Proceedings of P2P 04 (IEEE International Conference on Peer-to-Peer Com-
puting), pages 28 35, 2004.
[25] Amitanand Aiyer, I. Sanketh, K. Srinathan, Vinod Vaikuntanathan and C. Pandurangan.
Distributed Consensus in the Presence of Sectional Faults. In Proceedings of PODC
03 (ACM Symposium on Principles of Distributed Computing), pages 202 210, 2003.
[26] K.Srinathan, V. Vinod and C. Pandurangan. E cient Perfectly Secure Communica-
tion over Synchronous Networks. In Proceedings of PODC 03 (ACM Symposium on
Principles of Distributed Computing), pages 252, 2003.
Selected Talks (Excluding Conference Presentations)
Invited Tutorial on Lattice-based Cryptography
MIT Crypto in the Clouds Workshop, August 2009.
4
Leakage-Resilient Cryptography
Penn State Theory Seminar, October 2009.
Rutgers Theory Seminar, November 2009.
Signature Schemes with Bounded Leakage Resilience
MIT Crypto in the Clouds Workshop, August 2009.
Public-key Encryption with Auxiliary Input
MIT Cryptography and Information Security Seminar, November 2009.
IBM T.J. Watson Cryptography Seminar, December 2009.
NYU Cryptography Seminar, November 2009.
Cryptography against Memory Attacks
MIT Cryptography and Information Security Seminar, March 2009.
IBM T.J. Watson Cryptography Seminar, March 2009.
Princeton Center for Information Technology Policy (CITP) Seminar, April 2009.
NYU Cryptography Seminar, March 2009.
Trapdoors for Hard Lattices and New Cryptographic Constructions
NYU Cryptography Seminar, November 2009.
SRI International, April 2008.
Caltech Computer Science Colloquium, March 2008.
University of Rochester Computer Science Colloquium, March 2008.
University of Toronto Theory Seminar, February 2008.
Technion Computer Science Theory Seminar, January 2008.
Weizmann Institute of Science Theory Seminar, January 2008.
Cornell University Theory Seminar, October 2007.
Columbia University Theory Seminar, December 2007.
How to Transfer Secrets, Obliviously and E ciently
Dagstuhl Seminar, December 2008.
MIT Cryptography and Information Security Seminar, February 2008.
Stanford Research International, August 2007.
Random Selection and Byzantine Agreement in the Full-Information Model
MIT Theory of Distributed Systems Seminar, March 2009.
Technion Theory Seminar, May 2007.
Centrum voor Wiskunde en Informatica (CWI) Theory Seminar, March 2007.
Weizmann Institute of Science Theory Seminar, February 2007.
Construction of a Non-Malleable Encryption Scheme
Tel-Aviv University Theory Seminar, April 2007.
IBM T.J. Watson Research Center, Hawthorne, NY, August 2006.
Professional Activities
Program Committees: CRYPTO 2010, Theory of Cryptography Conference (TCC) 2010, Se-
curity and Cryptography for Networks (SCN) 2010, AsiaCrypt 2010.
5
Journal Refereeing: SIAM Journal of Computing, Journal of Computer and Systems Sciences,
ACM Transactions on Information and Systems Security.
Conference Refereeing: STOC, FOCS, CRYPTO, EuroCrypt, Theory of Cryptography Con-
ference (TCC), PODC, SODA, Computational Complexity Conference (CCC).
6