格上支持策略分割和属性撤销的CPABE方案

摘要/Abstract

摘要： 密文策略属性基加密(ciphertextpolicy attributebased encryption, CPABE)适合在云存储系统中提供数据的安全共享服务.然而,CPABE中属性撤销是一个棘手的问题.随着量子计算机的发展,传统的CPABE不再安全,基于格的CPABE能够抵抗量子攻击.提出一种格上支持策略分割和属性撤销的CPABE方案.该方案能够抵抗量子攻击,提供细粒度的访问控制和即时属性撤销.在属性撤销发生时,利用策略分割减少受影响的密文(块),并且通过密文更新方法减少密文更新的范围以及次数.理论分析表明该方案的计算开销在可控制的范围内.最后,在标准模型下证明了该方案是选择明文安全(INDCPA)的,并且其安全性可以归结于环上容错学习(ring learning with errors, RLWE)的困难性问题中.

关键词: 格密码, 密文策略属性基加密, 属性撤销, 策略分割, 环上容错学习

Abstract: Ciphertextpolicy attributebased encryption (CPABE) is suitable for providing secure datasharing services in the cloud storage scenario. However, attribute revocation is a challenging issue in CPABE. With the advancements in quantum computing research, traditional CPABE are no longer secure. Latticebased CPABE can resist quantum attacks. This paper proposes a latticebased CPABE scheme with policy splitting and attribute revocation. This scheme is resistant to quantum and collusion attacks. When attribute revocation occurs, this paper uses policy splitting to reduce the affected ciphertexts (blocks) and uses the lazy mode ciphertext update method to reduce the number and scope of ciphertexts that need to be updated. Theoretical analysis demonstrates that the overall storage cost of our scheme remains within a reasonable range. Finally, it is shown that, under the standard model, the scheme is proven secure against chosenplaintext attacks (CPA), and its security can be attributed to the ring learning with errors (RLWE) difficulty problem.

Key words: latticecryptography, ciphertextpolicy attributebased encryption, attribute revocation, policy splitting, ring learning with errors

中图分类号:

TP309

何苗, 努尔买买提·黑力力 Nurmamat HELIL, . 格上支持策略分割和属性撤销的CPABE方案[J]. 信息安全研究, 2025, 11(6): 548-.

参考文献

