JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19]


Journal of Information Science and Engineering, Vol. 31 No. 1, pp. 247-265


A Fully Secure Ciphertext-Policy Attribute-Based Encryption With a Tree-Based Access Structure

SADIKIN RIFKI1,3, YOUNGHO PARKM2,+ AND SANGJAE MOON1
1School of Electrical Engineering and Computer Science
2School of Electronics Engineering
Kyungpook National University
Daegu, 702-701 Korea
3Research Center for Informatics
Indonesian Institute of Sciences
Bandung, 40135 Indonesia
E-mail: {rifki; parkyh; sjmoon}@knu.ac.kr 

 

    A new fully secure ciphertext-policy attributed based encryption (CP-ABE) scheme with high expressibity access policy is presented. Our CP-ABE scheme uses tree-based access structure which includes AND, OR, threshold and NOT gates which granted high degree of expressibility for encryptor to make an access policy. Moreover, our scheme achieves full security CP-ABE definition where any access structure can be chosen as the challenge ciphertext. The proposed CP-ABE uses composite bilinear groups and dual encryption paradigm to achieve full security CP-ABE definition. We argue that our CPABE scheme is secure and feasible. 

Keywords: dciphertext policy attribute based encryption, access control, pairing based cryptography, public encryption system, secure file distribution

  Retrieve PDF document (JISE_201501_13.pdf)