Welcome to the UPF Digital Repository

Constant size ciphertexts in threshold attribute-based encryption

Show simple item record

dc.contributor.author Herranz, Javier
dc.contributor.author Laguillaumie, Fabien
dc.contributor.author Ràfols, Carla
dc.date.accessioned 2019-09-10T17:16:09Z
dc.date.available 2019-09-10T17:16:09Z
dc.date.issued 2010
dc.identifier.citation Herranz J., Laguillaumie F., Ràfols C. Constant size ciphertexts in threshold attribute-based encryption. In: Nguyen PQ, Pointcheval D, editors. Public Key Cryptography – PKC 2010. 13th International Conference on Practice and Theory in Public Key Cryptography Proceedings; 2010 May 26-28; Paris, France. Berling: Springer; 2010. p. 19-34. (LNCS; no. 6056). DOI: 10.1007/978-3-642-13013-7_2
dc.identifier.uri http://hdl.handle.net/10230/42265
dc.description Comunicació presentada a: PKC 2010. 13th International Conference on Practice and Theory in Public Key Cryptography, celebrada del 26 al 28 de maig de 2010 a París, França.
dc.description.abstract Attribute-based cryptography has emerged in the last years as a promising primitive for digital security. For instance, it provides good solutions to the problem of anonymous access control. In a ciphertext- policy attribute-based encryption scheme, the secret keys of the users de- pend on their attributes. When encrypting a message, the sender chooses which subset of attributes must be held by a receiver in order to be able to decrypt. All current attribute-based encryption schemes that admit reasonably expressive decryption policies produce ciphertexts whose size depends at least linearly on the number of attributes involved in the policy. In this paper we propose the first scheme whose ciphertexts have constant size. Our scheme works for the threshold case: users authorized to decrypt are those who hold at least t attributes among a certain universe of attributes, for some threshold t chosen by the sender. An extension to the case of weighted threshold decryption policies is possible. The security of the scheme against selective chosen plaintext attacks can be proven in the standard model by reduction to the augmented multi-sequence of exponents decisional Di e-Hellman (aMSE-DDH) problem.
dc.description.sponsorship The work of Javier Herranz is supported by a Ramón y Cajal grant, partially funded by the European Social Fund (ESF) of the Spanish MICINN Ministry. Carla Ràfols holds an FPI grant of the Spanish MICINN Ministry. The work of both these authors is partially supported by the Spanish MICINN Ministry under project MTM2009-07694. The work of Fabien Laguillaumie is supported by the French ANR-07-TCOM-013-04 PACE Project.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher Springer
dc.relation.ispartof Nguyen PQ, Pointcheval D, editors. Public Key Cryptography – PKC 2010. 13th International Conference on Practice and Theory in Public Key Cryptography Proceedings; 2010 May 26-28; Paris, France. Berling: Springer; 2010. p. 19-34. (LNCS; no. 6056).
dc.rights © Springer The final publication is available at Springer via https://doi.org/10.1007/978-3-642-13013-7_2
dc.title Constant size ciphertexts in threshold attribute-based encryption
dc.type info:eu-repo/semantics/conferenceObject
dc.identifier.doi https://dx.doi.org/10.1007/978-3-642-13013-7_2
dc.subject.keyword Attribute-based encryption
dc.subject.keyword Provable security
dc.subject.keyword Pairings
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

Browse

My Account

Statistics

Compliant to Partaking