Adrien's Dashbook

Constant-Time client-side FHE operations

Fri, 20 Jun 2025 00:00:00 +0000

This paper was written under the supervision of Ph. D. candidate Christian Knabenhans and Prof. Carmela Troncoso from SPRING Lab at EPFL and is available in PDF format here.

Introduction

The development of quantum computers presents a significant threat to classical Public-Key cryptographic systems. Many widely deployed cryptographic primitives, such as RSA, Diffie-Hellman, and Elliptic Curve Cryptography (ECC)—rely on the hardness of integer factorization or the discrete logarithm problem. These problems are vulnerable to quantum computers, and therefore enhance research on post-quantum cryptographic scheme.

Bienvenue on my website

Sun, 23 Feb 2025 11:50:27 +0100

This site serves as my journal, on which I share things that intrigue me, as well as my portfolio, where I publish the different (academic) papers I’ve written, or my resume.

Please don’t hesitate to contact me if you have any advices or comments ;)

About

Sat, 22 Feb 2025 16:03:14 +0100

I am a Swiss-French student presently enrolled a Joint Master’s degree in Cybersecurity (Computer Science) between the Swiss Federal Institutes of Technology in Lausanne (EPFL) and Zurich (ETHZ), since September 2023. While pursuing my Master’s degree, my main interests were Cryptography, Information Security, Software Security, Privacy Engineering, Machine Learning and Network Security. Prior to that, I completed my Bachelor’s degree in Computer Science with an emphasis on Software Engineering, Theory of Computation and Mathematics, at EPFL between 2020 and 2023.

Building a robust test suite of type confusion vulnerabilities

Fri, 07 Jun 2024 00:00:00 +0000

This paper was written under the supervision of Ph. D. candidate Nicolas Badoux and Prof. Doc. sc. ETH Mathias Payer from HexHive Lab at EPFL and is available in PDF format on this repository.

Implementing a Query Count Estimation

Fri, 09 Jun 2023 00:00:00 +0000

This paper was written under the supervision of Ph. D. candidates Solal Pirelli and Can Cebeci from DSLAB at EPFL and is available in PDF format on this repository.

Introduction

When you’re trying to test code, symbolic execution is an effective way of doing this by automatically generating tests and finding bugs. However, its cost in terms of performance can be heavy due to path explosion and this state explosion. To counter this problem, one approach is to merge states obtained on different paths in order to reduce the total exploration cost. However, merging two states can potentially increase costs and therefore decrease performance rather than the opposite. In order to determine which states to merge or not, researchers at the Dependable Systems Lab (DSLAB) at the Ecole Polytechnique Fédéral de Lausanne (EPFL) have published “Efficient State Merging in Symbolic Execution” in 2012 [1], in which they present two methods for reducing costs of state merging, especially deployed on KLEE, a symbolic execution engine [2]. The first one is a query count estimation which computes the impact of each symbolic variable on solver queries and indicates which one provides benefits to merge. The second one is dynamic state merging which “interacts favorably with search strategies in automated test case generation and bug finding tools”. In this report, we will be working on an implementation of the query count estimation based on its description. The goal of the report is first to explain the implementation of the LLVM pass [3] chosen to be as close as possible to that described in the paper, and then to test its effectiveness and robustness on different examples and the GNU COREUTILS. [4]