Daphné Trama
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Daphné Trama has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Aymen Boudguiga
Université Paris-Saclay, CEA-List, Palaiseau, France
4 shared publications - Renaud Sirdey
Université Paris-Saclay, CEA, List
4 shared publications - Nicolas Bon
CryptoExperts
1 shared publication - Nicolas Ye
Université Paris-Saclay, CEA List
1 shared publication - Pierre-Emmanuel Clet
Université Paris-Saclay, CEA-List, France
1 shared publication - Pierre-Emmanuel Clet
Université Paris-Saclay, CEA-List, Palaiseau, France
1 shared publication
Latest Publications
- 9 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Designing a universal homomorphic instruction set and applications to transciphering with TFHE
Conception d'un jeu d'instructions homomorphe universel et applications au transchiffrement avec TFHE: Avec l'émergence d'internet et le flux grossissants de communications que cela entraîne, conserver la confidentialité des données communiquées reste un enjeu majeur pour la vie privée des utilisateurs. Jusqu'à présent, la confidentialité est assurée lors du transfert, et parfois du stockage de nos données à des serveurs distants. En revanche, dès que nous souhaitons faire appel à un serveur distant pour appliquer des calculs à nos données (par exemple appliquer un filtre sur une photo), celui-ci doit les déchiffrer pour procéder aux manipulations souhaitées. Un attaquant qui aurait accès aux serveurs de tels fournisseurs de service aurait donc un accès aux données non protégées des utilisateurs.Une solution pour répondre à cette faille de sécurité est d'utiliser le chiffrement homomorphe. Ce nouveau type de chiffrement permet en effet d'effectuer des calculs directement sur les données chiffrées: plus besoin de déchiffrer pour calculer, nos données sont donc protégées de bout en bout !Cependant, aussi idyllique que paraisse cette solution, quelques freins subsistent à son déploiement. En effet, les chiffrés homomorphes sont très lourds (plusieurs milliers d'octets pour seulement quelques bits d'information) ce qui a des conséquences sur le temps d'exécution des calculs et la quantité de mémoire nécessaire à leur bon déroulement.Dans cette thèse, nous étudions un procédé appelé "transchiffrement" qui permet de réduire la borne passante utilisée pour l'envoi de données homomorphes, ce qui a pour effet secondaire d'également réduire le délai d'attente lors de l'envoi de données. En particulier, nous nous concentrons sur les chiffrements par bloc tels que l'AES.Dans un deuxième temps, nous proposons un jeu d'instruction universel pour processeur homomorphe. C'est-à-dire, nous construisons un jeu d'instruction qui fonctionne sur données chiffrées. Notre processeur permet d'effectuer n'importe quel algorithme avec des latences compétitives avec l'état de l'art.En résumé, nous proposons des améliorations du cryptosystème homomorphe TFHE en étudiant différentes méthodes de transchiffrement, différents chiffrements à bloc et en créant un jeu d'instructions universel compétitif avec l'état de l'art en terme de latence et qui permet l'évaluation de n'importe quel algorithme de façon facilité par rapport aux approches standards.
- 9 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Designing a universal homomorphic instruction set and applications to transciphering with TFHE
Conception d'un jeu d'instructions homomorphe universel et applications au transchiffrement avec TFHE: Avec l'émergence d'internet et le flux grossissants de communications que cela entraîne, conserver la confidentialité des données communiquées reste un enjeu majeur pour la vie privée des utilisateurs. Jusqu'à présent, la confidentialité est assurée lors du transfert, et parfois du stockage de nos données à des serveurs distants. En revanche, dès que nous souhaitons faire appel à un serveur distant pour appliquer des calculs à nos données (par exemple appliquer un filtre sur une photo), celui-ci doit les déchiffrer pour procéder aux manipulations souhaitées. Un attaquant qui aurait accès aux serveurs de tels fournisseurs de service aurait donc un accès aux données non protégées des utilisateurs.Une solution pour répondre à cette faille de sécurité est d'utiliser le chiffrement homomorphe. Ce nouveau type de chiffrement permet en effet d'effectuer des calculs directement sur les données chiffrées: plus besoin de déchiffrer pour calculer, nos données sont donc protégées de bout en bout !Cependant, aussi idyllique que paraisse cette solution, quelques freins subsistent à son déploiement. En effet, les chiffrés homomorphes sont très lourds (plusieurs milliers d'octets pour seulement quelques bits d'information) ce qui a des conséquences sur le temps d'exécution des calculs et la quantité de mémoire nécessaire à leur bon déroulement.Dans cette thèse, nous étudions un procédé appelé "transchiffrement" qui permet de réduire la borne passante utilisée pour l'envoi de données homomorphes, ce qui a pour effet secondaire d'également réduire le délai d'attente lors de l'envoi de données. En particulier, nous nous concentrons sur les chiffrements par bloc tels que l'AES.Dans un deuxième temps, nous proposons un jeu d'instruction universel pour processeur homomorphe. C'est-à-dire, nous construisons un jeu d'instruction qui fonctionne sur données chiffrées. Notre processeur permet d'effectuer n'importe quel algorithme avec des latences compétitives avec l'état de l'art.En résumé, nous proposons des améliorations du cryptosystème homomorphe TFHE en étudiant différentes méthodes de transchiffrement, différents chiffrements à bloc et en créant un jeu d'instructions universel compétitif avec l'état de l'art en terme de latence et qui permet l'évaluation de n'importe quel algorithme de façon facilité par rapport aux approches standards.
- Open Access
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
Running Standard Block Ciphers Beyond AES with TFHE: Experiments and Lessons Learnt
The dream of achieving data privacy during external computations has become increasingly concrete in recent years. Indeed, since the early days of Fully Homomorphic Encryption (FHE) more than a decade ago, new cryptosystems and techniques have constantly optimized the efficiency of computation on encrypted data. However, one of the main disadvantages of FHE, namely its significant ciphertext expansion factor, remains at the center of the efficiency bottleneck of FHE schemes. To tackle the issue of slow uplink FHE data transmission, we use transciphering. With transciphering, the client naturally encrypts its data under a symmetric scheme and sends them to the server with (once and for all) an FHE encryption of the symmetric scheme's key. With its larger computing power, the server then evaluates the symmetric scheme's decryption algorithm within the homomorphic domain to obtain homomorphic ciphertexts that allow it to perform the requested calculations. Since the first use of this method a bit more than ten years ago, papers on the homomorphic evaluation of AES have been numerous. And as the AES execution is the application chosen by NIST in the FHE part of its recent call for proposals on threshold encryption, the stakes of such work go up another level. But what about other standardized block ciphers? Is the AES the more efficient option? In this work, we leverage on two methods which have successfully been applied to the homomorphic evaluation of AES to study several state-of-the-art symmetric block ciphers (namely CLEFIA, PRESENT, PRINCE, SIMON, SKINNY). That is to say, we implement a representative set of symmetric block ciphers using TFHE. These implementations allow us to compare the efficiency of this set of symmetric schemes and to categorize them. We highlight the characteristics of block ciphers that are fast to execute in the homomorphic domain and those that are particularly costly. Finally, this classification of operation types enables us to sketch out what the ideal block cipher for transciphering homomorphic data in integer mode might look like.
- 8 January 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (4)
Open AccessRunning Standard Block Ciphers Beyond AES with TFHE: Experiments and Lessons Learnt
The dream of achieving data privacy during external computations has become increasingly concrete in recent years. Indeed, since the early days of Fully Homomorphic Encryption (FHE) more than a decade ago, new cryptosystems and techniques have constantly optimized the efficiency of computation on encrypted data. However, one of the main disadvantages of FHE, namely its significant ciphertext expansion factor, remains at the center of the efficiency bottleneck of FHE schemes. To tackle the issue of slow uplink FHE data transmission, we use transciphering. With transciphering, the client naturally encrypts its data under a symmetric scheme and sends them to the server with (once and for all) an FHE encryption of the symmetric scheme's key. With its larger computing power, the server then evaluates the symmetric scheme's decryption algorithm within the homomorphic domain to obtain homomorphic ciphertexts that allow it to perform the requested calculations. Since the first use of this method a bit more than ten years ago, papers on the homomorphic evaluation of AES have been numerous. And as the AES execution is the application chosen by NIST in the FHE part of its recent call for proposals on threshold encryption, the stakes of such work go up another level. But what about other standardized block ciphers? Is the AES the more efficient option? In this work, we leverage on two methods which have successfully been applied to the homomorphic evaluation of AES to study several state-of-the-art symmetric block ciphers (namely CLEFIA, PRESENT, PRINCE, SIMON, SKINNY). That is to say, we implement a representative set of symmetric block ciphers using TFHE. These implementations allow us to compare the efficiency of this set of symmetric schemes and to categorize them. We highlight the characteristics of block ciphers that are fast to execute in the homomorphic domain and those that are particularly costly. Finally, this classification of operation types enables us to sketch out what the ideal block cipher for transciphering homomorphic data in integer mode might look like.
- Open Access
- 8 April 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (1)
Further Improvements in AES Execution over TFHE
Making the most of TFHE advanced capabilities such as programmable or circuit bootstrapping and their generalizations for manipulating data larger than the native plaintext domain of the scheme is a very active line of research. In this context, AES is a particularly interesting benchmark, as an example of a nontrivial algorithm which has eluded “practical” FHE execution performances for years, as well as the fact that it will most likely be selected by NIST as a flagship reference in its upcoming call on threshold (homomorphic) cryptography. Since 2023, the algorithm has thus been the subject of a renewed attention from the FHE community and has served as a playground to test advanced operators following the LUT-based, p-encodings or several variants of circuit bootstrapping, each time leading to further timing improvements. Still, AES is also interesting as a benchmark because of the tension between boolean- and byte-oriented operations within the algorithm. In this paper, we resolve this tension by proposing a new approach, coined “Hippogryph”, which consistently combines the (byte-oriented) LUT-based approach with a generalization of the (boolean-oriented) p -encodings one to get the best of both worlds. In doing so, we obtain the best timings so far, getting a single-core execution of the algorithm over TFHE from 46 down to 32 seconds and approaching the 1 second barrier with only a mild amount of parallelism. We should also stress that all the timings reported in this paper are consistently obtained on the same machine which is often not the case in previous studies. Lastly, we emphasize that the techniques we develop are applicable beyond just AES since the boolean-byte tension is a recurrent issue when running algorithms over TFHE.
- 8 April 2025
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 2 (1)
Open AccessFurther Improvements in AES Execution over TFHE
Making the most of TFHE advanced capabilities such as programmable or circuit bootstrapping and their generalizations for manipulating data larger than the native plaintext domain of the scheme is a very active line of research. In this context, AES is a particularly interesting benchmark, as an example of a nontrivial algorithm which has eluded “practical” FHE execution performances for years, as well as the fact that it will most likely be selected by NIST as a flagship reference in its upcoming call on threshold (homomorphic) cryptography. Since 2023, the algorithm has thus been the subject of a renewed attention from the FHE community and has served as a playground to test advanced operators following the LUT-based, p-encodings or several variants of circuit bootstrapping, each time leading to further timing improvements. Still, AES is also interesting as a benchmark because of the tension between boolean- and byte-oriented operations within the algorithm. In this paper, we resolve this tension by proposing a new approach, coined “Hippogryph”, which consistently combines the (byte-oriented) LUT-based approach with a generalization of the (boolean-oriented) p -encodings one to get the best of both worlds. In doing so, we obtain the best timings so far, getting a single-core execution of the algorithm over TFHE from 46 down to 32 seconds and approaching the 1 second barrier with only a mild amount of parallelism. We should also stress that all the timings reported in this paper are consistently obtained on the same machine which is often not the case in previous studies. Lastly, we emphasize that the techniques we develop are applicable beyond just AES since the boolean-byte tension is a recurrent issue when running algorithms over TFHE.
- Open Access
- 26 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 79-90
A Homomorphic AES Evaluation in Less than 30 Seconds by Means of TFHE
Since the pioneering work of Gentry, Halevi, and Smart in 2012 \citegentry_BGV, the state of the art on transciphering has moved away from work on AES to focus on new symmetric algorithms that are better suited for a homomorphic execution. Yet, with recent advances in homomorphic cryptosystems, the question arises as to where we stand today. Especially since AES execution is the application that may be chosen by NIST in the FHE part of its future call for threshold encryption. In this paper, we propose an AES implementation using TFHE programmable bootstrapping which runs in less than a minute on an average laptop. We detail the transformations carried out on the original AES code as well as the optimized FHE operators we developed to lead to a more efficient homomorphic evaluation. We also duly give several execution times on different machines, depending on the type of execution (sequential or parallelized). These times vary from 4.5 minutes (resp. 54 secs) for sequential (resp. parallel) execution on a standard laptop down to 28 seconds for a parallelized execution over 16 threads on a multi-core workstation.
- 26 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 79-90
Open AccessA Homomorphic AES Evaluation in Less than 30 Seconds by Means of TFHE
Since the pioneering work of Gentry, Halevi, and Smart in 2012 \citegentry_BGV, the state of the art on transciphering has moved away from work on AES to focus on new symmetric algorithms that are better suited for a homomorphic execution. Yet, with recent advances in homomorphic cryptosystems, the question arises as to where we stand today. Especially since AES execution is the application that may be chosen by NIST in the FHE part of its future call for threshold encryption. In this paper, we propose an AES implementation using TFHE programmable bootstrapping which runs in less than a minute on an average laptop. We detail the transformations carried out on the original AES code as well as the optimized FHE operators we developed to lead to a more efficient homomorphic evaluation. We also duly give several execution times on different machines, depending on the type of execution (sequential or parallelized). These times vary from 4.5 minutes (resp. 54 secs) for sequential (resp. parallel) execution on a standard laptop down to 28 seconds for a parallelized execution over 16 threads on a multi-core workstation.
- 21 June 2023
- Published by Springer Nature
- p. 117-134
Building Blocks for LSTM Homomorphic Evaluation with TFHE
- 21 June 2023
- Published by Springer Nature
- p. 117-134
Building Blocks for LSTM Homomorphic Evaluation with TFHE