Zvika Brakerski


I am a faculty member at the Department of Computer Science and Applied Mathematics of the Weizmann Institute of Science.

My research interests are foundations of computer science. I currently work mostly in cryptography.

I completed my Ph.D. right here at the department in 2011, advised by Prof. Shafi Goldwasser. I then spent two years as a Simons Postdoctoral Fellow at the Computer Science Department of Stanford University, hosted by Prof. Dan Boneh.

I received my M.Sc. from the Faculty of Engineering of Tel-Aviv University in 2002. My advisor was Prof. Boaz Patt-Shamir. Prior to that, in 2001, I received a joint B.Sc. from the Faculty of Engineering and the School of Computer Science of Tel-Aviv University.

Contact information:

Zvika Brakerski
Department of Computer Science and Applied Mathematics
Weizmann Institute of Science
Rehovot, 7610001
ISRAEL

Office: Ziskind Building, Room 109
Phone: +972 8 934-4550
Email: zvika.brakerski at weizmann.ac.il

 

Zvika Brakerski

 

Publications

  • Zvika Brakerski and Guy Rothblum
    Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
    TCC 2014.
    [Abstract] [PDF]

  • Zvika Brakerski and Guy Rothblum
    Black-Box Obfuscation for d-CNFs
    ITCS 2014.
    [Abstract] [PDF]

  • Zvika Brakerski and Vinod Vaikuntanathan
    Lattice-Based FHE as Secure as PKE
    ITCS 2014.
    [Abstract] [PDF]

  • Zvika Brakerski and Guy Rothblum
    Obfuscating Conjunctions
    CRYPTO 2013.
    [Abstract] [PDF]

  • Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev and Damien Stehlé
    Classical Hardness of Learning with Errors
    STOC 2013.
    [Abstract] [PDF]

  • Zvika Brakerski and Moni Naor
    Fast Algorithms for Interactive Coding
    SODA 2013.
    [Abstract] [PDF]

  • Zvika Brakerski, Craig Gentry and Shai Halevi
    Packed Ciphertexts in LWE-based Homomorphic Encryption
    PKC 2013.
    [Abstract] [PDF]

  • Zvika Brakerski
    When Homomorphism Becomes a Liability
    TCC 2013.
    [Abstract] [PDF]

  • Zvika Brakerski and Yael Tauman Kalai
    Efficient Interactive Coding Against Adversarial Noise
    FOCS 2012.
    [Abstract] [PDF]

  • Zvika Brakerski
    Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
    CRYPTO 2012.
    [Abstract] [PDF]

  • Zvika Brakerski, Craig Gentry and Vinod Vaikuntanathan
    (Leveled) Fully Homomorphic Encryption without Bootstrapping
    ITCS 2012.
    [Abstract] [PDF]

  • Zvika Brakerski and Vinod Vaikuntanathan
    Efficient Fully Homomorphic Encryption from (Standard) LWE
    FOCS 2011.
    [Abstract] [PDF]

  • Zvika Brakerski and Yael Tauman Kalai
    A Parallel Repetition Theorem for Leakage Resilience
    TCC 2012.
    [Abstract] [PDF]

  • Zvika Brakerski and Vinod Vaikuntanathan
    Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
    CRYPTO 2011.
    [Abstract] [PDF]

  • Zvika Brakerski and Gil Segev
    Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
    CRYPTO 2011.
    [Abstract] [PDF]

  • Zvika Brakerski, Jonathan Katz, Gil Segev and Arkady Yerukhimovich
    Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
    TCC 2011.
    [Abstract] [PDF]

  • Zvika Brakerski, Yael Tauman Kalai, Jonathan Katz and Vinod Vaikuntanathan
    Overcoming the Hole in the Bucket: Public-Key Cryptography Resilient to Continual Memory Leakage
    FOCS 2010.
    [Abstract] [PDF]

  • Zvika Brakerski and Shafi Goldwasser
    Circular and Leakage Resilient Public-Key Encryption Under Subgroup Indistinguishability
    (or: Quadratic Residuosity Strikes Back)
    CRYPTO 2010.
    [Abstract] [PDF]

  • Zvika Brakerski and Yael Tauman Kalai
    A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model
    Manuscript, 2010.
    [Abstract] [PDF]

  • Zvika Brakerski, Shafi Goldwasser and Yael Tauman Kalai
    Black-Box Circular-Secure Encryption Beyond Affine Functions
    TCC 2011.
    [Abstract] [PDF]

  • Zvika Brakerski and Boaz Patt-Shamir
    Distributed Discovery of Large Near-Cliques
    PODC 2009 (Brief Announcement), DISC 2009, Distributed Computing 2011.
    [Abstract] [PDF]

  • Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham and Scott Yilek
    Hedged Public-Key Encryption: How to Protect Against Bad Randomness
    ASIACRYPT 2009.
    [Abstract] [PDF]

  • Zvika Brakerski and Oded Goldreich
    From Absolute Distinguishability to Positive Distinguishability
    Studies in Complexity and Cryptography 2011 (Book Chapter).
    [Abstract] [PDF]

  • Zvika Brakerski, Shafi Goldwasser, Guy Rothblum and Vinod Vaikuntanathan
    Weak Verifiable Random Functions
    TCC 2009.
    [Abstract] [PDF]

  • Zvika Brakerski
    Local Property Restoring
    Manuscript, 2008.
    [Abstract] [PDF]

  • Zvika Brakerski and Boaz Patt-Shamir
    Jitter-Approximation Tradeoff for Periodic Scheduling
    IPDPS 2004, Wireless Networks 2006.
    [Abstract] [PDF]

  • Zvika Brakerski, Aviv Nisgav and Boaz Patt-Shamir
    General Perfectly Periodic Scheduling
    PODC 2002, Algorithmica 2006.
    [Abstract] [PDF]

  • Zvika Brakerski, Vladimir Dreizin and Boaz Patt-Shamir
    Dispatching in Perfectly-Periodic Schedules
    J. Algorithms 2003.
    [Abstract] [PDF]

Program Committees

  • Annual Cryptology Conference - EUROCRYPT 2014.
  • Annual Cryptology Conference - CRYPTO 2013.
  • Workshop on Applied Homomorphic Cryptography - WAHC 2013. (Associated with Financial Crypto & Data Security 2013.)

Theses

  • Cryptographic Methods for the Clouds
    Ph.D. Dissertation, Weizmann Institute of Science, 2011.
    [PDF]

  • General Perfectly Periodic Scheduling
    M.Sc. Dissertation, Tel-Aviv University, 2002.
    [PDF]

Misc.

 

Page design shamelessly copied (with permission) from Gil Segev.

tumblr page counter