Seo proposes a size-reduced signature scheme, which applies the discrete logarithm principle (DLP) and relies on the computational Diffie-Hellman assumption (CDH) in the standard model. The author first introduces background knowledge, then presents the new scheme, and finally analyzes the proposed scheme in terms of security and performance.
The newly proposed scheme improves the Hohenberger-Waters signature scheme by removing the stateful information from the signature so it becomes a stateless signature scheme, but retains the constant size of the signature. Compared to the best-known same-type (stateless, CDH assumption, and standard model) Waters signature scheme, the newly proposed scheme is more compact and practical in terms of the size of the public key: it is linear in the security parameter in the Waters scheme, particularly needing 164 group elements for 80-bit security, but the public key of the newly proposed scheme needs only 29 group elements for 80-bit security.
The author also discusses two extensions to the proposed scheme: reducing the signature size by compressing tags using pseudo-random functions (PRFs), and expanding the scheme to include type-2 pairings or type-3 pairings from type-1 pairings. The proposed scheme is a clear addition to the CDH-based stateless signature family.