DocumentCode
2291059
Title
Constant ciphertext length in multi-authority Ciphertext Policy Attribute Based Encryption
Author
Doshi, Nishant ; Jinwala, Devesh
Author_Institution
Comput. Eng. Dept., S.V. Nat. Inst. of Technol., Surat, India
fYear
2011
fDate
15-17 Sept. 2011
Firstpage
451
Lastpage
456
Abstract
In Ciphertext Policy Attribute Based Encryption (CP-ABE)a previously defined association between the attributes of a user and the ciphertext associated with these attributes is exploited to determine the secret key of the user. However, for a user with multiple attributes, the length of the key depends on the number of attributes. The existing methods that use reasonably computable decryption policies produce the ciphertext of size at least linearly varying with the number of attributes. In this paper, we propose two schemes. One scheme is of variable length based on Bethencourt et al. construction. In second scheme, the ciphertext remains constant in length, irrespective of the number of attributes. It works for a threshold case: the number of attributes in a policy must be a subset of attributes in a secret key. The security of scheme is based on Decisional Bilinear Diffie-Hellman (DBDH) problem.
Keywords
authorisation; cryptography; set theory; variable length codes; attribute subset; computable decryption policy; constant ciphertext length; decisional bilinear Diffie-Hellman problem; multiauthority ciphertext policy attribute based encryption; scheme security; secret key; variable length; Communications technology; Computers; Encryption; Public key; Resistance; Attribute; Attribute based encryption; ciphertext policy; constant ciphertext length; multi-authority;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Communication Technology (ICCCT), 2011 2nd International Conference on
Conference_Location
Allahabad
Print_ISBN
978-1-4577-1385-9
Type
conf
DOI
10.1109/ICCCT.2011.6075139
Filename
6075139
Link To Document