I am a Ph.D. candidate at the Theory of Computation
group of the Computer Science and Artificial Intelligence
Laboratory (CSAIL) at MIT.

I am incredibly fortunate to have Shafi Goldwasser as my advisor.
Previously, I completed an M.Sc.  at the Weizmann Institute
of Science under the superb supervision of Moni Naor.

I am graduating this year, here is a link to my CV.

Contact:
rothblum at csail dot mit dot edu
Guy Rothblum, 32 Vassar St. 32-G636, Cambridge MA 02139
Phone +1-617-253-7843*, Fax +1-617-258-8682

Publications

• Are PCPs Inherent in Efficient Arguments?
  Guy Rothblum and Salil Vadhan
  24th IEEE Conference on Computational Complexity (CCC 2009)
   
• On the Complexity of Differentially Private Data Release
  Cynthia Dwork, Moni Naor, Omer Reingold, Guy Rothblum and Salil Vadhan
  41st Annual ACM Symposium on Theory of Computing (STOC 2009)
     
• How Efficient can Memory Checking Be?
  Cynthia Dwork, Moni Naor, Guy Rothblum and Vinod Vaikuntanathan
  6th Theory of Cryptography Conference (TCC 2009)   
  ps    pdf
   
• Weak Verifiable Random Functions
  Zvika Brakerski, Shafi Goldwasser, Guy Rothblum and Vinod Vaikuntanathan
  6th Theory of Cryptography Conference (TCC 2009)   
  ps    pdf
   
• The Complexity of Local List-Decoding
  Dan Gutfreund and Guy Rothblum
  12th Intl. Workshop on Randomization and Computation (RANDOM 2008)
  ps    pdf
   
• One-Time Programs
  Shafi Goldwasser, Yael Tauman Kalai and Guy Rothblum
  28th International Cryptology Conference (CRYPTO 2008)
  ps    pdf
   
• Delegating Computation: Interactive Proofs for Muggles
  Shafi Goldwasser, Yael Tauman Kalai and Guy Rothblum
  40th Annual ACM Symposium on Theory of Computing (STOC 2008)   
  ps    pdf
   
• A (De)constructive Approach to Program Checking.
  Shafi Goldwasser, Dan Gutfreund, Alex Healy, Tali Kaufman and Guy Rothblum
  40th Annual ACM Symposium on Theory of Computing (STOC 2008)    
  ps    pdf
   
• Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.
  Ronen Gradwohl, Moni Naor, Benny Pinkas and Guy Rothblum
  Fun with Algorithms, 4th International Conference (FUN 2007)
  Invited to Theory of Computing Systems
  ps    pdf
   
• Verifying and Decoding in Constant Depth.
  Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman and Guy Rothblum
  39th Annual ACM Symposium on Theory of Computing (STOC 2007)   
  ps    pdf
   
• On Best-Possible Obfuscation.
  Shafi Goldwasser and Guy Rothblum
  4th Theory of Cryptography Conference (TCC 2007)
  Invited to the Journal of Cryptology   
  ps    pdf
   
• Securely Obfuscating Re-Encryption.
  Susan Hohenberger, Guy Rothblum, abhi shelat and Vinod Vaikuntanathan
  4th Theory of Cryptography Conference (TCC 2007)
  Invited to the Journal of Cryptology   
  ps    pdf
   
• Learning to Impersonate.
  Moni Naor and Guy Rothblum
  Machine Learning, In Proc 23rd International Conference (ICML 2006)   
  ps    pdf
   
• The Complexity of Online Memory Checking.
  Moni Naor and Guy Rothblum
  46th annual IEEE Symposium on Foundations of Computer Science (FOCS 2005)   
  To appear in the Journal of the ACM
  ps    pdf