Paper 2025/431 Original: eprint.iacr.org/2025/431 ↗

Commitment Schemes Based on Module-LIP

Hengyi Luo
Kaijie Jiang
Renjie Jin
Yanbin Pan
Anyu Wang
Abstract

At EUROCRYPT 2025, Jiang et al. proposed a universal framework for constructing commitment schemes via group actions and instantiated it with the Lattice Isomorphism Problem (LIP) and the Lattice Automorphism Problem (LAP), marking the first application of LIP and LAP in cryptographic constructions beyond signature and encryption schemes. In this paper, we propose a more efficient module lattice version of Jiang et al.'s commitment schemes. More precisely, we adapt all group-action-based components from their framework to the module lattice setting, thereby constructing commitment schemes that rely on specific instances of the module lattice isomorphism problem (module-LIP). We also investigate the hardness of these module-LIP problems to provide security foundations for the schemes, while extending the theoretical foundations of lattice isomorphism problems in the context of module lattices.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2026-06-02: last updated
2025-03-06: published
Short URL
https://ia.cr/2025/431
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2025/431,
      author = {Hengyi Luo and Kaijie Jiang and Renjie Jin 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, this archive does not use cookies or embedded third party content.