Improved Lattice-Based Threshold Ring Signature Scheme [chapter]

Slim Bettaieb, Julien Schrek
2013 Lecture Notes in Computer Science  
We present in this paper an improvement of the lattice-based threshold ring signature proposed by Cayrel, Lindner, Rückert and Silva (CLRS) [LATINCRYPT '10]. We generalize the same identification scheme CLRS to obtain a more efficient threshold ring signature. The security of our scheme relies on standard lattice problems. The improvement is a significant reduction of the size of the signature. Our result is a t-out-of-N threshold ring signature which can be seen as t different ring signatures
more » ... nstead of N for the other schemes. We describe the ring signature induced by the particular case of only one signer. To the best of our knowledge, the resulted signatures are the most efficient lattice-based ring signature and threshold signature. [3]
doi:10.1007/978-3-642-38616-9_3 fatcat:73g4ekox2nhf7kwlpdm7yz4hwq