Shorter ring signatures from standard assumptions
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].
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Logarithmic-size ring signatures with tight security from the DDH assumption
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Tightly secure ring signatures in the standard model
- QA-NIZK arguments of same opening for bilateral commitments
- An efficient ring signature scheme from pairings
- Public Key Cryptography – PKC 2004
- A linkable ring signature scheme with unconditional anonymity in the standard model
This page was built for publication: Shorter ring signatures from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289206)
