Cryptology ePrint Archive: Report 2021/942

Compact Ring Signatures from Learning With Errors

Rohit Chatterjee and Sanjam Garg and Mohammad Hajiabadi and Dakshita Khurana and Xiao Liang and Giulio Malavolta and Omkant Pandey and Sina Shiehian

Abstract: Ring signatures allow a user to sign a message on behalf of a ``ring'' of signers, while hiding the true identity of the signer. As the degree of anonymity guaranteed by a ring signature is directly proportional to the size of the ring, an important goal in cryptography is to study constructions that minimize the size of the signature as a function of the number of ring members.

In this work, we present the first compact ring signature scheme (i.e., where the size of the signature grows logarithmically with the size of the ring) from the (plain) learning with errors (LWE) problem. The construction is in the standard model and it does not rely on a common random string or on the random oracle heuristic. In contrast with the prior work of Backes et al. [EUROCRYPT'2019], our scheme does not rely on bilinear pairings, which allows us to show that the scheme is post-quantum secure assuming the quantum hardness of LWE.

At the heart of our scheme is a new construction of compact and statistically witness indistinguishable ZAP arguments for NP $\cap$ coNP, that we show to be sound based on the plain LWE assumption. Prior to our work, statistical ZAPs (for all of NP) were known to exist only assuming sub-exponential LWE. We believe that this scheme might find further applications in the future.

Category / Keywords: foundations / Ring Signatures, Learning With Errors, Proof Systems, Argument Systems, Correlation Intractability, ZAPs

Original Publication (with minor differences): IACR-CRYPTO-2021

Date: received 11 Jul 2021

Contact author: shiayan at umich edu

Available format(s): PDF | BibTeX Citation

Version: 20210713:162641 (All versions of this report)

Short URL: ia.cr/2021/942


[ Cryptology ePrint archive ]