Paper 2020/035

Constant-round Dynamic Group Key Exchange from RLWE Assumption

Rakyong Choi, Dongyeon Hong, and Kwangjo Kim

Abstract

In this paper, we propose a novel lattice-based group key exchange protocol with dynamic membership. Our protocol is constructed by generalizing Dutta-Barua protocol to RLWE setting, inspired by Apon et al.’s recent paper in PQCrypto 2019. We describe our (static) group key exchange protocol from Apon et al.’s paper by modifying its third round and computation step. Then, we present both authenticated and dynamic group key exchange protocol with Join and Leave algorithms. The number of rounds for authenticated group key exchange remains the same as unauthenticated one. Our protocol also supports the scalable property so that the number of rounds does not change depending on the number of group participants. By assuming the hardness of RLWE assumption and unforgeability of digital signatures, we give a full security proof for (un-)authenticated (dynamic) group key exchange protocols.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Dynamic group key exchangeauthenticated key exchangeRLWEconstant-round group key exchange
Contact author(s)
thepride @ kaist ac kr
History
2020-01-13: received
Short URL
https://ia.cr/2020/035
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/035,
      author = {Rakyong Choi and Dongyeon Hong and Kwangjo Kim},
      title = {Constant-round Dynamic Group Key Exchange from RLWE Assumption},
      howpublished = {Cryptology ePrint Archive, Paper 2020/035},
      year = {2020},
      note = {\url{https://eprint.iacr.org/2020/035}},
      url = {https://eprint.iacr.org/2020/035}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.