624 results
-
Elliptic curves for SNARK and proof systems
Speaker : Aurore Guillevic - INRIA Rennes
This talk is based on joint works with Diego Aranha, Youssef El Housni, and Simon Masson. Elliptic curves make possible in practice very interesting mechanisms of proofs. The security relies on the difficulty of the discrete log problem and variants. Succinct non-interactive arguments of knowledge (SNARK) are a very fruitful topic, so that given a sequence of instructions that can be quite large,[…] -
From Deciding Knowledge to Intrusion Detection
Speaker : Yannick Chevalier - Université de Toulouse
By interpreting terms as distributions over strings, Abadi and Rogaway proved under suitable assumptions that indistinguishability in the computational setting, accepted as the impossibility for an observer to acquire knowledge from observing a protocol execution, is equivalent to formal equivalence in a symbolic setting. This result led to multiple results on “deciding knowledge” using static[…]-
SoSysec
-
Intrusion detection
-
-
Soutenances de stages de M2
Speaker : Gael Claudel et Baptiste Germon - IRISA
-
SCA-LDPC: A Code-Based Framework for Key-Recovery Side-Channel Attacks on Post-Quantum Encryption Schemes
Speaker : Denis Nabokov - Université de Lund
Whereas theoretical attacks on standardized crypto primitives rarely lead to actual practical attacks, the situation is different for side-channel attacks. Improvements in the performance of side-channel attacks are of utmost importance. In this paper, we propose a framework to be used in key-recovery side-channel attacks on CCA-secure post-quantum encryption schemes. The basic idea is to[…] -
Side channel analysis against AEAD lightweight cryptography
Speaker : Modou SARRY - IMT Atlantique
Les dispositifs interconnectés tels que les réseaux de capteurs, la santé, les systèmes de contrôle distribués, l’internet des objets et les systèmes cyber-physiques sont de plus en plus répandus. Cette transition vers de petits appareils engendre de nouvelles préoccupations en matière de sécurité et de vie privée, car de nombreux algorithmes cryptographiques classiques ne répondent pas toujours[…] -
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[…]