检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:牛淑芬 杨喜艳 王彩芬 田苗 杜小妮 NIU Shufen;YANG Xiyan;WANG Caifen;TIAN Miao;DU Xiaoni(College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China;College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,China)
机构地区:[1]西北师范大学计算机科学与工程学院,兰州730070 [2]西北师范大学数学与统计学院,兰州730070
出 处:《电子与信息学报》2019年第5期1180-1186,共7页Journal of Electronics & Information Technology
基 金:国家自然科学基金(61562077;61462077;61662071;61662069);甘肃省杰出青年基金(1308RJDA007);国家留学基金~~
摘 要:群组签密既能实现群组签名,又能实现群组加密,但是现有的群组签密方案的发送者和接收者基本上在同一个密码系统中,不能满足现实环境的需求,而且基本上采用的是公钥加密技术,公钥加密技术在加密长消息时效率较低。因此该文提出由基于身份的密码体制(IBC)到无证书密码体制(CLC)的异构密码系统的混合群组签密方案。在该方案中,私钥生成器(PKG)和密钥生成中心(KGC)能够分别在IBC密码体制和CLC密码体制中产生自己的系统主密钥;而且群组成员只有协作才能解签密,提高了方案的安全性;同时在无需更换群组公钥和其他成员私钥的情况下,用户可以动态地加入该群组。所提方案采用了混合签密,具有可加密任意长消息的能力。在随机预言模型下,证明了该文方案在计算Diffie-hellman困难问题下具有保密性和不可伪造性。通过理论和数值实验分析表明该方案具有更高的效率和可行性。Group signcryption is a cryptosystem which can realize group signature and group encryption. However,the message sender and receiver of existing group signcryption schemes are basically in the same cryptosystem,which does not meet the needs of the real environment and the public key encryption technology is basically used,public key encryption technology in encrypted long message efficiency is too low.Therefore, this paper proposes a hybrid group signcryption scheme based on heterogeneous cryptosystem from IdentityBased Cryptosystem (IBC) to CertificateLess Cryptosystem (CLC).In the scheme,The Private Key Generator (PKG) in the IBC cryptosystem and Key Generation Center (KGC) in the CLC cryptosystem generate their own system master keys,and group members can only solve signcryption through collaboration,which improves the security of the scheme.Meanwhile,the user can dynamically join the group without changing the group public key and other members’ private key.The scheme uses hybrid signcryption and has the ability to encrypt any long message.It is proved that the scheme satisfies confidentiality and unforgeability in computing the Diffie-hellman hard problem in the random oracle model.Theoretical and numerical analysis shows that the scheme is more efficient and feasible.
关 键 词:无证书密码学 异构密码系统 混合签密 基于身份的密码学 群组签密
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3