Paper 2025/431

Commitment Schemes Based on Module-LIP

Hengyi Luo, State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
Kaijie Jiang, Institute for Advanced Study, BNRist, Tsinghua University, Beijing, China
Yanbin Pan, State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
Anyu Wang, Institute for Advanced Study, BNRist, Tsinghua University, Beijing, China
Abstract

Recently, Jiang et al. (EUROCRYPT 2025) proposed a universal framework for constructing commitment schemes using group actions, and instantiated it with the Lattice Isomorphism Problem (LIP). This paper attempts to construct an instantiation based on module-LIP with this framework. More precisely, we first present a reduction from $\mathcal{O}_{\mathbb{L}}^2$-LIP to $\mathcal{O}_{\mathbb{L}}^2$-LAP. Then we develop a re-randomized algorithm based on the self-reduction framework of Module-LIP (Ducas et al. ASIACRYPT 2022), adapting it to the framework to construct commitment schemes.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
Lattice automorphismmodule-LIPCommitment
Contact author(s)
luohengyi @ amss ac cn
jkj21 @ mails tsinghua edu cn
panyanbin @ amss ac cn
anyuwang @ tsinghua edu cn
History
2025-03-06: approved
2025-03-06: received
See all versions
Short URL
https://ia.cr/2025/431
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/431,
      author = {Hengyi Luo and Kaijie Jiang and Yanbin Pan and Anyu Wang},
      title = {Commitment Schemes Based on Module-{LIP}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/431},
      year = {2025},
      url = {https://eprint.iacr.org/2025/431}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.