Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Updatable Public-Key Encryption from FESTA

Andrea Basso, Tako Boris Fouotsa, Fatna Kouider, Péter Kutas, Luciano Maino, Laurane Marco

Published Sep 1, 2026• 0 citations
OpenAlex

Related papers

Updatable Public Key Encryption in the Standard Model

Yevgeniy Dodis, Harish Karthikeyan, Daniel Wichs

Lecture notes in computer science•Jan 1, 2021•28 citations

Efficient Updatable Public-Key Encryption from Lattices

Calvin Abou Haidar, Alain Passelègue, Damien Stehlé

Lecture notes in computer science•Jan 1, 2023•17 citations

FESTA: Fast Encryption from Supersingular Torsion Attacks

Andrea Basso, Luciano Maino, Giacomo Pope

Lecture notes in computer science•Jan 1, 2023•57 citations

Public-Key Anamorphism in (CCA-Secure) Public-Key Encryption and Beyond

Giuseppe Persiano, Duong Hieu Phan, Moti M. Yung

Lecture notes in computer science•Jan 1, 2024•18 citations

Lattice-Based Updatable Public-Key Encryption for Group Messaging

Doreen Riepel, Joël Alwen, Georg Fuchsbauer +1 more

Updatable Public-Key Encryption (UPKE) augments the security of PKE with Forward Secrecy properties. While requiring more coordination between parties, UPKE enables much more efficient constructions than full-fledged Forward-Secret PKE. Alwen, Fuchsbauer and Mularczyk (AFM, Eurocrypt’24) presented the strongest security notion to date. It is the first to meet the needs of UPKE’s most important applications: Secure Group Messaging and Continuous Group Key Agreement. The authors provide a very efficient construction meeting their notion with classic security based on the Computational Diffie-Hellman (CDH) assumption in the Random Oracle Model (ROM). In this work we present the first post-quantum secure UPKE construction meeting (a slight relaxation of) the AFM security notion. Based on the Module LWE assumption, our construction is practically efficient. Moreover, public key sizes are about 1/2 and ciphertext sizes around 2/3 of those of the state-of-the-art lattice-based UPKE scheme in the ROM by Abou Haidar, Passelègue and Stehlé – despite only being shown to satisfy a significantly weaker security notion. As the AFM proofs relies on random self-reducibility of CDH, which has no analogue for lattices, we develop a new proof technique for strong UPKE, identifying the core properties required from the underlying (lattice-based) encryption scheme.

•Jun 24, 2026•0 citations

Public-key Encryption

Jiang Zhang, Zhenfeng Zhang

Springer eBooks•Jan 1, 2020•1 citation
Updatable Public-Key Encryption (UPKE) augments the security of PKE with Forward Secrecy properties. While requiring more coordination between parties, UPKE enables much more efficient constructions than full-fledged Forward-Secret PKE. Alwen, Fuchsbauer and Mularczyk (AFM, Eurocrypt’24) presented the strongest security notion to date. It is the first to meet the needs of UPKE’s most important applications: Secure Group Messaging and Continuous Group Key Agreement. The authors provide a very efficient construction meeting their notion with classic security based on the Computational Diffie-Hellman (CDH) assumption in the Random Oracle Model (ROM). In this work we present the first post-quantum secure UPKE construction meeting (a slight relaxation of) the AFM security notion. Based on the Module LWE assumption, our construction is practically efficient. Moreover, public key sizes are about 1/2 and ciphertext sizes around 2/3 of those of the state-of-the-art lattice-based UPKE scheme in the ROM by Abou Haidar, Passelègue and Stehlé – despite only being shown to satisfy a significantly weaker security notion. As the AFM proofs relies on random self-reducibility of CDH, which has no analogue for lattices, we develop a new proof technique for strong UPKE, identifying the core properties required from the underlying (lattice-based) encryption scheme.