Compact Ring Signatures from Learning With Errors

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 ∩ 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. *Stony Brook University. Email: rochatterjee@cs.stonybrook.edu University of California, Berkeley and NTT Research. Email: sanjamg@berkeley.edu University of Waterloo. Email: mdhajiabadi@gmail.com University of Illinois Urbana-Champaign. Email: dakshita@illinois.edu Stony Brook University. Email: liang1@cs.stonybrook.edu Max Planck Institute for Security and Privacy. Email: giulio.malavolta@hotmail.it **Stony Brook University. Email: omkant@cs.stonybrook.edu University of California Berkeley and Stony Brook University. Email: shiayan@umich.edu