Research Interests

As a theoretical computer scientist, I am motivated by real world challenges on the one hand and the beauty of mathematics and abstraction on the other. I have worked at various times in cryptography, complexity theory, computational number theory, probabilistic algorithms, and distributed computation. Some examples of research themes I have tackled are: how to incorporate randomness into the model and the design of efficiently verifiable mathematical proofs and use them to achieve secure communication protocols and a classification of the complexity of approximation problems; how to meaningfully relax the classical requirements made of a combinatorial testing algorithm to allow for error and gain feasibility in return. Currently I am interested in understanding the minimal requirements on the limits of efficient of computation, that will allow for secure communication.

Membership Type


Election Year


Primary Section

Section 34: Computer and Information Sciences

Secondary Section

Section 11: Mathematics