期刊文献+

适应性安全的多主密钥KP-ABE方案

Multiple-authority-key KP-ABE scheme with adaptive security
下载PDF
导出
摘要 功能加密能很好地满足多对多的网络环境下的机密性需求,功能性函数提供了比传统公钥更灵活的密文存取能力.已有的功能加密系统均只支持单主密钥功能性函数,本文提出了功能加密子类KP-ABE(key-policy attribute-based encryption)上的多主密钥适应性安全模型,该模型具有更强的表达能力及更广义的特性.利用线性多秘密共享方案,设计了该安全模型下的一个加密方案,并采用对偶法在标准模型下证明方案是IND-CPA(indistinguishability against chosen-ciphertext attacks)安全的.该方案加密数据的存取策略更为灵活,用户可根据权限存取多种类型的密文;提出的构造方法可应用于功能加密的其他子类,且计算量与单主密钥方案相比不存在线性扩张,具有较高的效率. Functional encryption provides a good way for sharing encrypted data in the network environment,which is sufficient for new emerging applications.Several recent works only focused on the systems that supported single-authority-key functionality.In order to solve the open problem of the construction of multiple authority keys functional encryption,an adaptive security model of multiple-authority-key key-policy attribute-based encryption(M-KP-ABE) was presented,which allows for functionalities that take in multiple authority keys.In this system,an encryptor can specify a policy and a capability describing what the decryptor can learn from the ciphertext.A new M-KP-ABE scheme was proposed for any attribute access structure that could be expressed by a linear multi-secret sharing scheme(LMSSS).This scheme is proven to be adaptively secure in the standard model by using the dual system encryption methodology recently introduced.The key generation centre(KGC) with multiple authority keys can combine user's capabilities in a specified manner and users can decrypt many kinds of ciphertexts.It is easy to apply this methodology to other subclasses of functional encryption with equal security and efficiency,which makes it more appropriate for applications.
出处 《中国科学技术大学学报》 CAS CSCD 北大核心 2011年第7期619-625,共7页 JUSTC
基金 国家自然科学基金(60573036) 陕西省自然科学基金(2010JM8034) 武警工程学院基础基金(wjy201119)资助
关键词 密钥策略属性基加密 适应性安全 线性多秘密共享方案 对偶法 KP-ABE adaptive security LMSSS dual system encryption
  • 相关文献

参考文献18

  • 1Lewko A, Okamoto T, Sahai A, et al. Fully secure functional encryption.- Attribute-based encryption and (hierarchical) inner product encryption [J]. Lecture Notes in Computer Science, 2010, 6 110: 62-91.
  • 2Shamir A. Identity-based cryptosystems and signature schemes [J]. Lecture Notes in Computer Science, 1985, 196: 47-53.
  • 3Boneh D, Franklin M. Identity based encryption from the Weil pairing[J]. Lecture Notes in Computer Science, 2001, 2 139: 213-229.
  • 4Cocks C. An identity based encryption scheme based on quadratic residues[J]. Lecture Notes in Computer Science, 2001, 2 260: 360-363.
  • 5Sahai A, Waters B. Fuzzy Identity Based Encryption [J]. Lecture Notes in Computer Science, 2005, 3 494: 457-473.
  • 6Goyal V, Pandey O, Sahai A, et al. Attribute-based encryption for finegrained access control of encrypted data[C]//Proceedings of the 13th ACM Conference on Computer and Communications Security. New York: ACM, 2006: 89-98.
  • 7Ostrovsky R, Sahai A, Waters B. Attribute-based encryption with nonmonotonic access structures[C]// Proceedings of the 14th ACM Conference on Computer and Communication Security. New York: ACM,2007: 195-203.
  • 8Chase M. Multi-authority attribute based encryption [J]. Lecture Notes in Computer Science, 2007, 4 392:515-534.
  • 9Waters B. Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization [J]. Lecture Notes in Computer Science, 2011, 6 571: 53-70.
  • 10Goyal V, Jain A, Pandey O, et al. Bounded ciphertext policy attribute-based encryption[J]. Lecture Notes in Computer Science, 2008, 5 126: 579-591.

二级参考文献5

  • 1[1]Blackley, G. R., Safeguarding cryptographic keys, Proc. of the 1979 AFIPS National Computer Conference,1979, 48: 313-317.
  • 2[2]Shamir, A., How to share a secret, Communications of the ACM, 1979, 22: 612-613.
  • 3[3]Blundo, C., De Santis, A., Di Crescenzo, G., Multi-secret sharing schemes, Advances in Cryptology-CRYPTO'94,1995, 839: 150-163.
  • 4[4]Beimel, A., Secure Schemes for Secret Sharing and Key Distribution, PhD thesis, Technion-Israel Institute of Techonlogy, 1996.
  • 5[5]Blundo, C., De Santis, A., Masucci, B., Randomness in Multi-Secret Sharing Schemes, Technical Report, University of Salerno, 1998.

共引文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部