检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张玉磊 白巧玲 马彦丽 闫晨阳 王彩芬 ZHANG Yulei;BAI Qiaoling;MA Yanli;YAN Chenyang;WANG Caifen(College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China;SGIT-UNI Cloud Data Technology CO.,LTD,Lanzhou 730000,China;Shenzhen University of Technology,Shenzhen 518118,China)
机构地区:[1]西北师范大学计算机科学与工程学院,兰州730070 [2]国网思极飞天(兰州)云数科技有限公司,兰州730000 [3]深圳技术大学,深圳518118
出 处:《电子与信息学报》2021年第9期2534-2541,共8页Journal of Electronics & Information Technology
基 金:国家自然科学基金(61662069);甘肃省高等学校科研项目(2017A-003,2018A-207)。
摘 要:在云计算应用中,确保消息的机密性和不可伪造性,同时判断不同密文对应明文的等价性显得至关重要。具有密文等值测试功能的签密方案可以实现此类安全目标。该文基于无证书公钥密码环境,设计了一个具有密文等值测试功能的无证书签密方案(CLSCET)。首先,提出了无证书密文等值测试签密方案的框架和安全模型,定义了两类具有不同攻击能力的敌手和3类安全目标。然后构造了具体的无证书密文等值测试签密方案,并分析了方案的正确性。最后,基于随机预言模型,证明该文方案满足选择密文攻击下的单向性(OW-CCA)、选择密文攻击下的不可区分性(IND-CCA2)和选择消息攻击下的不可伪造性(EUF-CMA)安全。与现有近似方案相比,该文方案满足IND-CCA2的机密性、EUF-CMA的不可伪造性和OW-CCA的密文单向性。In cloud computing applications, it is very important to ensure the confidentiality and unforgeability of messages, while judging the equivalence of different ciphertexts to plaintexts. The signcryption scheme with equality test can achieve the above security goals. Based on the certificateless public key cryptography environment, a Certificateless SignCryption scheme with Equality Test(CLSCET) is designed. Firstly, the framework and security model of the certificateless signcryption with equality test scheme are proposed,moreover two types of adversaries with different attack capabilities and three types of security targets are defined. Secondly, a specific certificateless signcryption with equality test scheme is constructed, and the correctness of the scheme is analyzed. Finally, based on the random oracle model, it is proved that the scheme satisfies the security properties of One-Way against Chosen Ciphertext Attack(OW-CCA), INDistinguishability against adaptive Chosen Ciphertext Attack(IND-CCA2) and Existential UnForgeability against adaptive Chosen Message Attack(EUF-CMA). Compared with the existing approximate schemes, the scheme satisfies the confidentiality of IND-CCA2, the unforgeability of EUF-CMA and the one-way ciphertext of OW-CCA.
关 键 词:密文等值测试 无证书公钥密码 签密 计算DIFFIE-HELLMAN问题
分 类 号:TN918.4[电子电信—通信与信息系统] TP309[电子电信—信息与通信工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.218.145.54