David Balbás

¡Hola! I am David Balbás, a PhD student in Cryptography at IMDEA Software Institute in Madrid (Spain), advised by Dario Fiore. I am co-advised by Maribel González-Vasco and Claudio Soriente.

I joined IMDEA in October 2021. Before, I did my MSc Thesis at LASEC, EPFL in Lausanne (Switzerland). I also worked as a Cryptography Engineer at BERTEN.

I obtained a MSc in Theoretical Computer Science at KTH Royal Institute of Technology, Stockholm (Sweden). Previously, I completed a BSc in Mathematics and a BSc in Physics at University of Cantabria (Spain).

Interests

My current work focuses on cryptographic protocols for verifiable computation and their applications. More broadly, I am interested in foundational and applied cryptography, as well as in computer security, privacy, complexity theory, and mathematics.

I have a special interest in the following topics. Don't hesitate to reach out if you are interested!

  • Efficient (succinct) proofs of
    computation and zero-knowledge proofs
  • Cryptographic primitives for verifiable computation
  • Public-key cryptography with advanced functionalities
  • Security of (group) messaging protocols

Publications

2023
2022

Theses and Academic Projects

Teaching and Service

  • I am partially funded by an FPU Grant by "Ministerio de Universidades" of the Government of Spain (FPU21/00600).
  • I have been a Teaching Assistant in the courses:
    • Algorithms and Data Structures, BSc in Computer Science, Universidad Politécnica de Madrid, Autumn 2023
    • Programming II, BSc in Mathematics and Computer Science, Universidad Politécnica de Madrid, Spring 2023
    • Algorithms and Data Structures, BSc in Data Science, Universidad Politécnica de Madrid, Spring 2023
    • Computer Security, MSc in Computer Science, KTH Royal Institute of Technology, Autumn 2020
  • I have sub-reviewed papers for the conferences:
    • CRYPTO '22, '23
    • EUROCRYPT '23, '24

Contact Me

  • My email address is: david (dot) balbas (at) imdea.org
  • LinkedIn profile
  • My CV is available upon request.