KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Ciphertext policy attribute-based encryption supporting unbounded attribute space from R-LWE

  • Chen, Zehong (College of Information Engineering, Shenzhen University) ;
  • Zhang, Peng (College of Information Engineering, Shenzhen University) ;
  • Zhang, Fangguo (School of Data and Computer Science, Sun Yat-sen University) ;
  • Huang, Jiwu (College of Information Engineering, Shenzhen University)
  • Received : 2016.11.02
  • Accepted : 2017.02.14
  • Published : 2017.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

Ciphertext policy attribute-based encryption (CP-ABE) is a useful cryptographic technology for guaranteeing data confidentiality but also fine-grained access control. Typically, CP-ABE can be divided into two classes: small universe with polynomial attribute space and large universe with unbounded attribute space. Since the learning with errors over rings (R-LWE) assumption has characteristics of simple algebraic structure and simple calculations, based on R-LWE, we propose a small universe CP-ABE scheme to improve the efficiency of the scheme proposed by Zhang et al. (AsiaCCS 2012). On this basis, to achieve unbounded attribute space and improve the expression of attribute, we propose a large universe CP-ABE scheme with the help of a full-rank differences function. In this scheme, all polynomials in the R-LWE can be used as values of an attribute, and these values do not need to be enumerated at the setup phase. Different trapdoors are used to generate secret keys in the key generation and the security proof. Both proposed schemes are selectively secure in the standard model under R-LWE. Comparison with other schemes demonstrates that our schemes are simpler and more efficient. R-LWE can obtain greater efficiency, and unbounded attribute space means more flexibility, so our research is suitable in practices.

Keywords

References

  1. S. Gorbunov, V. Vaikuntanathan and H. Wee, "Attribute-based encryption for circuits," Journal of ACM, vol. 62, no. 6, pp. 45:1-45:33, 2015.
  2. A. Sahai and B. Waters, "Attribute-based encryption for fine-grained access control of encrypted data," in Proc. of 13th ACM Conference on Computer and Communications Security, pp. 89-98, October 30 - November 3, 2006.
  3. J. Bethencourt, A. Sahai and B. Waters, "Ciphertext policy attribute-based encryption," in Proc. of 2007 IEEE Symposium on Security and Privacy, pp. 321-334, May 20-23, 2007.
  4. H. Li, D. Liu and K. Alharbi, "Enabling fine-grained access control with efficient attribute revocation and policy updating in smart grid," KSII Transactions on Internet and Information Systems, vol. 9, no. 4, pp. 1404-1423, 2015. https://doi.org/10.3837/tiis.2015.04.008
  5. L. Zhang and Y. Hu, "New constructions of hierarchical attribute-based encryption for fine-grained access control in cloud computing," KSII Transactions on Internet and Information Systems, vol. 7, no. 5, pp. 1343-1356, 2013. https://doi.org/10.3837/tiis.2013.05.023
  6. X. Gao, C. Ma, P. Zhao and L. Xiao, "Fine-grained access control scheme for social network with transitivity," Journal of Computer Applications, vol. 33, no. 1, pp. 8-11, 2013. https://doi.org/10.3724/SP.J.1087.2013.00008
  7. C. Li, X. Yang, S. Zhou, Y. Li and C. Wang, "A fined-grained cryptograph access control scheme for social network," Computer Engineering, vol. 41, no. 2, pp. 117-121, 2015.
  8. L. Cheung and C. Newport, "Provably secure ciphertext policy ABE," in Proc. of 14th ACM Conference on Computer and Communications Security, pp. 456-465, October 29 - November 2, 2007.
  9. J. Hur, "Improving security and efficiency in attribute-based data sharing," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 10, pp. 2271-2282, 2013. https://doi.org/10.1109/TKDE.2011.78
  10. P. Zhang, Z. Chen, K. Liang, S. Wang and T. Wang, "A cloud-based access control scheme with user revocation and attribute update," in Proc. of 21st Australasian Conference on Information Security and Privacy, pp. 1-16, July 4-6, 2016.
  11. X. Liu, J. Ma, J. Xiong, Q. Li, T. Zhang and H. Zhu, "Threshold attribute-based encryption with attribute hierarchy forlattices in the standard model," IET Information Security, vol. 8, no. 4, pp. 217-223, 2014. https://doi.org/10.1049/iet-ifs.2013.0111
  12. W. Zhu, J. Yu, T. Wang, P. Zhang and W. Xie, "Efficient attribute-based encryption from R-LWE," Chinese Journal of Electronics, vol. 23, no. 4, pp. 778-782, 2014.
  13. T.S. Fun and A. Samsudin, "Lattice ciphertext-policy attribute-based encryption from ring-LWE," in Proc. of 2015 International Symposium on Technology Management and Emerging Technologies (ISTMET), pp. 258-262, Augest 25-27, 2015.
  14. A. Lewko and B. Waters, "Unbounded HIBE and attribute based encryption," in Proc. of 30th Annual International Conference on Theory and Applications of Cryptographic Techniques: Advances in Cryptology, pp. 547-567, May 15-19, 2011.
  15. T. Okamoto and K. Takashima, "Fully secure unbounded inner-product and attribute-based encryption," in Proc. of 18th International Conference on the Theory and Application of Cryptology and Information Security, pp. 349-366, December 2-6, 2012.
  16. Y. Rouselakis and B. Waters, "Practical constructions and new proof methods for large universe attribute-based encryption," in Proc. of 20th ACM Conference on Computer and Communications Security, pp. 463-474, November 4-8, 2013.
  17. Q. Li, J. Ma, R. Li, J. Xiong and X. Liu, "Provably secure unbounded multi-authority ciphertext-policy attribute-based encryption," Security and Communication Networks, vol. 8, pp. 4098-4109, 2015. https://doi.org/10.1002/sec.1326
  18. S. Agrawal, X. Boyen, V. Vaikuntanathan, P. Voulgaris and H. Wee, "Functional encryption for threshold functions (or fuzzy IBE) from lattices," in Proc. of 15th International Conference on Practice and Theory in Public Key Cryptography, pp. 280-297, May 21-23, 2012.
  19. J. Zhang, Z. Zhang and A. Ge, "Ciphertext policy attribute-based encryption from lattices," in Proc. of 7th ACM Symposium on Information, Computer and Communications Security, pp. 16-17, May 2-4, 2012.
  20. V. Lyubashevsky, C. Peikert and O. Regev, "On ideal lattices and learning with errors over rings," in Proc. of 29th Annual International Conference on Theory and Applications of Cryptographic Techniques, pp. 1-23, May 30-June 3, 2010.
  21. D. Stehle and R. Steinfeld, "Making NTRU as secure as worst-case problems over ideal lattices," in Proc. of 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.27-47, May 15-19, 2011.
  22. X. Yang, L.Wu, M. Zhang and X. Chen, "An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption," Computers & Mathematics with Application, vol. 65, no. 9, pp. 1254-1263, 2013. https://doi.org/10.1016/j.camwa.2012.02.030
  23. S. Agrawal, D. Boneh and B. Xavier, "Efficient lattice (H)IBE in the standard model," in Proc. of 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 553-572, May 30-June 3, 2010.