me - pic  

Kristiyan Haralambiev's Homepage

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

Contact:

New York University
Computer Science Department
251 Mercer Street
New York, NY 10012
+1-646-736-7365
kkh[at]cs[dot]nyu[dot]edu


Welcome to my homepage. My name is Kristiyan and I am privileged to be a Ph.D. student at the New York University Cryptography Group led by Victor Shoup and Yevgeniy Dodis. My research is 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). I obtained my M.S. degree from NYU in 2007 and will complete my Ph.D. this academic year (2010/11).

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:

  1. Cryptography Against Continuous Memory Attacks
    Yevgeniy Dodis, Kristiyan Haralambiev, Adriana Lopez-Alt, and Daniel Wichs
    In Proc. of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010)

  2. Signing on Elements in Bilinear Groups for Modular Protocol Design
    Masayuki Abe, Kristiyan Haralambiev, and Miyako Ohkubo
    appeared as a merge, Structure-Preserving Signatures and Commitments to Group Elements, with Georg Fuchsbauer and Jens Groth
    In Proc. of the 30th International Cryptology Conference (CRYPTO 2010)

  3. Efficient Public-Key Cryptography in the Presence of Key Leakage
    Yevgeniy Dodis, Kristiyan Haralambiev, Adriana Lopez-Alt, and Daniel Wichs
    In Proc. of the 16th International Conference on the Theory and Application of Cryptology (ASIACRYPT 2010)

  4. Efficient Message Space Extension for Automorphic Signatures
    Masayuki Abe, Kristiyan Haralambiev, and Miyako Ohkubo
    In Proc. of the 13th Information Security Conference (ISC 2010)

  5. Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
    Kristiyan Haralambiev, Tibor Jager, Eike Kiltz, and Victor Shoup
    In Proc. of 13th International Conference on Practice and Theory in Public Key Cryptography (PKC 2010)

  6. On Multiple Deletion Codes
    Kristiyan Haralambiev and Ivan Landjev
    Serdica Journal of Computing, 2007

  7. Scale Experiments for Semantic Labeling of Noun Phrases in Raw Text
    R.Basili, F.Zanzotto, K.Bontcheva, H.Cunningham, D.Guthrie, J.Cui, M.Cammisa, J.Liu, C.Martin, K.Haralambiev, M.Holub, K.Machery, and F.Jelinek
    In Proc. of the 4th Language, Resources, and Evaluation Conference (LREC 2004)

Teaching Assistant:


Coursework: