Dr. Brakerski’s scientific interest lies in information security, cryptography, and encryption. The most attractive encryption form of all is “fully homomorphic encryption” (FHE). This yet-to-be-fully-realized encryption scheme is a holy grail of modern cryptography. It could be used, for example, to make stored data unintelligible to the remote host server while still available for usage by the owners of the information. Dr. Brakerski’s main research goal is to make FHE as easy to use and understand as the RSA algorithm, the most widely used algorithm for securing Internet, banking, and credit card transactions. Together with colleagues, he has already successfully put FHE on solid theoretical ground and has provided the means to achieve efficient schemes, bringing FHE closer to real-life applications. Most impressively, Dr. Brakerski’s FHE algorithms form the basis for all modern implementations of FHE. Other issues he is addressing include leakage resilient encryption, circular security problems, interactive information theory, and interactive coding problems.
Dr. Brakerski’s academic and professional honors include the Tel Aviv University Rector Award in 1998 and 1999, the Check Point Award and Scholarship in 2000, the Knesset (Israeli Parliament) Award in 2000, the Wolf Foundation Scholarship in 2001, the Intel Israel Award for MSc students in 2002, the Check Point Institute for Information Security Award in 2011, and the Simons Postdoctoral Fellowship in 2011.