Compact Ring Signatures from Learning With Errors
Compact Ring Signatures from Learning With Errors
复制标题
DOI:
10.1007/978-3-030-84242-0_11
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Rohit Chatterjee;Sanjam Garg;Mohammad Hajiabadi;Dakshita Khurana;Xiao Liang;Giulio Malavolta;Omkant Pandey;Sina Shiehian
中科院分区:
文献类型:
--
作者:
Rohit Chatterjee;Sanjam Garg;Mohammad Hajiabadi;Dakshita Khurana;Xiao Liang;Giulio Malavolta;Omkant Pandey;Sina Shiehian
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 Backeset 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 NPcoNP, 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 assumingsub-exponentialLWE. We believe that this scheme might find further applications in the future.