［1］吕欣. 健全大数据安全保障体系研究［J］. 信息安全研究，2015, 1(3): 211216［2］Sahai A, Waters B. Fuzzy identitybased encryption［C］ Proc of Int Conf on Theory & Applications of Cryptographic Techniques. Berlin:Springer, 2005: 457473［3］Goyal V, Pandey O, Sahai A, et al. Attributebased encryption for finegrained access control of encrypted data［C］ Proc of ACM Conf on Computer and Communications Security. New York:ACM, 2006: 8998［4］Bethencourt J, Sahai A, Waters B. Ciphertextpolicy attributebased encryption［C］ Proc of the 2007 IEEE Symp on Security and Privacy (SP’07). Piscataway, NJ: IEEE, 2007: 321334［5］Agrawal S, Boyen X,Vaikuntanathan V, et al. Fuzzy identity based encryption from lattices［J］. Cryptology ePrint Archive, 2011, 2011:414433［6］Zhang J, Zhang Z, Ge A. Ciphertext policy attributebased encryption from lattices［C］ Proc of ACM Asia Conf on Computer and Communications Security. New York: ACM, 2012: 1617［7］Zhang G, Qin J, Qazi S. Multiauthority attributebased encryption scheme from lattices［J］. Journal of Universal Computer Science, 2015, 21(3): 483501［8］Wang Y. Lattice ciphertext policy attributebased encryption in the standard model［J］. International Journal of Network Security, 2014, 16(6): 444451［9］Rahman M S, Basu A, Kiyomoto S. Decentralized ciphertextpolicy attributebased encryption from learning with errors over rings［C］ Proc of the 2016 IEEE TrustcomBig Data SEISPA. Piscataway, NJ: IEEE, 2016: 17591764［10］Pirretti M, Traynor P, McDaniel P, et al. Secure attributebased systems［J］. Journal of Computer Security, 2006, 18: 799837［11］Wan Z, Deng R H. HASBE: A hierarchical attributebased solution for flexible and scalable access control in cloud computing［J］. IEEE Trans on Information Forensics and Security, 2011, 7(2): 743754［12］Jahid S, Mittal P, Borisov N. EASiER: Encryptionbased access control in social networks with efficient revocation［C］ Proc of the 6th ACM Symp on Information, Computer and Communications Security. New York: ACM, 2011: 411415［13］Jahid S, Borisov N. Piratte: Proxybased immediate revocation of attributebased encryption［J］. arXiv preprint, arXiv:1208.4877, 2012［14］Li Y, Zhu J, Wang X, et al. Optimized ciphertextpolicy attributebased encryption with efficient revocation［J］. International Journal of Security and Its Applications, 2013, 7(6): 385394［15］Cheng Yong, Wang Zhiying, Ma Jun, et al. Efficient revocation in ciphertextpolicy attributebased encryption based cryptographic cloud storage［J］. Journal of Zhejiang University SCIENCE C, 2013, 14(2): 8597［16］Bouchaala M, Ghazel C, Saidane L A. Revocable sliced ciphertext policy attribute based encryption scheme in cloud computing［C］ Proc of the 15th Int Wireless Communications & Mobile Computing Conference (IWCMC). Piscataway, NJ: IEEE, 2019: 18601865［17］Chen J, Lim H W, Ling S, et al. Revocable identitybased encryption from lattices［C］ Proc of Information Security and Privacy. Berlin: Springer, 2012: 390403［18］Yang K, Wu G, Dong C, et al. Attribute based encryption with efficient revocation from lattices［J］. Security and Communication Networks, 2020, 22(1): 161170［19］Cheng L, Meng F, Meng X, et al. AKCbased revocable ABE schemes from LWE assumption［J］. Security and Communication Networks, 2020, 2020: 116［20］Wang S, Zhang X, Zhang Y. Efficient revocable and grantable attributebased encryption from lattices with finegrained access control［J］. IET Information Security, 2018, 12(2): 141149［21］Yang Y, Sun J, Liu Z, et al. Practical revocable and multiauthority CPABE scheme from RLWE forcloud computing［J］. Journal of Information Security and Applications, 2022, 65: 103108［22］Zhao S, Jiang R, Bhargava B. RLABE: A revocable lattice attribute based encryption scheme based on RLWE problem in cloud storage［J］. IEEE Trans on Services Computing, 2020, 15(2): 10261035［23］Agrawal S, Boneh D, Boyen X. Efficient lattice (H)IBE in the standard model［G］ LNCS 6110: Advances in Cryptology—EUROCRYPT2010. Berlin: Springer, 2010: 553572［24］Dai Wei, Dorz Y, Polyakov Y, et al. Implementation and evaluation of a latticebased keypolicy ABE scheme［J］. IEEE Trans on Information Forensics and Security, 2018, 13(5): 11691184［25］Gür K D, Polyakov Y, Rohloff K, et al. Practical applications of improved Gaussian sampling for trapdoor lattices［J］. IEEE Trans on Computer, 2019, 68(4): 570584［26］Micciancio D, Peikert C. Trapdoors for lattices: Simpler, tighter, faster, smaller［C］ Proc of Theory and Applications of Cryptographic Techniques. Berlin:Springer, 2012: 700718［27］雷雪娇, 王银龙, 努尔买买提·黑力力. 基于懒惰模式密文更新的CPABE属性变动方案［J］. 计算机科学, 2022, 49(10): 327334［28］Gentry C, Peikert C, Vaikuntanathan V. Trapdoors for hard lattices and new cryptographic constructions［C］ Proc of the 40th Annual ACM Symp on Theory of Computing (STOC’08). New York: ACM, 2008: 197206［29］Chen Z, Zhang P, Zhang F, et al. Ciphertext policy attributebased encryption supporting unbounded attribute space from RLWE［J］. KSII Trans on Internet Information System, 2017, 11: 22922309［30］Guo L, Wang L, Ma X, et al. A new revocable attribute based encryption on lattice［C］ Proc of Provable and Practical Security. Berlin: Springer, 2023: 309326

[1]	霍成义. 云计算中属性基加密机制研究?[J]. 信息安全研究, 2020, 6(8): 733-737.
[2]	刘会梦张光华庞少博石晓朦. 云计算下高效灵活的属性基加密方案[J]. 信息安全研究, 2017, 3(11): 1034-1039.