Short Attribute-Based Signatures for Threshold Predicates

Javier Herranz (1) , Fabien Laguillaumie (2, 3) , Benoît Libert (4) , Carla Ràfols (1)

1 MAK - Departament of Matemàtica Aplicada IV Mathematics Applied to Cryptography
2 ARIC - Arithmetic and Computing
3 Equipe AMACC - Laboratoire GREYC - UMR6072
4 ICTEAM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics

Attribute-based cryptography is a natural solution for fine-grained access control with respect to security policies. In the case of attribute-based signatures (ABS), users obtain from an authority their secret keys as a function of the attributes they hold, with which they can later sign messages for any predicate satisfied by their attributes. A verifier will be convinced of the fact that the signer's attributes satisfy the signing predicate while remaining completely ignorant of the identity of the signer. In many scenarios where authentication and anonymity are required, like distributed access control mechanisms in ad hoc networks, the bandwidth is a crucial and sensitive concern. The signature size of all previous ABS schemes grows linearly in the number of attributes involved in the signing predicate. We propose the first two attribute-based signature schemes with constant size signatures. Their security is proven in the selective-predicate and adaptive-message setting, in the standard model, under chosen message attacks, with respect to some algorithmic assumptions related to bilinear groups. The described schemes are for the case of threshold predicates, but they can be extended to admit some other (more expressive) kinds of monotone predicates.

Keywords: Attribute-based signatures; constant signature size

Domains: Cryptography and Security [cs.CR]

Javier Herranz, Fabien Laguillaumie, Benoît Libert, Carla Ràfols. Short Attribute-Based Signatures for Threshold Predicates. RSA Conference 2012, 2012, San Francisco, United States. pp.51-67. ⟨hal-00611651⟩