Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
62.328 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • MAK - Matemàtica Aplicada a la Criptografia
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • MAK - Matemàtica Aplicada a la Criptografia
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Constant size ciphertexts in threshold attribute-based encryption

Thumbnail
View/Open
Constant size ciphertexts in....pdf (212,5Kb)
 
10.1007/978-3-642-13013-7_2
 
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/12612

Show full item record
Herranz Sotoca, JavierMés informacióMés informacióMés informació
Laguillaumie, Fabien
Ràfols Salvador, Carla
Document typeConference report
Defense date2010
PublisherSpringer Verlag
Rights accessOpen Access
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
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 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.
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. 
URIhttp://hdl.handle.net/2117/12612
DOI10.1007/978-3-642-13013-7_2
Publisher versionhttp://www.springerlink.com/content/7850364500160570/
Collections
  • MAK - Matemàtica Aplicada a la Criptografia - Ponències/Comunicacions de congressos [23]
  • Departament de Matemàtiques - Ponències/Comunicacions de congressos [1.063]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
Constant size ciphertexts in....pdf212,5KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Metadata under:Metadata under CC0
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina