Contact Information

10 King's College Road, Rm 2301B
Sandford Fleming Building,
Toronto ON M5S 3G4.
(Mailing: Room=3302)
vinodv at cs dot toronto dot edu

Projects

Fully Homomorphic Encryption
Leakage-resilient Cryptography
Lattice-based Cryptography
Distributed Algorithms



































































































































































































































Vinod Vaikuntanathan
I am an assistant professor of Computer Science at the University of Toronto. In previous avatars, I have been a
I am primarily interested in Theoretical Cryptography. I maintain research interests in distributed algorithms as well as computer security.



News and Links |  Courses |  Program Committees |  Publications  

Interested in Graduate Studies at Toronto?

I am looking for strong, highly motivated graduate students who are interested in the cryptography, and computer and network security. If you fit this description, I urge you to apply to the Toronto CS graduate program. For a list of projects I am interested in these days (which includes leakage-resilient cryptography and fully homomorphic encryption, as well as others), see the project descriptions on the left panel and my publications below.

Interested in a Postdoc in Cryptography?

I am looking for postdocs interested in the theoretical and mathematical aspects of cryptography to start in Fall 2012 (or earlier). Please apply through this link. The deadline is December 15, 2011.

News and Links

Schedule for Spring 2012

  1. Talk at Princeton Center for Computational Intractability, February 3.
  2. DARPA PROCEED Meeting, February 22-24, Ft. Lauderdale, FL.
  3. Bellairs Workshop in Cryptography, March 4-9, Barbados.
  4. Newton Institute Workshop on "Formal and Computational Cryptographic Proofs", April 10-13, Cambridge, England.
  5. Penn State Summer School in Cryptography, May 30-June 1, State College, PA.

Courses

Program Committees

CRYPTO (2012, 2010), Eurocrypt (2012), Theory of Cryptography Conference TCC (2010, 2012)
Asiacrypt (2010), Security and Cryptography in Networks SCN (2010).

