Description
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 talk, I will give an overview of Updatable Encryption, show how to build post-quantum Updatable Encryption schemes using cryptographic group actions and give an instantiation based on isogenies. This is the first post-quantum Updatable Encryption construction not based on lattices and that allows an unlimited number of updates.
This is joint-work with Antonin Leroux (DGA-MI & IRMAR).
Reference: A. Leroux and M. Roméas. Updatable Encryption from Group Actions. PQCrypto 2024.
Infos pratiques
Prochains exposés
-
Verification of Rust Cryptographic Implementations with Aeneas
Orateur : Aymeric Fromherz - Inria
From secure communications to online banking, cryptography is the cornerstone of most modern secure applications. Unfortunately, cryptographic design and implementation is notoriously error-prone, with a long history of design flaws, implementation bugs, and high-profile attacks. To address this issue, several projects proposed the use of formal verification techniques to statically ensure the[…] -
On the average hardness of SIVP for module lattices of fixed rank
Orateur : Radu Toma - Sorbonne Université
In joint work with Koen de Boer, Aurel Page, and Benjamin Wesolowski, we study the hardness of the approximate Shortest Independent Vectors Problem (SIVP) for random module lattices. We use here a natural notion of randomness as defined originally by Siegel through Haar measures. By proving a reduction, we show it is essentially as hard as the problem for arbitrary instances. While this was[…] -
Endomorphisms via Splittings
Orateur : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-