Welcome to the resource topic for 2020/1107
Title:
Scalable Ciphertext Compression Techniques for Post-Quantum KEMs and their Applications
Authors: Shuichi Katsumata, Kris Kwiatkowski, Federico Pintore, Thomas Prest
Abstract:A \mathit{multi\text{-}recipient} key encapsulation mechanism, or \mathsf{mKEM}, provides a scalable solution to securely communicating to a large group, and offers savings in both bandwidth and computational cost compared to the trivial solution of communicating with each member individually. All prior works on \mathsf{mKEM} are only limited to classical assumptions and, although some generic constructions are known, they all require specific properties that are not shared by most post-quantum schemes. In this work, we first provide a simple and efficient generic construction of \mathsf{mKEM} that can be instantiated from versatile assumptions, including post-quantum ones. We then study these \mathsf{mKEM} instantiations at a practical level using 8 post-quantum $\mathsf{mKEM}s (which are lattice and isogeny-based NIST candidates), and CSIDH, and show that compared to the trivial solution, our \mathsf{mKEM} offers savings of at least one order of magnitude in the bandwidth, and make encryption time shorter by a factor ranging from 1.92 to 35. Additionally, we show that by combining \mathsf{mKEM} with the TreeKEM protocol used by MLS - an IETF draft for secure group messaging -$ we obtain significant bandwidth savings.
ePrint: https://eprint.iacr.org/2020/1107
Talk: https://www.youtube.com/watch?v=uvXf-AEKbf4
Slides: https://iacr.org/submit/files/slides/2020/asiacrypt/ac2020/258/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .