首页> 外文会议>International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery >Algebraic Decision Diagram-Based CP-ABE with Constant Secret and Fast Decryption
【24h】

Algebraic Decision Diagram-Based CP-ABE with Constant Secret and Fast Decryption

机译:基于代数决策图的CP-ABE,具有恒定的秘密和快速解密

获取原文

摘要

Ciphertext-policy attribute-based encryption (CP-ABE) is applied to many data service platforms to provides secure and fine-grained access control. In this paper, a new CP-ABE system based on the algebraic decision diagram (ADD) is presented. The new system makes full use of both the powerful description ability and the high calculating efficiency of ADD to improves the performance and efficiency of algorithms contained in CP-ABE. First, the new system supports both positive and negative attributes in the description of access polices. Second, the size of the secret key is constant and is not affected by the number of attributes. Third, time complexity of the key generation and decryption algorithms are O(1). Finally, this scheme allows visitors to have different access permissions to access shared data or file. At the same time, PV operation is introduced into CP-ABE framework for the first time to prevent resource conflicts caused by read and write operations on shared files. Compared with other schemes, the new scheme proposed in this paper performs better in function and efficiency.
机译:基于密文 - 策略属性的加密(CP-ABE)应用于许多数据服务平台,以提供安全和细粒度的访问控制。本文提出了一种基于代数决策图(ADD)的新CP-ABE系统。新系统充分利用了强大的描述能力和高计算效率,提高了CP-ABE中所含算法的性能和效率。首先,新系统在访问策略的描述中支持正面和否定属性。其次,秘密密钥的大小是常量的,不受属性数的影响。第三,关键生成和解密算法的时间复杂度是O(1)。最后,此方案允许访问者具有访问共享数据或文件的不同访问权限。与此同时,PV操作首次引入CP-ABE框架,以防止由共享文件上的读写操作引起的资源冲突。与其他方案相比,本文提出的新方案在功能和效率方面表现更好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号