Message-Restriction-Free Commitment Scheme Based on Lattice Assumption

Abstract

A commitment scheme is a fundamental protocol and an essential component of basic cryptographic tasks, such as zero-knowledge identification. In recent years, lattice-based cryptography has been intensively studied owing to its potential to be promising post-quantum cryptography. Therefore, the commitment schemes based on lattice assumption have been studied for practical applications. Typically, many applications require to commit arbitrary vectors rather than only short ones. In order to send such large messages, one of a crucial challenges of commitment schemes is to increase the size of a message string. Various existing studies have been done to enlarge the size of a message string so far. Baum et al. constructed the commitment scheme, which can allow sending large message size in 2018. However, the domain available for message string is still being used for non-message purposes.In this paper, by improving Baum et al.'s commitment scheme, we propose a commitment scheme that can send a larger message size than Baum et al.'s message string size. Furthermore, we prove that the hiding property of our commitment scheme is based on the hardness of the decisional knapsack problem, and the binding property is based on the hardness of the module small-integer solution problem. We also show how to achieve a statistically hiding commitment scheme by setting appropriate parameters.

Privacy-Preserving Social Media With Unlinkability and Disclosure

“…For example, we may use a commitment scheme based on the prime factorization problem [9], the discrete logarithm problem [21], or a hash function [12]. Moreover, our platform can also be implemented with a commitment scheme based on lattice cryptography [1], [4], [20], which represents a post-quantum cryptographic approach. Because PPSMD is extendable to a variety of commitment schemes, it is highly versatile in practice.…”