Registered Attribute-Based Signature

This paper introduces the notion of registered attribute-based signature (registered ABS). Distinctly different from classical attribute-based signature (ABS), registered ABS allows any user to generate their own public/secret key pair and register it with the system. The key curator is critical to keep the system flowing, which is a fully transparent entity that does not retain secrets. Our results can be summarized as follows. This paper provides the first definition of registered ABS, which has never been defined.This paper presents the first generic fully secure registered ABS over the prime-order group from k-Lin assumption under the standard model, which supports various classes of predicate.This paper gives the first concrete registered ABS scheme for arithmetic branching program (ABP), which achieves full security in the standard model. This paper provides the first definition of registered ABS, which has never been defined. This paper presents the first generic fully secure registered ABS over the prime-order group from k-Lin assumption under the standard model, which supports various classes of predicate. This paper gives the first concrete registered ABS scheme for arithmetic branching program (ABP), which achieves full security in the standard model. Technically, our registered ABS is inspired by the blueprint of Okamoto and Takashima [PKC’11]. We convert the prime-order registered attribute-based encryption (registered ABE) scheme of Zhu et al. [ASIACRYPT’23] via predicate encoding to registered ABS by employing the technique of re-randomization with specialized delegation, while we employ the different dual-system method considering the property of registration. Prior to our work, the work of solving the key-escrow issue was presented by Okamoto and Takashima [PKC’13] while their work considered the weak adversary in the random oracle model.