检索结果-南通市图书馆

CLORKE-SFS:Certificateless One-Round key exchange protocol with Strong Forward Security in Limited Communication Scenarios

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2021年第7期18卷 211-222页

作者： Xiaowei Li Dengqi Yang Benhui Chen Yuqing Zhang Department of Mathematics and Computer Science Dali UniversityDali 671003China National Computer Network Intrusion Protection Center University of the Chinese Academy of SciencesBeijing 100049China

Certificateless one-round key exchange(CL-ORKE)protocols enable each participant to share a common key with only one round of communication which greatly saves communication cost.CLORKE protocols can be applied to scenarios with limited communication,such as space communication.Although CL-ORKE protocols have been researched for years,lots of them only consider what secrets can be compromised but ignore the time when the secrets have been corrupted.In CL-ORKE protocols,the reveal of the long-term key attacks can be divided into two different attacks according to the time of the long-term key revealed:the attack to weak Forward Security(wFS)and the attack to strong Forward Security(sFS).Many CLKE protocols did not take into account the sFS property or considered sFS as wFS.In this paper,we first propose a new security model for CL-ORKE protocols which considers the sFS property as well as the Ephemeral key Reveal attack.Then,we give a CL-ORKE protocol which is called CLORKE-SFS.CLORKE-SFS is provably secure under the proposed model provided the Elliptic Curve Computational Diffie-Hellman(ECCDH)and the Bilinear Computational Diffie-Hellman problem(BCDH)assumption hold.The security model and the protocol may give inspiration for constructing oneround key exchange protocols with perfect forward security in certificateless scenarios.

关键词： key exchange protocol strong forward security one-round certificateless

维普期刊数据库

A Provably Secure General Construction for key exchange protocols Using Smart Card and Password

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第2期26卷 271-278页

作者： ZHANG Gefei FAN Dan ZHANG Yuqing LI Xiaowei National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences State key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences

key exchange protocols using both smart card and password are widely used nowadays since they provide greater convenience and stronger security than protocols using only a password.Most of these protocols are often limited to simple network systems,and they may have security risks.We propose a general construction for key exchange protocols using smart card and password to avoid these flaws.The constructed protocol from the general construction has only one additional communication round than the original public encryption scheme.This construction is proven secure under random oracle model,so it can resist several common types of attacks.It is also adapted well to various networks.Compared with related protocols,the proposed key exchange protocol generated from the general construction has better secure properties and good computational efficiency in storage cost and operation time.

关键词： General construction Provable secure Smart card Password key exchange protocol

Lattice-based key exchange on small integer solution problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2014年第11期57卷 150-161页

作者： WANG ShanBiao ZHU Yan MA Di FENG RongQuan School of Mathematical Sciences Peking University School of Computer and Communication Engineering University of Science and Technology Beijing Department of Computer and Information Science University of Michigan-Dearborn

In this paper, we propose a new hard problem, called bilateral inhomogeneous small integer solution(Bi-ISIS), which can be seen as an extension of the small integer solution problem on lattices. The main idea is that, instead of choosing a rectangle matrix, we choose a square matrix with small rank to generate Bi-ISIS problem without affecting the hardness of the underlying SIS problem. Based on this new problem, we present two new hardness problems: computational Bi-ISIS and decisional problems. As a direct application of these problems, we construct a new lattice-based key exchange(KE) protocol, which is analogous to the classic DiffieHellman KE protocol. We prove the security of this protocol and show that it provides better security in case of worst-case hardness of lattice problems, relatively efficient implementations, and great simplicity.

关键词： cryptography lattices small integer solutions key exchange protocol secure communications

Cryptanalysis of Schemes Based on Pseudoinverse Matrix

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2016年第3期21卷 209-213页

作者： LIU Jinhui ZHANG Huanguo JIA Jianwei School of Computer Wuhan University Wuhan 430072Hubei China key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan 430072 Hubei China

Advances in quantum computation threaten to break public key eryptosystems that are based on the difficulty of fac- torization or the difficulty of discrete logariths, although , no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures up to now. The proposed new quasi-inverse based cryptography scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we illustrate that two of the quasi-inverse based cryptography are vulnerable to a structural attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. In addition, we conduct a detailed analysis on attack methods and provide some improved suggestions on these two schemes.

关键词： cryptography post-quantum computational cryptography key exchange protocol cryptanalysis matrix decomposition

维普期刊数据库