一个多授权中心的属性基签密方案  

A Multi-Authority Attribute-based Signcryption Scheme

作　　者：聂旭云[1,2] 鲍阳阳 孙剑飞 熊虎[1,2] 秦志光[1,2] NIE Xuyun;BAO Yangyang;SUN Jianfei;XIONG Hu;QIN Zhiguang(School of Information and Sotiware Engineering,University of Electronic Science and Technology of China,Chengdu 610054,China;Network and Data Security Key Laboratory of Sichuan Province（University of Electronic Science and Technology of China）,Chengdu 610054,China)

机构地区：[1]电子科技大学信息与软件工程学院,成都中国610054 [2]网络与数据安全四川省重点实验室(电子科技大学),成都中国610054

出　　处：《信息安全学报》2018年第5期15-24,共10页Journal of Cyber Security

基　　金：国家自然科学基金[No.61672135];国家自然科学基金项目[No.61602097];广东省科技项目[No.2016A010101002];四川省科技厅科技支撑计划[No.2016JZ0020];"十三五"国家密码发展基金密码理论课题[No.MMJJ20170204];电子科技大学中央高校新进教师科研启动基金[No.ZYGX2015KYQD136];内江市科技孵化项目[No.170676];国家自然基金重点国际(地区)合作研究项目[No.61520106007];四川省科技支撑计划[No.2016GZ0065]资助

摘　　要：属性基签密体制能同时保证消息的保密性和存在性不可伪造,并能实现一对多的密文数据共享和细粒度访问控制。现有的属性基签密方案均是在单一授权机构下实现,容易产生单点失效和负担过重等问题。本文通过将用户的多个属性交由不同的授权中心分别管理,从而构造出一个适用于个人健康管理系统(PHR)的多授权中心属性基签密方案,并通过性能分析和仿真实验说明本文所提方案具有较短的用户密钥长度和较小的解签密时间开销。方案的安全性在标准模型下被规约到双线性Diffle-Hellman假设和计算Diffle-Hellman假设。Attribute-based signcryption schemes can not only achieve confidentiality and existential unforgeablity, but also provide one-to-many encryption and fine-grained access control. Unfortunately, all of the existing attribute-based signcryption are constructed with the support of a single authority center, which may suffer from single point failure and become the efficiency bottle-neck. we multiple attributes of associated with users are managed by the single authority. To tackle this challenge, we propose a multi-authority attribute-based signcryption scheme by allowing different authority centers to manage multiple attributes. Furthermore, a secure Personal Health Record（PHR） sharing system is also constructed based on the suggested multi-authority attribute-based signcryption scheme. Performance evaluation and simulation experiment demonstrate that the proposed scheme outperforms the existing work in terms of the length of the private key and the computational cost of unsigncryption algorithm. The security of our scheme is formally proved under the Bilinear Diffie-Hellman assumption and Computational Diffie-Hellman assumption in the standard model.

关 键 词：多授权中心 属性基密码体制 签密 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]