检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵琉涛[1] 钟林 刘吉东 王彩群 吴丹 ZHAO Liutao;ZHONG Lin;LIU Jidong;WANG Caiqun;WU Dan(Beijing Computing Center,Beijing 100094,China;Beijing Beike Rongzhi Cloud Computing Science and Technology Ltd.,Beijing 100094,China;National Internet Emergency Center,Beijing 100089,China)
机构地区:[1]北京市计算中心,北京100094 [2]北京北科融智云计算科技有限公司,北京100094 [3]国家计算机网络应急技术处理协调中心,北京100089
出 处:《网络与信息安全学报》2020年第6期128-136,共9页Chinese Journal of Network and Information Security
基 金:2020年北京市科学技术研究院财政专项。
摘 要:提出一种三接收方公钥加密方案,该方案中发送方对消息进行加密,而三接收方均能够使用各自的私钥对消息进行解密。基于双线性映射,构造出两个安全性不同的三接收方公钥加密方案。形式化证明如果间隙双线性Diffie-Hellman问题和计算性Diffie-Hellman问题是困难的,则所提的两个方案分别具有选择明文攻击安全和适应性选择密文攻击安全。所提方案仅增加了一项指数运算和一项哈希运算,就实现了3个独立的接收方,因此该方案效率较高。分析表明,该方案能够提高TLS协议的安全性并应用于分级监管公钥密码系统。A triple receiver public key cryptosystem was proposed.In the cryptosystem,a sender encrypted a message and sent to three receivers,while the three receivers were able to decrypt the message with their own private keys.Based on bilinear map,two triple receiver public key encryption schemes with different security were constructed.If the gap bilinear Diffie-Hellman(GBDH)problem and the computational Diffie-Hellman(CDH)problem were proved formally to be intractable,then the two schemes proposed were semantically secure against chosen-plaintext attacks and against adaptive chosen ciphertext attacks respectively.The proposed scheme only added an exponential operation and a hash operation,and constructed three independent receivers which had a high efficiency.Analyses show that proposed scheme can improve the security of TLS protocol and apply to hierarchical public key cryptosystems.
关 键 词:三接收方 公钥加密 双线性映射 间隙双线性Diffie-Hellman问题 计算性Diffie-Hellman问题
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62