Paper 2023/1026
Implementation and performance of a RLWE-based commitment scheme and ZKPoK for its linear and multiplicative relations
Abstract
In this paper we provide the implementation details and performance analysis of the lattice-based post-quantum commitment scheme introduced by Martínez and Morillo in their work titled «RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations» together with the corresponding Zero-Knowledge Proofs of Knowledge (ZKPoK) of valid openings, linear and multiplicative relations among committed elements. We bridge the gap between the existing theoretical proposals and practical applications, thoroughly revisiting the security proofs of the aforementioned paper to obtain tight conditions that allow us to find the best sets of parameters for actual instantiations of the commitment scheme and its companion ZKPoK. Our implementation is very flexible and its parameters can be adjusted to obtain a trade-off between speed and memory usage, analyzing how suitable for practical use are the underlying lattice-based techniques. Moreover, our implementation further extends the literature of exact Zero-Knowledge proofs, providing ZKPoK of committed elements without any soundness slack.
Metadata
- Available format(s)
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- Lattice-based CryptographyImplementationCommitment SchemeZero-Knowledge Proofs of Knowledge
- Contact author(s)
-
ramiro martinez @ upc edu
paz morillo @ upc edu
sergi rovira @ upf edu - History
- 2023-07-03: approved
- 2023-07-02: received
- See all versions
- Short URL
- https://ia.cr/2023/1026
- License
-
CC BY-SA
BibTeX
@misc{cryptoeprint:2023/1026, author = {Ramiro Martínez and Paz Morillo and Sergi Rovira}, title = {Implementation and performance of a {RLWE}-based commitment scheme and {ZKPoK} for its linear and multiplicative relations}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1026}, year = {2023}, url = {https://eprint.iacr.org/2023/1026} }