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

Lecture notes in computer science

Lattice-Based Multi-message Multi-recipient KEM/PKE with Malicious Security

Zeyu Liu, Katerina Sotiraki, Eran Tromer, Yunhao Wang

Published Dec 7, 2025• 2 citations
Publisher
DOI
10.1007/978-981-95-5099-9_14

Related papers

Lattice-Based Updatable KEM for Group Messaging

Joël Alwen, Georg Fuchsbauer, Marta Mularczyk +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations

Simple and Efficient CCA-Secure Lattice KEM and PKE in the Standard Model

Xavier Boyen, Malika Izabachène, Qinyi Li

•Feb 16, 2026•0 citations

Efficient and Tight Oblivious Transfer from PKE with Tight Multi-user Security

Saikrishna Badrinarayanan, Daniel Masny, Pratyay Mukherjee

Lecture notes in computer science•Jan 1, 2022•4 citations

Post-Quantum Multi-Recipient Public Key Encryption

Joël Alwen, Dominik Hartmann, Eike Kiltz +2 more

A multi-message multi-recipient PKE (mmPKE) encrypts a batch of messages, in one go, to a corresponding set of independently chosen receiver public keys. The resulting ''multi-recipient ciphertext'' can be then be reduced (by any 3rd party) to a shorter, receiver specific, ''invidual ciphertext.'' Finally, to recover the i-th message in the batch from their indvidual ciphertext the i-th receiver only needs their own decryption key. A special case of mmPKE is multi-recipient PKE (mPKE) where all receivers are sent the same message. By treating (m)mPKE and their KEM counterparts as a stand-alone primitives we allow for more efficient constructions than trivially composing individual PKE/KEM instances. This is especially valuable in the post-quantum setting, where PKE/KEM ciphertexts and public keys tend to be far larger than their classic counterparts.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 15, 2023•13 citations

A Lattice-Based Oblivious Transfer Protocol in Malicious Model

Chunxiao Wang, Wang Ji-zhong

Energy Procedia•Jan 1, 2011•1 citation

A Concrete Treatment of Efficient Continuous Group Key Agreement via Multi-Recipient PKEs

Keitaro Hashimoto, Shuichi Katsumata, Eamonn W. Postlethwaite +2 more

Continuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS. Protection against device compromise is provided by commit messages: at a regular rate, each group member may refresh their key material by uploading a commit message, which is then downloaded and processed by all the other members. In practice, propagating commit messages dominates the bandwidth consumption of existing CGKAs.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Nov 12, 2021•28 citations
A multi-message multi-recipient PKE (mmPKE) encrypts a batch of messages, in one go, to a corresponding set of independently chosen receiver public keys. The resulting ''multi-recipient ciphertext'' can be then be reduced (by any 3rd party) to a shorter, receiver specific, ''invidual ciphertext.'' Finally, to recover the i-th message in the batch from their indvidual ciphertext the i-th receiver only needs their own decryption key. A special case of mmPKE is multi-recipient PKE (mPKE) where all receivers are sent the same message. By treating (m)mPKE and their KEM counterparts as a stand-alone primitives we allow for more efficient constructions than trivially composing individual PKE/KEM instances. This is especially valuable in the post-quantum setting, where PKE/KEM ciphertexts and public keys tend to be far larger than their classic counterparts.