Shorter ring signatures from standard assumptions (Q2289206)

The authors proposed a very new, robust and short signature scheme. The main construction of the ring signature scheme is presented in Section 4, based on an asymptotically shorter ring signature from the hardness of the Diffie-Hellman assumption in bilinear groups. Each signature comprises \(o(\sqrt[3]{n})\) group elements, signing a message requires computing \(o(\sqrt[3]{n})\) exponentiations, and verifying a signature requires \(o({n}^{2/3})\) pairing operations. The authors also claim that this is the first ring signature based on bilinear groups with \(o(\sqrt{n})\) signatures and sublinear verification complexity. Thus, this signature scheme can opt for practical use. For the entire collection see [Zbl 1408.94006].