DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/12612

Arxiu Descripció MidaFormat
Constant size ciphertexts in....pdf212,59 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Herranz, 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.
Títol: Constant size ciphertexts in threshold attribute-based encryption
Autor: Herranz Sotoca, Javier Veure Producció científica UPC; Laguillaumie, Fabien; Ràfols Salvador, Carla Veure Producció científica UPC
Editorial: Springer Verlag
Data: 2010
Tipus de document: Conference report
Resum: 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.
URI: http://hdl.handle.net/2117/12612
DOI: 10.1007/978-3-642-13013-7_2
Versió de l'editor: http://www.springerlink.com/content/7850364500160570/
Apareix a les col·leccions:Altres. Enviament des de DRAC
MAK - Matemàtica Aplicada a la Criptografia. Ponències/Comunicacions de congressos
Departaments de Matemàtica Aplicada. Ponències/Comunicacions de congressos
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius