Prospective Ph.D. Students

I am recruiting Ph.D. students to join my group at King’s College London. If you are a prospective candidate, I invite you to read this page before contacting me for Ph.D. opportunities.

My Research Area

My main area of expertise is at the intersection of systems security and machine learning, with emphasis on network security and malware analysis. My research aims to design cybersecurity solutions able to learn behavioral models that can be used to detect novel attacks and threats, and that generate interpretable decisions to assist security analysts in protecting systems and organizations. I am particularly interested in challenging scenarios such as unsupervised learning (e.g., no a-priori attack examples), fast evolving threats (high non-stationarity), and smart adversaries (adversarial ML attacks). To get a better idea of the type of research I do, and to see if you like it, I recommend you to read/skim some of my papers: on intrusion detection (a, b), and malware classification and evasion (c, d, e).

I am looking to solve problems in many domains with incoming students, including (but not limited to):

For Candidates

I am looking for candidates with a BSc/MSc in Computer Science (or analogous), and a strong mathematical and systems security background. Passion and commitment may partially compensate for background deficiencies in either of these two (but hardly for both). You need to be comfortable with scripting and coding, preferably in one or more of Python/Java/C/C++. You must hold a genuine interest with my research agenda, and in improving the state-of-the-art through top-quality publications.

Getting a Ph.D. is extremely challenging and, often times, frustrating. Experiments take long hours and often do not work out as expected. Top conferences have an acceptance rate of 10-15%, which means you will face a lot of rejections. Creating new knowledge is extremely rewarding, but requires creativity, persistence and motivation. This is part of the reason for which I am considering only full-time applications at this point in time.

How to Apply

If you are interested in doing a Ph.D. in Computer Science under my supervision at King’s College London, and if you are still keen to after reading the premise above, you should definitely write me an e-mail with your CV and interests (be sure to read all of this page before sending). Nevertheless, it would be extremely useful if you could also take the time to fill this form before sending me an e-mail. Since I am receiving an increasing number of applications, this form greatly helps me in understanding candidates expertise, interests and motivations.

If I believe that there is a good match between us, I can write a letter to support your application at KCL Ph.D. Program, where you can indicate me as your prospective supervisor. I also offer project(s) within the CDT in Safe & Trusted AI. You will still be evaluated by a committee, and your admission does not arbitrarily depend on me, but having a support letter from an academic may increase your chances of being admitted.

Research Opportunities for Undergraduate Students

I occasionally have research opportunities for self-contained projects for undergraduate students. If you are a student at King’s, you may be interested in looking more into KURF.

Research Visitors

I am happy to host Ph.D. students and PostDocs as visitors, if there is a common research interest. King’s College London has an internal program for supporting research visitors.

Important Note

If you insert “Bahamut 3.0” in your e-mail subject line when contacting me, after filling this form, I will know you have read this page, and you will definitely receive a reply from me. Failing to insert this keyword in the subject line and not filling the form may result in your e-mail getting lost in my inbox: I receive a lot of e-mails from prospective graduate students, and sometimes it is hard for me to understand which ones are out of genuine interest in joining my group, or just a “copy-paste” spammed to a lot of professors.