Cryptology ePrint Archive: Report 2019/1301

Modular lattice signatures, revisited

Dipayan Das and Jeffrey Hoffstein and Jill Pipher and William Whyte and Zhenfei Zhang

Abstract: In this paper we revisit the modular lattice signature scheme and its efficient instantiation known as pqNTRUSign. First, we show that a modular lattice signature scheme can be based on a standard lattice problem. The fundamental problem that needs to be solved by the signer or a potential forger is recovering a lattice vector with a restricted norm, given the least significant bits. We show that this problem is equivalent to the short integer solution (SIS) problem over the corresponding lattice.

In addition, we show that by replacing the uniform sampling in pqNTRUSign with a bimodal Gaussian sampling, we can further reduce the size of a signature. An important new contribution, enabled by this Gaussian sampling version of pqNTRUSign, is that we can now perform batch verification of messages signed by the same public key, which allows the verifier to check approximately 24 signatures in a single verification process.

Category / Keywords: public-key cryptography / lattice based signatures, NTRU, signature aggregation

Original Publication (in the same form): designs, codes and cryptography
DOI:
10.1007/s10623-019-00694-x

Date: received 8 Nov 2019, last revised 12 Nov 2019

Contact author: dasdipayan crypto at gmail com,jhoff@math brown edu,wwhyte@qti qualcomm com,zhenfei zhang@hotmail com

Available format(s): PDF | BibTeX Citation

Version: 20191112:144059 (All versions of this report)

Short URL: ia.cr/2019/1301


[ Cryptology ePrint archive ]