Conference and Journal Publications

    2012

  1. On-the-Fly Multiparty Computation on the Cloud via Multikey Fully Homomorphic Encryption
    A. Lopez-Alt, E. Tromer and V. Vaikuntanathan
    To appear in STOC 2012

  2. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
    G. Asharov, A. Jain, A. Lopez-Alt, E. Tromer, V. Vaikuntanathan and D. Wichs
    To appear in Eurocrypt 2012
    [ a Merge of this and this ]

  3. Collusion-resistant Obfuscation and Functional Re-encryption
    N. Chandran, M. Chase and V. Vaikuntanathan
    To appear in TCC 2012 [ pdf]

  4. How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption
    B. Parno, M. Raykova and V. Vaikuntanathan
    To appear in TCC 2012 [ pdf]

  5. Fully Homomorphic Encryption without Bootstrapping
    Z. Brakerski, C. Gentry and V. Vaikuntanathan
    To appear in Innovations in Theoretical Computer Science 2012 [pdf]

    2011

  6. Functional Encryption for Inner Product Predicates from Learning with Errors
    S. Agrawal, D. Freeman and V. Vaikuntanathan
    To appear in Asiacrypt 2011 [pdf]

  7. Efficient Fully Homomorphic Encryption from (Standard) LWE
    Z. Brakerski and V. Vaikuntanathan
    To appear in FOCS 2011 [pdf]
    Invited to the Special Issue of the SIAM Journal of Computing.

  8. Can Homomorphic Encryption be Practical?
    K. Lauter, M. Naehrig and V. Vaikuntanathan [working draft]
    To appear in the ACM Cloud Computing Security Workshop (CCSW) 2011.

  9. Fully Homomorphic Encryption from Ring LWE and Security for Key Dependent Messages
    Z. Brakerski and V. Vaikuntanathan
    To appear in CRYPTO 2011

  10. Round-optimal Password-based Key-exchange
    J. Katz and V. Vaikuntanathan
    TCC 2011
    Invited to the Special Issue of the Journal of Cryptology.

    2010

  11. A Group Signature Scheme from Lattice Assumptions
    S. Dov Gordon and J. Katz and V. Vaikuntanathan
    Asiacrypt 2010.

  12. Cryptography against continual Memory Leakage
    Z. Brakerski, Y. Kalai, J. Katz and V. Vaikuntanathan
    FOCS 2010.
    Cryptology Eprint Archive.

  13. i-hop Homomorphic Encryption Schemes
    C. Gentry, S. Halevi and V. Vaikuntanathan
    Cryptology Eprint Archive.
    CRYPTO 2010.

  14. Fully Homomorphic Encryption from Integers
    M. van Dijk, C. Gentry, S. Halevi and V. Vaikuntanathan
    Cryptology Eprint Archive.
    Eurocrypt 2010.
    Invited to the Special Issue of the Journal of Cryptology.

  15. A Simple BGN-Style Encryption Scheme from LWE
    C. Gentry, S. Halevi and V. Vaikuntanathan
    Eurocrypt 2010.

  16. Protecting against Computationally Bounded and Noisy Leakage
    S. Faust, T. Rabin, L. Reyzin, E. Tromer and V. Vaikuntanathan
    Eurocrypt 2010.

  17. Robustness of the Learning with Errors Assumption
    S. Goldwasser, Y. Kalai, C. Peikert and V. Vaikuntanathan
    Innovations in Computer Science (ICS) 2010. [pdf]

  18. Public-key Encryption Schemes with Auxiliary Inputs
    Y. Dodis, S. Goldwasser, Y. Kalai, C. Peikert and V. Vaikuntanathan
    Theory of Cryptography Conference (TCC) 2010. [pdf]

    2009

  19. Signature Schemes with Bounded Leakage Resilience
    J. Katz and V. Vaikuntanathan
    Asiacrypt 2009. [pdf]

  20. Smooth Projective Hashing and Password-based Authenticated Key-exchange from Lattices
    J. Katz and V. Vaikuntanathan
    Asiacrypt 2009. [pdf]

  21. Cryptography against Memory Attacks
    A. Akavia, S. Goldwasser and V. Vaikuntanathan
    TCC 2009. [pdf]

  22. Weak Verifiable Random Functions
    Z. Brakerski, S. Goldwasser, G. Rothblum and V. Vaikuntanathan
    TCC 2009. [pdf]

  23. How Efficient Can Memory-Checking Be?
    C. Dwork, M. Naor, G. Rothblum and V. Vaikuntanathan
    TCC 2009. [pdf]

    2008

  24. Trapdoors for Hard Lattices, and New Cryptographic Constructions
    C. Gentry, C. Peikert and V. Vaikuntanathan
    STOC 2008 [pdf]

  25. A Framework for Efficient and Composable Oblivious Transfer
    C. Peikert, V. Vaikuntanathan and B. Waters
    CRYPTO 2008 [pdf]

  26. Non-Interactive Statistical Zero-knowledge for Lattice Problems
    C. Peikert and V. Vaikuntanathan
    CRYPTO 2008 [pdf]

  27. Adaptive One-way Functions and Applications
    O. Pandey, R. Pass and V. Vaikuntanathan
    CRYPTO 2008 [pdf]

    2007

  28. Securely Obfuscating Re-encryption
    Susan Hohenberger, Guy Rothblum, abhi shelat, and Vinod Vaikuntanathan
    Theory of Cryptography Conference TCC 2007
    Journal of Cryptology (by Invitation)
    [Full Version ps, pdf]

  29. Secure Computation from Random Error-Correcting Codes
    R. Cramer, H. Chen, S. Goldwasser, R. de Haan and V. Vaikuntanathan
    Eurocrypt 2007 [ps, pdf]

  30. Bounded CCA2-Secure Encryption
    R. Cramer, G. Hanaoka, D. Hofheinz, H. Imai, E. Kiltz, R. Pass, A. Shelat and V. Vaikuntanathan
    Asiacrypt 2007 [ps, pdf]

  31. Relations Among Notions of Non-Malleability for Encryption
    R. Pass, A. Shelat and V. Vaikuntanathan
    Asiacrypt 2007 [ps, pdf]

  32. 2006

  33. Construction of a Non-Malleable Encryption Scheme From Any Semantically Secure One
    R. Pass, A. Shelat and V. Vaikuntanathan
    Crypto 2006 [ps, pdf]

  34. Fault-tolerant Distributed Computing in Full-Information Networks
    S. Goldwasser, E. Pavlov and V. Vaikuntanathan
    FOCS 2006 [ps, pdf]

  35. Byzantine Agreement in the Full-Information Model in O(log n) Rounds
    M. Ben-Or, E. Pavlov and V. Vaikuntanathan
    STOC 2006 [ps, pdf]

    2005

  36. Distributed Computing With Imperfect Randomness
    S. Goldwasser, M. Sudan and V. Vaikuntanathan
    DISC 2005 [ps, pdf]

  37. Broadcast in Radio Networks in the Presence of Byzantine Faults
    V. Vaikuntanathan
    Brief Announcement : PODC 2005 [Full Version ps, pdf]

    2004

  38. Information Leak in the Chord Lookup Protocol
    C.W. O'Donnell and V. Vaikuntanathan
    P2P 2004 [ps, pdf]

    2003

  39. Distributed Consensus in the Presence of Sectional Faults
    A. Aiyer, I. Sanketh, K. Srinathan, V. Vaikuntanathan and C. Pandu Rangan
    PODC 2003 [ps, pdf]

  40. Efficient Perfectly Secure Communication over Synchronous Networks
    K. Srinathan, V. Vaikuntanathan and C. Pandu Rangan
    PODC 2003 [ps, pdf]

  41. On the Power of Computational Secret Sharing
    A. Narayanan, K. Srinathan, V. Vaikuntanathan and C. Pandu Rangan
    Indocrypt 2003 [ps, pdf]

In Submission

  1. Private Information Retrieval in the Public-key Model
    Z. Brakerski and V. Vaikuntanathan

  2. Fuzzy Identity-based Encryption Schemes from Lattices
    S. Agrawal, X. Boyen, H. Wee, V. Vaikuntanathan and P. Voulgaris [pdf]

  3. Efficient Password-based Key-exchange from Oblivious Transfer
    R. Canetti, D. Dachman-Soled, V. Vaikuntanathan and H. Wee

  4. An Inspection-Resistant On-chip Memory Architecture
    Melissa Chase, Andrew Putnam, Tim Sherwood, Dan Shumow and V. Vaikuntanathan

Position Papers

  1. Trustworthy from Silicon Up
    Melissa Chase, Seny Kamara, Andrew Putnam, Tim Sherwood, Dan Shumow and Vinod Vaikuntanathan
    To appear in New Directions in Computer Architecture 2011.

  2. Policy Hiding for Private Handling of Sensitive Encrypted Data
    Nishanth Chandran, Melissa Chase, Kristin Lauter and Vinod Vaikuntanathan