Welcome to the resource topic for 2025/431
Title:
Commitment Schemes Based on Module-LIP
Authors: Hengyi Luo, Kaijie Jiang, Yanbin Pan, Anyu Wang
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.
ePrint: https://eprint.iacr.org/2025/431
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 .