http://iet.metastore.ingenta.com
1887

Efficient revocable and grantable attribute-based encryption from lattices with fine-grained access control

Efficient revocable and grantable attribute-based encryption from lattices with fine-grained access control

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Attribute-based encryption (ABE) has been regarded as an attractive alternative to identity-based encryption. The feature of the ABE is that it has the ability of fine-grained access control. Access control is an effective way to ensure data security. Revocable and grantable ABE (RABE) is an extension of ABE. In this study, an efficient RABE scheme is proposed. Binary tree technique is used to deal with the issues of attribute revocation and granting. The security of the scheme is proved to be selectively secure in the standard model under the learning with errors assumption.

References

    1. 1)
      • A. Sahai , B. Waters .
        1. Sahai, A., Waters, B.: ‘Fuzzy identity based encryption’. 24th Annual Int. Conf. on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, 2005, pp. 457473.
        . 24th Annual Int. Conf. on the Theory and Applications of Cryptographic Techniques , 457 - 473
    2. 2)
      • J. Bethencourt , A. Sahai , B. Waters .
        2. Bethencourt, J., Sahai, A., Waters, B.: ‘Ciphertext-policy attribute-based encryption’. IEEE Symp. on Security and Privacy, 2007, pp. 321334.
        . IEEE Symp. on Security and Privacy , 321 - 334
    3. 3)
      • C. Chen , Z. Zhang , D. Feng .
        3. Chen, C., Zhang, Z., Feng, D.: ‘Efficient ciphertext policy attribute-based encryption with constant-size ciphertext and constant computation-cost’. Int. Conf. on Provable Security, 2011, pp. 84101.
        . Int. Conf. on Provable Security , 84 - 101
    4. 4)
      • B. Waters .
        4. Waters, B.: ‘Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization’. Int. Workshop on Public Key Cryptography, Berlin, Heidelberg, 2011, pp. 5370.
        . Int. Workshop on Public Key Cryptography , 53 - 70
    5. 5)
      • S. Hohenberger , B. Waters .
        5. Hohenberger, S., Waters, B.: ‘Attribute-based encryption with fast decryption’. Public-Key Cryptography – PKC 2013, 2013, pp. 162179.
        . Public-Key Cryptography – PKC 2013 , 162 - 179
    6. 6)
      • N. Attrapadung , B. Libert , E.D. Panafieu .
        6. Attrapadung, N., Libert, B., Panafieu, E.D.: ‘Expressive key-policy attribute-based encryption with constant-size ciphertexts’. Int. Conf. on Practice and Theory in Public Key Cryptography Conf. on Public Key Cryptography, 2011, pp. 90108.
        . Int. Conf. on Practice and Theory in Public Key Cryptography Conf. on Public Key Cryptography , 90 - 108
    7. 7)
      • R. Ostrovsky , A. Sahai , B. Waters .
        7. Ostrovsky, R., Sahai, A., Waters, B.: ‘Attribute based encryption with non-monotonic access structures’. Proc. of the 14th ACM Conf. on Computer and Communications Security, New York, 2007, pp. 195203.
        . Proc. of the 14th ACM Conf. on Computer and Communications Security , 195 - 203
    8. 8)
      • A. Boldyreva , V. Goyal , V. Kumar .
        8. Boldyreva, A., Goyal, V., Kumar, V.: ‘Identity-based encryption with efficient revocation’. Proc. of the 15th ACM Conf. on Computer and Communications Security, 2008, pp. 417426.
        . Proc. of the 15th ACM Conf. on Computer and Communications Security , 417 - 426
    9. 9)
      • N. Attrapadung , H. Imai .
        9. Attrapadung, N., Imai, H.: ‘Conjunctive broadcast and attribute-based encryption’. Pairing-Based Cryptography-Pairing, 2009, pp. 248265.
        . Pairing-Based Cryptography-Pairing , 248 - 265
    10. 10)
      • N. Attrapadung , H. Imai .
        10. Attrapadung, N., Imai, H.: ‘Attribute-based encryption supporting direct/indirect revocation modes’. Cryptography and Coding, 2009, pp. 278300.
        . Cryptography and Coding , 278 - 300
    11. 11)
      • J. Qian , X. Dong .
        11. Qian, J., Dong, X.: ‘Fully secure revocable attribute-based encryption’, J. Shanghai Jiaotong Univ., 2011, 16, (4), pp. 490496.
        . J. Shanghai Jiaotong Univ. , 4 , 490 - 496
    12. 12)
      • M. Ajtai .
        12. Ajtai, M.: ‘Generating hard instances of lattice problems’. Complexity of Computations and Proofs, Quaderni di Matematica, Preliminary version in STOC’ 96, 2004, vol. 13, pp. 132.
        . Complexity of Computations and Proofs, Quaderni di Matematica, Preliminary version in STOC’ 96 , 1 - 32
    13. 13)
      • M. Ajtai , C. Dwork .
        13. Ajtai, M., Dwork, C.: ‘A pubic-key crypto system with worst-case/average-case equivalence’. Proc. of the Annual ACM Symp. on Theory of Computing, 1996, pp. 284293.
        . Proc. of the Annual ACM Symp. on Theory of Computing , 284 - 293
    14. 14)
      • D. Micciancio .
        14. Micciancio, D.: ‘Generalized compact knapsacks, cyclic lattices, and efficient one-way functions’, Comput. Complexity, 2007, 16, (4), pp. 365411.
        . Comput. Complexity , 4 , 365 - 411
    15. 15)
      • O. Regev .
        15. Regev, O.: ‘On lattices, learning with errors, random linear codes, and cryptography’. ACM Symp. on Theory of Computing, 2005, pp. 8493.
        . ACM Symp. on Theory of Computing , 84 - 93
    16. 16)
      • M. Ajtai .
        16. Ajtai, M.: ‘Generating hard instances of the short basis problem’. Automata, Languages and Programming, 1999, pp. 19.
        . Automata, Languages and Programming , 1 - 9
    17. 17)
      • C. Gentry , C. Peikert , V. Vaikuntanathan .
        17. Gentry, C., Peikert, C., Vaikuntanathan, V.: ‘Trapdoors for hard lattices and new cryptographic constructions’, Electron. Colloq. Comput. Complex., 2008, 14, pp. 197206.
        . Electron. Colloq. Comput. Complex. , 197 - 206
    18. 18)
      • S. Agrawal , B. Dan , X. Boyen .
        18. Agrawal, S., Dan, B., Boyen, X.: ‘Efficient lattice (H)IBE in the standard model’. Advances in Cryptology – EUROCRYPT 2010, 2010, pp. 553572.
        . Advances in Cryptology – EUROCRYPT 2010 , 553 - 572
    19. 19)
      • S. Agrawal , B. Dan , X. Boyen .
        19. Agrawal, S., Dan, B., Boyen, X.: ‘Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE’. Advances in Cryptology –CRYPTO 2010, 2010, pp. 98115.
        . Advances in Cryptology –CRYPTO 2010 , 98 - 115
    20. 20)
      • D. Cash , D. Hofheinz , E. Kiltz .
        20. Cash, D., Hofheinz, D., Kiltz, E., et al: ‘Bonsai trees, or how to delegate a lattice basis’, J. Cryptol., 2010, 25, (4), pp. 523552.
        . J. Cryptol. , 4 , 523 - 552
    21. 21)
      • S. Cheng , J. Zhang .
        21. Cheng, S., Zhang, J.: ‘Adaptive-ID secure revocable identity-based encryption from lattices via subset difference method’. Information Security Practice and Experience, 2015, pp. 283297.
        . Information Security Practice and Experience , 283 - 297
    22. 22)
      • J. Chen , H.W. Lim , S. Ling .
        22. Chen, J., Lim, H.W., Ling, S., et al: ‘Revocable identity-based encryption from lattices’. Information Security and Privacy, 2012, pp. 390403.
        . Information Security and Privacy , 390 - 403
    23. 23)
      • B. Libert , D. Vergnaud .
        23. Libert, B., Vergnaud, D.: ‘Adaptive-ID secure revocable identity-based encryption’. Topics in Cryptology – CT-RSA 2009, 2009, pp. 115.
        . Topics in Cryptology – CT-RSA 2009 , 1 - 15
    24. 24)
      • S. Agrawal , X. Boyen , V. Vaikuntanathan .
        24. Agrawal, S., Boyen, X., Vaikuntanathan, V., et al: ‘Fuzzy identity based encryption form lattices’, Cryptology ePrint Archive, http://eprint.iacr.org/2011/414, 2011.
        .
    25. 25)
      • Y.T. Wang .
        25. Wang, Y.T.: ‘Lattice ciphertext policy attribute-based encryption in the standard model’, Int. J. Netw. Sec., 2014, 16, (6), pp. 444451.
        . Int. J. Netw. Sec. , 6 , 444 - 451
    26. 26)
      • K. Nguyen , H. Wang , J. Zhang .
        26. Nguyen, K., Wang, H., Zhang, J.: ‘Server-aided revocable identity-based encryption from lattices’. Cryptology and Network Security, 2016.
        . Cryptology and Network Security
    27. 27)
      • Y. Watanabe , K. Emura , J.H. Seo .
        27. Watanabe, Y., Emura, K., Seo, J.H.: ‘New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters’. Cryptographers’ Track at the RSA Conf., 2017, pp. 432449.
        . Cryptographers’ Track at the RSA Conf. , 432 - 449
    28. 28)
      • D. Micciancio , S. Goldwasser . (2002)
        28. Micciancio, D., Goldwasser, S.: ‘Complexity of lattice problems: a cryptographic perspective’ (Kluwer Academic Publishers, New York, 2002), pp. 139140.
        .
    29. 29)
      • J. Alwen , C. Peikert .
        29. Alwen, J., Peikert, C.: ‘Generating shorter bases for hard random lattices’, Theory Comput. Syst., 2011, 48, (3), pp. 535553.
        . Theory Comput. Syst. , 3 , 535 - 553
    30. 30)
      • B. Dan , X. Boyen .
        30. Dan, B., Boyen, X.: ‘Efficient selective-ID secure identity-based encryption without random oracles’, Lect. Notes Comput. Sci., 2004, (4), pp. 223238.
        . Lect. Notes Comput. Sci. , 4 , 223 - 238
    31. 31)
      • S. Agrawal , X. Boyen . (2009)
        31. Agrawal, S., Boyen, X.: Identity-based encryption from lattices in the standard model. Manuscript, 2009. http://robotics.stanford.edu/~xb/ab09/latticeibe.pdf.
        .
    32. 32)
      • R. Cramer , I. Damgård , M. Keller .
        32. Cramer, R., Damgård, I., Keller, M.: ‘On the amortized complexity of zero-knowledge protocols’. Int. Cryptology Conf. on Advances in Cryptology, 2009, pp. 177191.
        . Int. Cryptology Conf. on Advances in Cryptology , 177 - 191
    33. 33)
      • J.H Seo , K. Emura .
        33. Seo, J.H, Emura, K.: ‘Revocable identity-based cryptosystem revisited: security models and constructions’, IEEE Trans. Inf. Forensics Sec., 2014, 9, (7), pp. 11931205.
        . IEEE Trans. Inf. Forensics Sec. , 7 , 1193 - 1205
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2017.0225
Loading

Related content

content/journals/10.1049/iet-ifs.2017.0225
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address