Show simple item record

dc.contributor.authorHerranz Sotoca, Javier
dc.contributor.authorLaguillaumie, Fabien
dc.contributor.authorRàfols Salvador, Carla
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada IV
dc.date.accessioned2011-05-19T16:20:47Z
dc.date.available2011-05-19T16:20:47Z
dc.date.created2010
dc.date.issued2010
dc.identifier.citationHerranz, J.; Laguillaumie, F.; Rafols, C. Constant size ciphertexts in threshold attribute-based encryption. A: International Conference on Practice and Theory in Public Key Cryptography. "13th International Conference on Practice and Theory in Public Key Cryptography". París: Springer Verlag, 2010, p. 19-34.
dc.identifier.urihttp://hdl.handle.net/2117/12612
dc.description.abstractAttribute-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 ciphertextpolicy attribute-based encryption scheme, the secret keys of the users depend 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 Diffie-Hellman (aMSE-DDH) problem.
dc.format.extent16 p.
dc.language.isoeng
dc.publisherSpringer Verlag
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
dc.subject.lcshCoding theory
dc.subject.lcshInformation theory
dc.titleConstant size ciphertexts in threshold attribute-based encryption
dc.typeConference report
dc.subject.lemacInformació, Teoria de la
dc.subject.lemacCodificació, Teoria de la
dc.contributor.groupUniversitat Politècnica de Catalunya. MAK - Matemàtica Aplicada a la Criptografia
dc.identifier.doi10.1007/978-3-642-13013-7_2
dc.subject.amsClassificació AMS::94 Information And Communication, Circuits::94A Communication, information
dc.relation.publisherversionhttp://www.springerlink.com/content/7850364500160570/
dc.rights.accessOpen Access
local.identifier.drac5113244
dc.description.versionPostprint (published version)
local.citation.authorHerranz, J.; Laguillaumie, F.; Rafols, C.
local.citation.contributorInternational Conference on Practice and Theory in Public Key Cryptography
local.citation.pubplaceParís
local.citation.publicationName13th International Conference on Practice and Theory in Public Key Cryptography
local.citation.startingPage19
local.citation.endingPage34


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain