Practical infos
Next sessions
-
Séminaire C2
11h30 Katharina Boudgoust (CR CNRS, LIRMM) : The Power of NAPs: Compressing OR-Proofs via Collision-Resistant HashingProofs of partial knowledge allow for proving the validity of t out of n different statements without revealing which ones those are. In this presentation, we describe a new approach for transforming certain proofs system into new ones that allows for proving partial knowledge. The[…] -
Updatable Encryption from Group Actions
Speaker : Maxime Romeas - ANSSI
Updatable Encryption is a variant of symmetric encryption that allows to rotate the encryption key in the outsourced storage setting while minimizing the bandwith used. Indeed, any third party can update ciphertexts to the new key using a token provided by the key holder. UE schemes aim at providing strong confidentiality guarantees against adversaries that can corrupt keys and tokens. In this[…] -
Euclidean lattice and PMNS: arithmetic, redundancy and equality test
Speaker : Fangan Yssouf Dosso - Laboratoire SAS, École des Mines de Saint-Étienne
The Polynomial Modular Number System (PMNS) is an integer number system that aims to speed up arithmetic operations modulo a prime number p. This system is defined by a tuple (p, n, g, r, E), where p, n, g and r are positive integers, and E is a polynomial with integer coefficients, having g as a root modulo p. Arithmetic operations in PMNS rely heavily on Euclidean lattices. Modular reduction in[…]