Filter by content type
Select one or more filters. This choice will reload the page to display the filtered results.
688 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[…] -
-
-
Seminar
-
Cryptography
ECDSA White-Box Implementations, Feedback on CHES 2021 WhibOx Contest
Speaker : Agathe Houzelot - Idemia
Cryptographic algorithms are primarily designed to be secure in the black-box model, where an attacker can only observe their input/output behavior. However in practice, algorithms are rarely executed in a completely isolated environment and additional information is often leaked. In the context of mobile applications or connected objects, devices often lack secure storage to protect secret keys,[…] -
-
-
Seminar
-
Cryptography
Password-Authenticated Key Exchange (PAKE) from Isogenies
Speaker : Sabrina Kunzweiler - Université Bordeaux
The passwords that we use in our everyday life are often chosen to be easily memorable which makes them vulnerable to attacks. This problem is addressed by password-authenticated key exchange (PAKE). The general idea is to enable two parties who share the same (potentially weak) password to establish a strong session key. Most PAKE protocols used today are based on Diffie-Hellman key exchange in[…] -
-
-
Seminar
-
Cryptography
Updatable Public Key Encryption with Lattices
Speaker : Calvin Abou-Haidar - ENS Lyon
Updatable public key encryption has recently been introduced as a so- lution to achieve forward-security in the context of secure group messaging without hurting efficiency, but so far, no efficient lattice-based instantia- tion of this primitive is known. In this work, we construct the first LWE-based UPKE scheme with polynomial modulus-to-noise rate, which is CPA-secure in the standard model. At[…] -
-
-
Seminar
-
Cryptography
Correction of dual lattice attacks
Speaker : Kevin Carrier - CY Cergy
The security of cryptographic systems such as Kyber and Dilithium (currently undergoing standardization by NIST) fundamentally hinges on the Learning With Errors (LWE) problem. However, the state of the art for attacking this problem is not yet entirely clear. Specifically, the validity of dual attacks on LWE is currently under scrutiny due to their analyses relying on heuristics that have proven[…] -
-
-
Seminar
-
Cryptography
Generic Attack on Duplex-Bases AEAD Modes using Random Function Statistics
Speaker : Rachelle Heim Boissier - Inria
Duplex-based authenticated encryption modes with a sufficiently large key length are proven to be secure up to the birthday bound 2^(c/2), where c is the capacity. However this bound is not known to be tight and the complexity of the best known generic attack, which is based on multicollisions, is much larger: it reaches 2^c/α where α represents a small security loss factor. There is thus an[…] -