Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
721 results
-
-
Seminar
-
Cryptography
On some efficiency aspects of the CKKS fully homomorphic encryption scheme
Speaker : Damien Stehlé - Cryptolab
Fully homomorphic encryption (FHE) is a form of encryption that allows arbitrary computations on data without requiring to decrypt the ciphertexts. Among the diverse FHE schemes, CKKS is designed to efficiently perform computations on real numbers in an encrypted state. Interestingly, Drucker et al [J. Cryptol.] recently proposed an efficient strategy to use CKKS in a black-box manner to perform[…] -
-
-
Working group
Modélisation statistique et sécurité des générateurs d'aléa pour la cryptographie
Speaker : David Lubicz - DGA, IRMAR
Dans cet exposé on essaie d'expliquer ce que l'on entend pas méthodes statistiques et on donne des exemples concrets d'application dans la cybersécurité.-
Cryptography
-
-
-
Working group
Analyse statistique des extrêmes pour la modélisation d'évènements rares ou atypiques
Speaker : Gilles Stupfler - ENSAI
-
-
-
Seminar
-
SoSysec
Voting : You Can’t Have Privacy without Individual Verifiability
Speaker : Joseph Lallemand (Loria)
Electronic voting typically aims at two main security goals: vote privacy and verifiability. These two goals are often seen as antagonistic and some national agencies even impose a hierarchy between them: first privacy, and then verifiability as an additional feature. Verifiability typically includes individual verifiability (a voter can check that her ballot is counted); universal verifiability […] -
-
-
Seminar
-
SoSysec
Binary Edwards Curves for intrinsically secure ECC implementations for the IoT
Speaker : Antoine Loiseau (CEA)
Even if recent advances in public key cryptography tend to focus on algorithms able to survive the post quantum era, at present, there is a urgent need to propose fast, low power and securely implemented cryptography to address the immediate security challenges of the IoT. In this talk, we present a new set of Binary Edwards Curves which have been defined to achieve the highest security levels (up[…] -
-
-
Seminar
-
SoSysec
When Good Components Go Bad: Formally Secure CompilationDespite Dynamic Compromise
Speaker : Catalin Hritcu (Inria Paris)
We propose a new formal criterion for secure compilation, providing strong end-to-end security guarantees for components written in unsafe, low-level languages with C-style undefined behavior. Our criterion is the first to model dynamic compromise in a system of mutually distrustful components running with least privilege. Each component is protected from all the others until it becomes[…] -