Description
Fully Homomorphic Encryption is a powerful cryptographic construction, enabling to securely compute all functions on encrypted data, and decrypt the result of the function applied on the real data.<br/> This construction allows to securely delegate computation, which is a very important property with the increasing of the Cloud computing. Many client-server applications are appearing, all needing the computation delegating property of FHE, with different notions of security and cost. The client-server frameworks usually considered a client with small storage and computation possibilities and a cloud powerful for both. The client wants to delegate his computation with small computation and communication cost, which directly leads to Symmetric Encryption. As the frameworks considerate two types of encryption, we study the links and differences between them. Efficiency and security are not studied the same way, on one hand a SE scheme is evaluated relatively to its practical speed, storage cost and concrete cryptanalysis. On the other hand FHE is more a theoretic construction, evaluated relatively to its security assumptions and homomorphic capacities. To combine these two approaches, we need to study the different costs and efficiency implications from one type to the other. Our approach is to consider a particular family of FHE and adapt a SE scheme to build a framework efficient relatively to both metrics. Part of the study is to analyze the previous symmetric constructions relatively to this framework, more specifically figure out the error growth implied in the homomorphic decryption of the SE scheme. As minimizing this factor is not linked with SE efficiency, we have to considerate all kinds of SE constructions and find the properties suitable for FHE. First, with block-cipher constructions we can focus on the number of iterations, on the circuit depth and on the chaining mode used. Then stream-cipher constructions allow to study the error growth depending on the number of outputted bits. Finally the existent constructions of both families are not optimized nor totally suitable for our framework, leading us to the next step. This study enables us to compare the different alternatives and to conclude on properties to conserve or discard. We select some properties of known SE schemes behaving well with the FHE scheme consideration and study their compatibilities. Choosing the good characteristics for the SE-FHE framework gives us the starting point for a future optimal design.
Prochains exposés
-
Cyclotomic Cosets: Hidden Subgroup and Quantum Sieving Algorithm for Prime-Power Moduli
Orateur : Mathias Boucher - Université de Rennes
The Dihedral Coset Problem (DCP), also known as the hidden shift problem, plays a fundamental role in post-quantum public-key cryptography, since the Learning-With-Error problem reduces to DCP. The “Simon meets Kuperberg” quantum algorithm by Bonnetain and Naya-Plasencia solves the DCP in quasi-polynomial time when the modulus is a power of two. We provide a generalization of this algorithm for[…] -
Adelic reduction of module lattices
Orateur : Henry Bambury - DGA-MI et Inria Rennes
We give a strict generalisation of the LLL algorithm over number fields, based on the reduction theory of $GL(n)$ over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. -- based on joint work with Seungki Kim, Changmin Lee and Phong Nguyen ---
Cryptography
-
-
European Cyber Week: atelier cryptographie post-quantique
Dans la continuité des éditions 2021, 2022 et 2024, la DGA — en partenariat avec CREACH LABS et avec le soutien de l'ANSSI, de l'IRISA, de l'IRMAR et du Pôle d'Excellence Cyber — organise la 4e édition de l'atelier consacré à la cryptographie post-quantique dans le cadre de l'European Cyber Week 2026. Attention, il faut s'inscrire (gratuitement) au préalable — s'inscrire à la conférence Les[…] -
Post-quantum day of the cryptography seminar
A scientific day devoted to post-quantum cryptography, held in the wake of the European Cyber Week, with talks more technical than those presented at the ECW. The talks will take place at Amphi E in building 02A. To register for lunch, please do so before oct 30th using this link. -
Chiffrement homomorphe à l'aide des groupes après Nuida
Orateur : Pierre Guillot - Ravel Technologies/Université de strasbourg
Nuida et d'autres ont montré comment on peut obtenir un protocole de chiffrement pleinement homomorphe si l'on sait chiffrer les éléments d'un groupe G convenable, tout en sachant faire l'opération de G "en homomorphe". Les exemples étaient jusqu'à présent limités au chiffrement d'un bit à la fois, avec beaucoup d'opérations à effectuer pour "simuler" les portes logiques usuelles. Je vais[…]-
Cryptography
-
-
TBD
Orateur : Dung Bui - Northwestern University
-
Nouveaux doctorants
Exposés courts des nouveaux doctorants (Elouan, Quentin, Eliot)