me - pic  

Krisriyan Haralambiev

Ph.D. in Computer Science
Courant Institute of Mathematical Sciences
New York University

kkh[at]cs[dot]nyu[dot]edu
+1-646-736-7365



I earned my Ph.D. in March 2011.
As a student at New York University, I was a member of the Cryptography Group led by Victor Shoup and Yevgeniy Dodis. My research was focused on novel constructions and applications of efficient public key encryption schemes, digital signatures, and non-interactive zero-knowledge proofs. While at NYU, I interned at Google (summer 2006), got to work with the amazing cryptographers at NTT Corporation (summer 2009), visited the great cryptography group at ENS (spring 2010), and spent a productive and enjoyable summer at the Security Group of IBM Research, Zurich (summer 2010).

Before coming to NYU, I was a student at Faculty of Mathematics and Informatics, Sofia University "St. Kliment Ohridski". During my four years there, I got the chance to meet some of the brightest people in my country. Thanks to all of them, I was fortunate to experience an unique learning environment and to have many fruitful collaborations. And with two of them, we competed in the World Finals of the ACM International Collegiate Programming Contest in 2002 and 2004; to earn that, we had to win the SouthEastern European Programming Contest, becoming the champions in 2003 and coming second in 2001. Towards the end of my studies, I participated in the two-month Summer Workshop at the Center for Language and Speech Processing at the Johns Hopkins University and started to work with Prof. Ivan Landjev at the Institute of Mathematics and Informatics, Bulgarian Academy of Sciences.

While growing up in the beautiful seaside city of Burgas, Bulgaria, I also competed in many mathematics and computer science competitions; in particular, the International Olympiads in Informatics (IOI) in 1999 (bronze medal) and 2000 (silver medal).



Publications:

If you are interested in Structure-Preserving Cryptography, I encourage you to read my thesis as well as the line of work developed in the following papers: For a full list of my papers, please refer to DBLP or other online resources.