Welcome to the UPF Digital Repository

Short attribute-based signatures for threshold predicates

Show simple item record

dc.contributor.author Herranz, Javier
dc.contributor.author Laguillaumie, Fabien
dc.contributor.author Libert, Benoît
dc.contributor.author Ràfols, Carla
dc.date.accessioned 2019-09-10T15:04:55Z
dc.date.available 2019-09-10T15:04:55Z
dc.date.issued 2012
dc.identifier.citation Herranz J, Laguillaumie F, Libert B, Ràfols C. Short attribute-based signatures for threshold predicates. In: Dunkelman O, editor. The Cryptographers’ Track at the RSA Conference Proceedings; 2012 Feb 27 - Mar 2; San Francisco, CA, USA. Berlin: Springer; 2012. p. 51-67. (LNCS; no. 7178). DOI: 10.1007/978-3-642-27954-6_4
dc.identifier.uri http://hdl.handle.net/10230/42263
dc.description Comunicació presentada a: RSA Conference, celebrada del 27 de febrer al 2 de març de 2012 a San Francisco, Califòrnia, Estats Units d'Amèrica.
dc.description.abstract 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 signatures' size of all previous ABS schemes grows linearly in the number of attributes in- volved 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.
dc.description.sponsorship J. Herranz is supported by a Ramón y Cajal grant, partially funded by the European Social Fund (ESF) of the Spanish MICINN Ministry, F. Laguillaumie by the French ANR-07-TCOM-013-04 PACE Project and B. Libert by the F.RS.-F.N.RS. through a “Chargé de recherches" fellowship and by the BCRYPT Interuniversity Attraction Pole. Both J. Herranz and C. Ràfols are partially supported by the Spanish MICINN Ministry under project MTM2009-07694 and ARES-CONSOLIDER INGENIO 2010 CSD2007-00004. C. Ràfols is with the UNESCO Chair in Data Privacy, but the views expressed in this paper are her own and do not commit UNESCO.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Springer
dc.relation.ispartof Dunkelman O, editor. The Cryptographers’ Track at the RSA Conference Proceedings; 2012 Feb 27 - Mar 2; San Francisco, CA, USA. Berlin: Springer; 2012. p. 51-67. (LNCS; no. 7178).
dc.rights © Springer The final publication is available at Springer via https://doi.org/10.1007/978-3-642-27954-6_4
dc.title Short attribute-based signatures for threshold predicates
dc.type info:eu-repo/semantics/conferenceObject
dc.identifier.doi https://dx.doi.org/10.1007/978-3-642-27954-6_4
dc.rights.accessRights info:eu-repo/semantics/openAccess
dc.type.version info:eu-repo/semantics/acceptedVersion

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account


Compliant to Partaking